A unified framework for population-based metaheuristics

Based on the analysis of the basic schemes of a variety of population-based metaheuristics (PBMH), the main components of PBMH are described with functional relationships in this paper and a unified framework (UF) is proposed for PBMH to provide a comprehensive way of viewing PBMH and to help understand the essential philosophy of PBMH from a systematic standpoint. The relevance of the proposed UF and some typical PBMH methods is illustrated, including particle swarm optimization, differential evolution, scatter search, ant colony optimization, genetic algorithm, evolutionary programming, and evolution strategies, which can be viewed as the instances of the UF. In addition, as a platform to develop the new population-based metaheuristics, the UF is further explained to provide some designing issues for effective/efficient PBMH algorithms. Subsequently, the UF is extended, namely UFmeme to describe the Memetic Algorithms (MAs) by adding local search (memetic component) to the framework as an extra-feature. Finally, we theoretically analyze the asymptotic convergence properties of PBMH described by the UF and MAs by the UFmeme.

[1]  Olivier François,et al.  An evolutionary strategy for global minimization and its Markov chain analysis , 1998, IEEE Trans. Evol. Comput..

[2]  Andreas C. Nearchou,et al.  Differential evolution for sequencing and scheduling optimization , 2006, J. Heuristics.

[3]  Alain Hertz,et al.  A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization , 1999, J. Heuristics.

[4]  Ali M. S. Zalzala,et al.  Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons , 2000, IEEE Trans. Evol. Comput..

[5]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[6]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[7]  Michael D. Vose,et al.  Modeling genetic algorithms with Markov chains , 1992, Annals of Mathematics and Artificial Intelligence.

[8]  Luca Maria Gambardella,et al.  Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..

[9]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[10]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[11]  Jeffrey S. Rosenthal,et al.  Convergence Rates for Markov Chains , 1995, SIAM Rev..

[12]  D. Dasgupta.  Artificial Immune Systems and Their Applications , 1998, Springer Berlin Heidelberg.

[13]  Eugeniusz Nowicki,et al.  The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..

[14]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[15]  Bing Li,et al.  A novel stochastic optimization algorithm , 2000, IEEE Trans. Syst. Man Cybern. Part B.

[16]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[17]  Günter Rudolph,et al.  Convergence of evolutionary algorithms in general search spaces , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[18]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[19]  Joe Suzuki,et al.  A Markov chain analysis on simple genetic algorithms , 1995, IEEE Trans. Syst. Man Cybern..

[20]  Kumar Chellapilla,et al.  Combining mutation operators in evolutionary programming , 1998, IEEE Trans. Evol. Comput..

[21]  Thomas Stützle,et al.  Guest editorial: special section on ant colony optimization , 2002, IEEE Trans. Evol. Comput..

[22]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[23]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[24]  Thomas Stützle,et al.  Special Section on Ant Colony Optimization , 2002 .

[25]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[26]  J. Grabowski,et al.  New block properties for the permutation flow shop problem with application in tabu search , 2001, J. Oper. Res. Soc..

[27]  Ling Wang,et al.  An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..

[28]  A. E. Eiben,et al.  A unifying approach to heuristic search , 1995, Ann. Oper. Res..

[29]  Thomas Bäck,et al.  Evolutionary Algorithms in Theory and Practice , 1996 .

[30]  Gunar E. Liepins,et al.  Characterizing crossover in genetic algorithms , 1992, Annals of Mathematics and Artificial Intelligence.

[31]  Kenneth de Jong,et al.  Evolutionary computation: a unified approach , 2007, GECCO.

[32]  Olle Häggström.  Finite Markov Chains and Algorithmic Applications , 2002 .

[33]  Carlos A. Coello Coello,et al.  Evolutionary multi-objective optimization: a historical view of the field , 2006, IEEE Comput. Intell. Mag..

[34]  Günter Rudolph,et al.  Local convergence rates of simple evolutionary algorithms with Cauchy mutations , 1997, IEEE Trans. Evol. Comput..

[35]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[36]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.

