Abstract
We compare two heuristic approaches, evolutionary computation and ant colony optimisation, and a complete tree-search approach, constraint programming, for solving binary constraint satisfaction problems. We experimentally show that, if evolutionary computation is far from being able to compete with the two other approaches, ant colony optimisation nearly always succeeds in finding a solution, so that it can actually compete with constraint programming. The resampling ratio is used to provide insight into heuristic algorithms performances. Regarding efficiency, we show that if constraint programming is the fastest when instances have a low number of variables, ant colony optimisation becomes faster when increasing the number of variables.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
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., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol. 2279, pp. 81–90. Springer, Heidelberg (2002)
Craenen, B., Eiben, A., van Hemert, J.: Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 7, 424–444 (2003)
van Hemert, J., Bäck, T.: Measuring the searched space to guide efficiency: The principle and evidence on constraint satisfaction. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 23–32. Springer, Heidelberg (2002)
Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., Stamatiou, Y.: Random constraint satisfaction: A more accurate picture. Constraints 4, 329–344 (2001)
Cheeseman, P., Kenefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the IJCAI 1991, pp. 331–337 (1991)
Gent, I., MacIntyre, E., Prosser, P., Walsh, T.: The constrainedness of search. In: Proceedings of AAAI 1996, AAAI Press, Menlo Park (1996)
Davenport, A.: A comparison of complete and incomplete algorithms in the easy and hard regions. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 43–51. Springer, Heidelberg (1995)
Clark, D., Frank, J., Gent, I., MacIntyre, E., Tomv, N., Walsh, T.: Local search and the number of solutions. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 119–133. Springer, Heidelberg (1996)
Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for discrete optimization. Artificial Life 5, 137–172 (1999)
Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 6, 347–357 (2002)
Stützle, T., Hoos, H.: MAX − MIN Ant System. Journal of Future Generation Computer Systems 16, 889–914 (2000)
Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satistaction and scheduling problems. Artificial Intelligence 58, 161–205 (1992)
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
Foundation, F.S.: The gnu general public license (Version 2, June 1991) http://www.gnu.org/licenses/gpl.txt
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, pp. 330–337. Morgan Kaufmann, San Francisco (1997)
Golomb, S., Baumert, L.: Backtrack programming. ACM 12, 516–524 (1965)
Haralick, R., Elliot, G.: Increasing tree search efficiency for constraint-satisfaction problems. Artificial Intelligence 14, 263–313 (1980)
Dechter, R.: Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence 41, 273–312 (1990)
Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9, 268–299 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Hemert, J.I., Solnon, C. (2004). A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-24652-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21367-3
Online ISBN: 978-3-540-24652-7
eBook Packages: Springer Book Archive