Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover

Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms (EAs) ILS focuses only on a single solution during its search. EAs have shown however that there can be a substantial gain in search quality when exploiting the information present in a population of solutions. In this paper we propose the use of a population for ILS. We define the general form of the resulting meta-heuristic, called population-based iterated local search (PILS). PILS is a minimal extension of ILS that uses previously generated solutions in the neighborhood of the current solution to restrict the neighborhood search by ILS. This neighborhood restriction is analogous to the way crossover preserves common substructures between parents when generating offspring. To keep the discussion concrete, we discuss a specific instantiation of the PILS algorithm on a binary trap function.

[1]  D. Ackley A connectionist machine for genetic hillclimbing , 1987 .

[2]  Thomas Stützle,et al.  A beginner's introduction to iterated local search , 2001 .

[3]  Lashon B. Booker,et al.  Proceedings of the fourth international conference on Genetic algorithms , 1991 .

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

[5]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[6]  Heinz Mühlenbein,et al.  How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.

[7]  Colin R. Reeves,et al.  Genetic Algorithms and Neighbourhood Search , 1994, Evolutionary Computing, AISB Workshop.

[8]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[9]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

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

[11]  Irina Rish,et al.  Summarizing CSP Hardness with Continuous Probability Distributions , 1997, AAAI/IAAI.

[12]  Thomas Stützle,et al.  Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT , 1999, Artif. Intell..

[13]  Marco Dorigo,et al.  New Ideas in Optimisation , 1999 .

[14]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[15]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[16]  Bernd Freisleben,et al.  Fitness landscapes and memetic algorithm design , 1999 .

[17]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[18]  Henrikke Baumann,et al.  A Beginner's introduction to LCA , 1994 .