Cross Entropy Method Meets Local Search for Continuous Optimization Problems

2017 ◽  
Vol 26 (06) ◽  
pp. 1750020
Author(s):  
Xin Zhang ◽  
Xiu Zhang

The effectiveness of cross entropy (CE) method has been investigated on both combinatorial and continuous optimization problems, though it lacks exploitative search to refine solutions. Hybrid with local search (LS) method can greatly improve the performance of evolutionary algorithm. This paper proposes a parameter-less framework combining CE with LS method. Four LS methods are chosen and four combination algorithms are obtained after combining them with the CE method. We first study the performance of the four combinations on a set of twenty eight mathematical functions including both unimodal and multimodal functions. CE hybrid with Powell’s method (CE-Pow) is identified as the most effective algorithm. Then the CE-Pow algorithm is applied to resolve proportional, integral, and derivative (PID) controller design problem and Lennard-Jones potential problem. Its performance has been verified by comparing with four state of the art evolutionary algorithms. Experimental results show that CE-Pow significantly outperforms other benchmark algorithms.

Transport ◽  
2010 ◽  
Vol 25 (4) ◽  
pp. 411-422
Author(s):  
Turkay Yildiz ◽  
Funda Yercan

Studies on seaport operations emphasize the fact that the numbers of resources utilized at seaport terminals add a multitude of complexities to dynamic optimization problems. In such dynamic environments, there has been a need for solving each complex operational problem to increase service efficiency and to improve seaport competitiveness. This paper states the key problems of seaport logistics and proposes an innovative cross‐entropy (CE) algorithm for solving the complex problems of combinatorial seaport logistics. Computational results exhibit that the CE algorithm is an efficient, convenient and applicable stochastic method for solving the optimization problems of seaport logistics operations.


2021 ◽  
Vol 7 (2) ◽  
pp. 299-311
Author(s):  
Abdelmajid Ezzine ◽  
Abdellah Alla ◽  
Nadia Raissi

Abstract This paper aims to propose a new hybrid approach for solving multiobjective optimization problems. This approach is based on a combination of global and local search procedures. The cross-entropy method is used as a stochastic model-based method to solve the multiobjective optimization problem and reach a first elite set of global solutions. In the local search step, an ∈-constraint method converts the multiobjective optimization problem to a series of parameterized single-objective optimization problems. Then, sequential quadratic programming (SQP) is used to solve the derived single-objective optimization problems allowing to reinforce and improve the global results. Numerical examples are used to demonstrate the efficiency and effectiveness of the proposed approach.


Sign in / Sign up

Export Citation Format

Share Document