A Local Genetic Algorithm for Binary-Coded Problems

Local Genetic Algorithms are search procedures designed in order to provide an effective local search. Several Genetic Algorithm models have recently been presented with this aim. In this paper we present a new Binary-coded Local Genetic Algorithm based on a Steady-State Genetic Algorithm with a crowding replacement method. We have compared a Multi-Start Local Search based on the Binary-Coded Local Genetic Algorithm with other instances of this metaheuristic based on Local Search Procedures presented in the literature. The results show that, for a wide range of problems, our proposal consistently outperforms the other local search approaches.

[1]  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).

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

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

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

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

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

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

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

[9]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

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

[11]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

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

[13]  K. Katayama,et al.  A Variant k-opt Local Search Heuristic for Binary Quadratic Programming , 2001 .

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

[15]  Riccardo Poli,et al.  Genetic and Evolutionary Computation – GECCO 2004 , 2004, Lecture Notes in Computer Science.

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

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

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

[19]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[20]  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..

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

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

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

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

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