A genetic local search algorithm for random binary constraint satisfaction problems

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2000, Pages 458-462

  Marchiori, Elena ^a   Steenbeek, Adri ^b  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Algorithms; Experimentation

Indexed keywords

BINARY CONSTRAINT SATISFACTION; EXPERIMENTATION; GENETIC LOCAL SEARCH ALGORITHM; GENETIC OPERATORS; LOCAL SEARCH; OPTIMIZATION PROCEDURES;

ALGORITHMS; BENCHMARKING; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 33751381392     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335603.335910     Document Type: Conference Paper

References (23)

1. N. Barnier and P. Brisset. Optimization by hybridation of a genetic algorithm with constraint satisfaction techniques. In International Conference on Evolutionary Computation, pages 645-649. IEEE, 1998.
2. J. Bowen and G. Dozier. Solving constraint satisfaction problems using a genetic/systematic search hybrid that realizes when to quit. In Eshelman L. J., editor, Proceedings of the 6th International Conference on Genetic Algorithms (ICGA 95), pages 122-129. Morgan Kaufmann, 1995.
3. B. Craenen, A. Eiben, and E. Marchiori. Solving constraint satisfaction problems with heuristic-based evolutionary algorithms. In Eleventh Belgium-Netherlands Conference on Artificial Intelligence, 1999.
4. G. Dozier, J. Bowen, and D. Bahler. Solving small and large constraint satisfaction problems using a heuristic-based microgenetic algorithms. In Proceedings of the 1st IEEE Conference on Evolutionary Computation, pages 306-311. IEEE Press, 1994
5. G. Dozier, J. Bowen, and A. Homaifar. Solving constraint satisfaction problems using hybrid evolutionary search. IEEE Transactions on Evolutionary Computation, 2(1):23-33, 1998. (Pubitemid 128748401)
6. A.E. Eiben, P.-E. Raué, and Zs. Ruttkay Constrained problems. In L. Chambers, editor, Practical Handbook of Genetic Algorithms, pages 307-365. CRC Press, 1995.
7. A.B. Eiben and Zs. Ruttkay. Self-adaptivity for constraint satisfaction: Learning penalty functions. In Proceedings of the 3rd IEEE Conference on Evolutionary Computation, pages 258-261. IEEE Press, 1996.
8. A.E. Eiben, J.I. van Hemert, E. Marchiori, and A. Steenbeek. Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function. In A.E. Eiben, T. Bäck, M. Schoenauer, and H. Schwefel, editors, Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature (PPSN V), LNCS 1498, pages 196-205. Springer, 1998.
9. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wiley, New York, 1989.
10. K.A. De Jong. An analysis of the behaviour of a class of genetic adaptive systems. Doctoral Dissertation, University of Michigan, Dissertation Abstract International 36(10), 5140B, 1975.
11. A. Kolen and E. Pesch. Genetic local search in combinatorial optimization. Discrete Applied Mathematics, 48:273-284, 1994.
12. E. Marchiori. A simple heuristic based genetic algorithm for the maximum clique problem. In ACM Symposium on Applied Computing, pages 366-373. ACM Press, 1998.
13. P. Merz and B. Freisleben. Genetic local search for the tsp: New results. In IEEE International Conference on Evolutionary Computation, pages 159-164. IEEE Press, 1997.
14. Z. Michalewicz. Genetic algorithms, numerical optimization and constraints. In L.J. Eshelman, editor, Proceedings of the 6th International Conference on Genetic Algorithms (ICGA 95), pages 98-108. Morgan Kaufmann, 1995.
15. P. Morris. The breakout method for escaping from local minima. In Proceedings of the 11th National Conference on Artificial Intelligence, AAAI-93, pages 40-45. AAAI Press/The MIT Press, 1993.
16. P. Moscato. On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical report, Caltech Concurrent Computation Program, Californian Institute of Technology, U.S.A., TR No790 1989.
17. H. Mühlenbein, M. Gorges-Schleuter, and O. Krämer. Evolution algorithms in combinatorial optimization. Parallel Computing, 7:65-85, 1988.
18. P. Prosser. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81:81-109, 1996. (Pubitemid 126349550)
19. M.C. Riff-Rojas. Evolutionary search guided by the constraint network to solve CSP. In Proceedings of the 4th IEEE Conference on Evolutionary Computation, pages 337-348. IEEE Press, 1997.
20. M.C. Riff Rojas. Using the knowledge of the constraints network to design an evolutionary algorithm that solves CSP. In Proceedings of the 3rd IEEE Conference on Evolutionary Computation, pages 279-284. IEEE Press, 1996.
21. A. Ruiz-Andino and J. Ruz. Integration of constraint programming and evolution programs: Application to channel routing. pages 448-459. Springer, 1998. LNAI 1415.
22. B.M. Smith. Phase transition and the mushy region in constraint satisfaction problems. In A.G. Cohn, editor, Proceedings of the 11th European Conference on Artificial Intelligence, pages 100-104. John Wiley & Sons Ltd., Aug. 1994.
23. C.P. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73-117, 1994.