A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3004, Issue , 2004, Pages 114-123

  Van Hemert, Jano I ^a   Solnon, Christine ^b  

^a CWI   (Netherlands)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; BINARY TREES; BINS; CALCULATIONS; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; OPTIMIZATION;

BINARY CONSTRAINT SATISFACTION; CONSTRAINT PROGRAMMING; HEIDELBERG; HEURISTIC APPROACH; RESAMPLING; TREE SEARCH;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048844751     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24652-7_12     Document Type: Article

References (20)

1. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press (1993)
2. van Hemert, J.: Comparing classical methods for solving binary constraint satisfaction problems with state of the art evolutionary computation. In Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidi, G., cds.: Applications of Evolutionary Computing. Number 2279 in Springer Lecture Notes on Computer Science, Springer-Verlag, Berlin (2002) 81-90
3. Craenen, B., Eiben, A., van Hemert, J.: Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 7 (2003) 424-444
4. van Ilemert, J., Back, T.: Measuring the searched space to guide efficiency: The principle and evidence on constraint satisfaction. In Merelo, J., Panagiotis, A., Beyer, H.G., Fernández-Villacañas, J.L., Schwefel, H.P., eds.: Parallel Problem Solving from Nature -PPSN VII. Number 2439 in Springer Lecture Notes on Computer Science, Springer-Verlag, Berlin (2002) 23-32
5. Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., Stamatiou, Y.: Random constraint satisfaction: A more accurate picture. Constraints 4 (2001) 329-344
6. Cheeseman, P., Kenefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the IJCAI'91. (1991) 331-337
7. Gent, I., Maclntyre, E., Prosser, P., Walsh, T.: The constrainedness of search. In: Proceedings of AAAI-96, AAAI Press, Menlo Park, California. (1996)
8. Davenport, A.: A comparison of complete and incomplete algorithms in the easy and hard regions. In: Proceedings of CP'95 workshop on Studying and Solving Really Hard Problems. (1995) 43-51
9. Clark, D., Frank, J., Gent, I., Maclntyre, E., Tomv, N., Walsh, T.: Local search and the number of solutions. In: Proceedings of CP'96, LNCS 1118, Springer Verlag, Berlin, Germany. (1996) 119-133
10. Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for discrete optimization. Artificial Life 5 (1999) 137-172
11. Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 6 (2002) 347-357
12. Stützte, T., Hoos, H.: MAX - MIN Ant System. Journal of Future Generation Computer Systems 16 (2000) 889-914
13. Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satistaction and scheduling problems. Artificial Intelligence 58 (1992) 161-205
14. Craenen, B.: JaveEa2: an evolutionary algorithm experimentation platform for constraint satisfaction in Java (Version 1.0.1) http://www.xs4all.nl/ ~bcraenen/JavaEa2/download.html.
15. Foundation, F.S.: The GNU general public license (Version 2, June 1991) http://www.gnu.org/licenses/gpl.txt.
16. Marchiori, E.: Combining constraint processing and genetic algorithms for constraint satisfaction problems. In Bäck, T., ed.: Proceedings of the 7th International Conference on Genetic Algorithms, Morgan Kaufmann (1997) 330-337
17. Golomb, S., Baumert, L.: Backtrack programming. ACM 12 (1965) 516-524
18. Haralick, R., Elliot, G.: Increasing tree search efficiency for constraint-satisfaction problems. Artificial Intelligence 14 (1980) 263-313
19. Dechter, R.: Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence 41 (1990) 273-312
20. Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9 (1993) 268-299