A genetic local search algorithm for random binary constraint satisfaction problems
作者： Elena Marchiori , Adri Steenbeek
关键词:
摘要: This paper introduces a genetic local search algorithm for bi nary constraint satisfaction problems. The core of the algo rithm consists an ad-hoc optimization procedure followed by application blind operators. A standard set benchmark instances is used in order to assess performance algorithm. results indicate that this apparently naive hybridation with lo cal yields rather powerful heuristic random binary
ru.nl
core.ac.uk
acm.org
narcis.nl参考文章(22)
Paul Morris, The breakout method for escaping from local minima national conference on artificial intelligence. pp. 40- 45 ,(1993)
P. Moscato, On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms Caltech Concurrent Computation Program. ,(1989)
Barbara M. Smith, The phase transition and the mushy region in constraint satisfaction problems european conference on artificial intelligence. pp. 100- 104 ,(1994)
James Bowen, Gerry Dozier, Solving Constraint Satisfaction Problems Using a Genetic/Systematic Search Hybrid That Realizes When to Quit international conference on genetic algorithms. pp. 122- 129 ,(1995)
José J. Ruz Alvaro Ruiz-Andino, None, Integration of Constraint Programming and Evolution Programs: Application to Channel Routing industrial and engineering applications of artificial intelligence and expert systems. pp. 448- 459 ,(1998) , 10.1007/3-540-64582-9_775
Zbigniew Michalewicz, Genetic AlgorithmsNumerical Optimizationand Constraints international conference on genetic algorithms. pp. 151- 158 ,(1995)
A. E. Eiben, J. I. van Hemert, E. Marchiori, A. G. Steenbeek, Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function Lecture Notes in Computer Science. pp. 201- 210 ,(1998) , 10.1007/BFB0056863
A.E. Eiben, Z. Ruttkay, Self-adaptivity for constraint satisfaction: learning penalty functions ieee international conference on evolutionary computation. pp. 258- 261 ,(1996) , 10.1109/ICEC.1996.542371
Evolutionary search guided by the constraint network to solve CSP ieee international conference on evolutionary computation. pp. 337- 342 ,(1997) , 10.1109/ICEC.1997.592332
B.G.W. Craenen, A.E. Eiben, E. Marchiori, Solving constraint satisfaction problems with heuristic-based evolutionary algorithms congress on evolutionary computation. ,vol. 2, pp. 1571- 1577 ,(2000) , 10.1109/CEC.2000.870843