[37]  Marc Gravel,et al.  Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic , 2002, Eur. J. Oper. Res..

[38]  Ying Liu,et al.  An effective hybrid particle swarm optimization for batch scheduling of polypropylene processes , 2010, Comput. Chem. Eng..

[39]  Michel Gendreau,et al.  Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design , 2004, Ann. Oper. Res..

[40]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[41]  E. Eberbach.  Toward a theory of evolutionary computation. , 2005, Bio Systems.

[42]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

[43]  Ling Wang,et al.  An Effective PSO-Based Hybrid Algorithm for Multiobjective Permutation Flow Shop Scheduling , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[44]  Bo Liu,et al.  Improved particle swarm optimization combined with chaos , 2005 .

[45]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[46]  Alain Hertz,et al.  A framework for the description of evolutionary algorithms , 2000, Eur. J. Oper. Res..

[47]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[48]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[49]  Nicolas Monmarché,et al.  PII: S0377-2217(02)00265-5 , 2002 .

[50]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[51]  Hans-Paul Schwefel,et al.  Evolution strategies – A comprehensive introduction , 2002, Natural Computing.

[52]  Q. H. Wu,et al.  Convergence analysis of adaptive genetic algorithms , 1997 .

[53]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[54]  Rafael Martí,et al.  Scatter Search - Wellsprings and Challenges , 2006, Eur. J. Oper. Res..

[55]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[56]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[57]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[58]  Czeslaw Smutnicki,et al.  Job-Shop Scheduling by GA. A New Crossover Operator , 2005, OR.

[59]  Peter J. Fleming,et al.  An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.

[60]  A. E. Eiben,et al.  Global Convergence of Genetic Algorithms: A Markov Chain Analysis , 1990, PPSN.

[61]  Günter Rudolph,et al.  Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon , 1998, Fundam. Informaticae.

[62]  Fred Glover,et al.  Scatter Search and Path Relinking: Advances and Applications , 2003, Handbook of Metaheuristics.

[63]  Jim E. Smith.  Self adaptation in evolutionary algorithms , 1998 .

[64]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[65]  Joe Suzuki,et al.  A Further Result on the Markov Chain Model of Genetic Algorithms and Its Application to a Simulated Annealing-like Strategy , 1998, FOGA.

[66]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[67]  David B. Fogel,et al.  Evolving artificial intelligence , 1992 .

[68]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[69]  William E. Hart,et al.  Recent Advances in Memetic Algorithms , 2008 .

[70]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[71]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[72]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[73]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[74]  Eugeniusz Nowicki,et al.  Some aspects of scatter search in the flow-shop problem , 2006, Eur. J. Oper. Res..

[75]  Natalio Krasnogor,et al.  Studies on the theory and design space of memetic algorithms , 2002 .

[76]  Lishan Kang,et al.  On the Convergence Rates of Genetic Algorithms , 1999, Theor. Comput. Sci..

[77]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[78]  Peter Ross,et al.  Evolutionary Scheduling: A Review , 2005, Genetic Programming and Evolvable Machines.

[79]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[80]  Thomas E. Davis.  Toward an Extrapolation of the Simulated Annealing Convergence Theory Onto the Simple Genetic Algorithm , 2018 .

[81]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[82]  Jing Liu,et al.  A multiagent evolutionary algorithm for constraint satisfaction problems , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[83]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[84]  Rafael Martí,et al.  Intensification and diversification with elite tabu search solutions for the linear ordering problem , 1999, Comput. Oper. Res..

[85]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[86]  Carlos A. Coello Coello,et al.  THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .

[87]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[88]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[89]  Fred W. Glover,et al.  A unified modeling and solution framework for combinatorial optimization problems , 2004, OR Spectr..

[90]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[91]  Fred W. Glover,et al.  Principles of scatter search , 2006, Eur. J. Oper. Res..

[92]  Piero P. Bonissone,et al.  Evolutionary algorithms + domain knowledge = real-world evolutionary computation , 2006, IEEE Transactions on Evolutionary Computation.