Abstract
Constraint Satisfaction Problems form a class of problems that are generally computationally dificult and have been addressed with many complete and heuristic algorithms. We present two complete algorithms, as well as two evolutionary algorithms, and compare them on randomly generated instances of binary constraint satisfaction problems. We find that the evolutionary algorithms are less effective than the classical techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C.P. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73–117, 1994.
E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
F. Bacchus and P. van Beek. On the conversion between non-binary and binary constraint satisfaction problems. In Proceedings of the 15th International Conference on Artificial Intelligence. Morgan Kaufmann, 1998.
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. Wiley, 1994.
S.W. Golomb and L.D. Baumert. Backtrack programming. A.C.M., 12(4):516–524, October 1965.
R. Haralick and G. Elliot. Increasing tree search efficiency for constraintsatisfaction problems. Artificial Intelligence, 14(3rd):263–313, 1980.
P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268–299, August 1993.
J. Bowen and G. Dozier. Solving constraint satisfaction problems using a genetic/ systematic search hybride that realizes when to quit. In L.J. Eshelman, editor, Proceedings of the 6th International Conference on Genetic Algorithms, pages 122–129. Morgan Kaufmann, 1995.
G. Dozier, J. Bowen, and D. Bahler. Solving randomly generated constraint satisfaction problems using a micro-evolutionary hybrid that evolves a population of hill-climbers. In Proceedings of the 2nd ieee Conference on Evolutionary Computation, pages 614–619. ieee Press, 1995.
A.E. Eiben, J.K. van der Hauw, and J.I. van Hemert. Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics, 4(1):25–46, 1998.
A.E. Eiben, J.I. van Hemert, E. Marchiori, and A.G. Steenbeek. Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function. In Proceedings of the 5th Conference on Parallel Problem Solving from Nature, number 1498 in LNCS, pages 196–205, Berlin, 1998. Springer.
J.I. van Hemert. Randomcsp, a library for generating and handling binary constraint satisfaction problems, Version 1.5, 2001. http://www.liacs.nl/~jvhemert/randomcsp.
E. M. Palmer. Graphical Evolution. John-Wiley & Sons, New York, 1985.
D.S. Moore and G.P. McCabe. Introduction to the Practice of Statistics. W.H. Freeman and Company, New York, 3rd edition, 1998.
R.J. Barlow. Statistics: a guide to the use of statistical methods in the physical sciences. John Wiley & Sons, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Hemert, J.I. (2002). 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) Applications of Evolutionary Computing. EvoWorkshops 2002. Lecture Notes in Computer Science, vol 2279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46004-7_9
Download citation
DOI: https://doi.org/10.1007/3-540-46004-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43432-0
Online ISBN: 978-3-540-46004-6
eBook Packages: Springer Book Archive