[en] Evolutionary Algorithms are robust and powerful global optimization techniques for solving
large scale problems that have many local optima. However, they require high CPU
times, and they are very poor in terms of convergence performance. On the other hand,
local search algorithms can converge in a few iterations but lack a global perspective. The
combination of global and local search procedures should offer the advantages of both optimization
methods while offsetting their disadvantages. This paper proposes a new hybrid
optimization technique that merges a Genetic Algorithm with a local search strategy based
on the Interior Point method. The efficiency of this hybrid approach is demonstrated by
solving a constrained multi-objective mathematical test-case.
Disciplines :
Mechanical engineering Mathematics
Author, co-author :
Kelner, Vincent ; Université de Liège - ULiège > Département d'aérospatiale et mécanique > Turbomachines et propulsion aérospatiale
Capitanescu, Florin ; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Systèmes et modélisation
Léonard, Olivier ; Université de Liège - ULiège > Département d'aérospatiale et mécanique > Turbomachines et propulsion aérospatiale
Wehenkel, Louis ; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Systèmes et modélisation
Language :
English
Title :
A hybrid optimization technique coupling an evolutionary and a local search algorithm
R.F. Coelho, Multicriteria optimization with expert rules for mechanical design, Ph.D. Thesis, Université Libre de Bruxelles, 2004.
Coello C. A comprehensive survey of evolutionary-base multiobjective optimization. Knowl. Inf. Systems 1 3 (1999) 269-308
Fiacco A.V., and McCormick G.P. Nonlinear Programming: Sequential Unconstrained Minimization Techniques (1968), Willey, New York
K.R. Frisch, The logarithmic potential method of convex programming, Manuscript at Instiute of Economics, University of Oslo, Norway, 1955.
Holland J. Adaptation in Natural and Artificial Systems (1975), The University of Michigan Press, Ann Arbor
Karmarkar N. A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984) 373-395
Kelner V., and Léonard O. Optimal Pump Scheduling for Water Supply Using Genetic Algorithms. In: Bugeda G., Désidéri J.-A., Periaux J., Schoenauer M., and Winter G. (Eds). Proceedings of the Fifth International Conference on Evolutionary Computing for Industrial Applications. Barcelona, Spain (2003)
Kelner V., and Léonard O. Application of genetic algorithms to lubrication pump stacking design. J. Comput. Appl. Math. 168 (2004) 255-265
Morse J.N. Reducing the size of the nondominated set: pruning by clustering. Comput. Oper. Res. 7 1-2 (1980) 55-66
D. Van Veldhuizen, G. Lamont. Multiobjective evolutionary algorithm research: a history and analysis, Technical Report TR-98-03, Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Wright-Patterson AFB, Ohio, 1998.
Wright S.J. Primal-Dual Interior-Point Methods (1997), SIAM, Philadelphia, PA
Xu Y.G., Li G.R., and Wu Z.P. A novel hybrid genetic algorithm using local optimizer based on heuristic pattern move. Appl. Artif. Intell. 15 (2001) 601-631
Zitzler E., and Thiele L. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3 4 (1999) 257-271