Dara Curran
ABSTRACT
In evolutionary computation, incremental evolution refers to the process of employing an evolutionary environment that becomes increasingly complex over time. We present an implementation of this approach to develop randomised local search heuristics for constraint satisfaction problems, combining research on incremental evolution with local search heuristics evolution. A population of local search heuristics is evolved using a genetic programming framework on a simple problem for a short period and is then allowed to evolve on a more complex problem. Experiments compare the performance of this population with that of a randomly initialised population evolving directly on the more complex problem. The results obtained show that incremental evolution can represent a significant improvement in terms of optimisation speed, solution quality and solution structure.
- M. B. Bader-El-Den and R. Poli. A GP-based hyper-heuristic framework for evolving 3-SAT heuristics. In Proc. of GECCO, p. 1749--1749. 2007. Google Scholar
Digital Library
- M. B. Bader-El-Din and R. Poli. Generating SAT local-search heuristics using a GP hyper-heuristic framework. In Proc. of the 8th Int'l Conf. on Artificial Evol., p. 141--152, 2007. Google ScholarDigital Library
- S. Bain, J. Thornton, and A. Sattar. Evolving algorithms for constraint satisfaction. In Proc. of CEC, p. 265--272, 2004.Google ScholarCross Ref
- J. Boyan and A. W. Moore. Learning evaluation functions to improve optimization by local search. J. of Machine Learning Research, 1:77--112, 2001. Google ScholarDigital Library
- J. C. Culberson and F. Luo. Exploring the k-colorable landscape with iterated greedy. In Dimacs Series in Discrete Math. and Theoretical Computer Science, p. 245--284. 1995.Google Scholar
- A. S. Fukunaga. Automated discovery of local search heuristics for satisfiability testing. Evol. Comp., 16(1):31--61, 2008. Google ScholarDigital Library
- F. Gomez and R. Mikkulainen. Incremental evolution of complex general behavior. Adaptive Behavivor, 5(3-4):317--342, 1997. Google ScholarDigital Library
- I. Harvey, P. Husbands, and D. Cliff. Seeing the light: artificial evolution, real vision. In Proc. of SAB, p. 392--401. 1994. Google ScholarDigital Library
- S. Luke. ECJ: A Java-based evol. comp. and GP system, 2004. http://www.cs.umd.edu/projects/plus/ec/ecj/.Google Scholar
- F. Rossi, P. van Beek, and T. Walsh, editors. Handbook of Constraint Programming. 2006. Google ScholarDigital Library
- J. F. Winkeler and B. S. Manjunath. Incremental evolution in genetic programming. In Proc. of the 3rd Annual Conf. on Genetic Programming, p. 403--411. 1998.Google Scholar
Index Terms
- Incremental evolution of local search heuristics
Recommendations
Grammatical Evolution of Local Search Heuristics
Genetic programming approaches have been employed in the literature to automatically design constructive heuristics for cutting and packing problems. These heuristics obtain results superior to human-created constructive heuristics, but they do not ...
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
In this paper, a greedy heuristic and two local search algorithms, 1-opt local search and k-opt local search, are proposed for the unconstrained binary quadratic programming problem (BQP). These heuristics are well suited for the incorporation into meta-...
Hybridising heuristics within an estimation distribution algorithm for examination timetabling
This paper presents a hybrid hyper-heuristic approach based on estimation distribution algorithms. The main motivation is to raise the level of generality for search methodologies. The objective of the hyper-heuristic is to produce solutions of ...
Comments