Local Search Based on Genetic Algorithms

Genetic Algorithms have been seen as search procedures that can quickly locate high performance regions of vast and complex search spaces, but they are not well suited for fine-tuning solutions, which are very close to optimal ones. However, genetic algorithms may be specifically designed to provide an effective local search as well. In fact, several genetic algorithm models have recently been presented with this aim. In this chapter, we call these algorithms Local Genetic Algorithms.

[1]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[2]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[3]  A. K. Mittal,et al.  Unconstrained quadratic bivalent programming problem , 1984 .

[4]  David W. Corne,et al.  A Real Coded Genetic Algorithm with an Explorer and an Exploiter Populations , 1997, ICGA.

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

[6]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[7]  Jing Liu,et al.  A multiagent genetic algorithm for global numerical optimization , 2004, IEEE Trans. Syst. Man Cybern. Part B.

[8]  Peter Merz,et al.  NK -Fitness Landscapes and Memetic Algorithms with Greedy Operators and k -opt Local Search , 2005 .

[9]  P. Merz,et al.  Memetic algorithms for the unconstrained binary quadratic programming problem. , 2004, Bio Systems.

[10]  Panos M. Pardalos,et al.  Randomized heuristics for the Max-Cut problem , 2002, Optim. Methods Softw..

[11]  Carlos García-Martínez,et al.  A Local Genetic Algorithm for Binary-Coded Problems , 2006, PPSN.

[12]  Kengo Katayama,et al.  Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm , 2000, GECCO.

[13]  Surya B. Yadav,et al.  The Development and Evaluation of an Improved Genetic Algorithm Based on Migration and Artificial Selection , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[14]  Franz Rendl,et al.  A Spectral Bundle Method for Semidefinite Programming , 1999, SIAM J. Optim..

[15]  Dirk Thierens,et al.  Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover , 2004, GECCO.

[16]  Kenneth A. De Jong,et al.  Using Problem Generators to Explore the Effects of Epistasis , 1997, ICGA.

[17]  Francisco Herrera,et al.  Gradual distributed real-coded genetic algorithms , 2000, IEEE Trans. Evol. Comput..

[18]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[19]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[20]  Ioannis B. Theocharis,et al.  A GA-based fuzzy modeling approach for generating TSK models , 2002, Fuzzy Sets Syst..

[21]  Martin Dietzfelbinger,et al.  The analysis of a recombinative hill-climber on H-IFF , 2003, IEEE Trans. Evol. Comput..

[22]  C. Fernandes,et al.  A study on non-random mating and varying population size in genetic algorithms using a royal road function , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[23]  Francisco Herrera,et al.  A taxonomy for the crossover operator for real‐coded genetic algorithms: An experimental study , 2003, Int. J. Intell. Syst..

[24]  Georges R. Harik,et al.  Finding Multimodal Solutions Using Restricted Tournament Selection , 1995, ICGA.

[25]  Thomas Stützle,et al.  Iterated Robust Tabu Search for MAX-SAT , 2003, Canadian Conference on AI.

[26]  Hitoshi Iba,et al.  Enhancing differential evolution performance with local search for high dimensional function optimization , 2005, GECCO '05.

[27]  Francisco Herrera,et al.  Real-Coded Memetic Algorithms with Crossover Hill-Climbing , 2004, Evolutionary Computation.

[28]  Ioannis B. Theocharis,et al.  Microgenetic algorithms as generalized hill-climbing operators for GA optimization , 2001, IEEE Trans. Evol. Comput..

[29]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[30]  John E. Beasley,et al.  Heuristic algorithms for the unconstrained binary quadratic programming problem , 1998 .

[31]  Pablo Moscato,et al.  Memetic algorithms: a short introduction , 1999 .

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

[33]  Derek B. Ingham,et al.  An Informed Operator Based Genetic Algorithm for Tuning the Reaction Rate Parameters of Chemical Kinetics Mechanisms , 2004, GECCO.

[34]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .

[35]  Francisco Herrera,et al.  Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis , 1998, Artificial Intelligence Review.

[36]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[37]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[38]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[39]  Carlos García-Martínez,et al.  Global and local real-coded genetic algorithms based on parent-centric crossover operators , 2008, Eur. J. Oper. Res..

[40]  David Naso,et al.  Multi-objective evolutionary algorithms for a class of sequencing problems in manufacturing environments , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[41]  Reiko Tanese,et al.  Parallel Genetic Algorithms for a Hypercube , 1987, ICGA.

[42]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[43]  Franz Rendl,et al.  Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition , 2006, Math. Program..