Abstract
We are interested on defining a general evolutionary algorithm that repairs to solve Constraint Satisfaction Problems and which takes into account both advantages of the systematic and traditional methods and of a characteristics of the CSP. We use the knowledge about properties of the constraint network to define a fitness function, and three operators arc-mutation, arc-crossover and constraint dynamic adaptive crossover. The number of constraint checks has also taken into consideration for designing the operators. The algorithm has been tested by running experiments on randomly generated 3-coloring graphs. The results suggest that the technique may be successfully applied to solve CSP.
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
Affane M.S. and Bennaceur H. A labelling arc consistency method for functional constraints. In Eugene Preuder, editor, Proceedings of Constraint Processing CP96, pages 16–30, 1996.
Bowen J. and Dozier G. Solving constraint satisfaction problems using a genetic/systematic search hybrid that realizes when to quit. In Proceedings of the Sixth International Conference on Genetic Algorithms, pages 122–129, 1995.
Bowen J., Dozier G. and Bahler D. Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm. In Proceedings of the First IEEE Conf on Evolutionary Computation, pages 306–311, 1994.
Dechter R. Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. In Artificial Intelligence, pages 273–312, 1990.
Preuder E. A sufficient condition of backtrack-free search. In Journal of the ACM, pages 24–32, 1982.
Preuder E. The many paths to satisfaction. In M. Meyer, editor, Constraint Processing, pages 103–119, 1995.
Haralick R.M. and Elliott G.L. Increasing tree search efficiency for constraint satisfaction problems. In Artificial Intelligence, pages 263–313, 1980.
Kanefsky B., Cheeseman P. and Taylor W. Where the really hard problems are. In Proceedings of IJCAI-91, pages 163–169, 1991.
Kumar V. Algorithms for constraint satisfaction problems:a survey. In AI Magazine, pages 32–44, 1992.
Michalewicz Z. Genetic Algorithms × Data Structures = Evolution Programs. Springer-Verlag, 1994.
Minton S. Automatically configuring constraint satisfaction programs: A case study. In Constraints, 1(1), pages 7–43, 1996.
Petrie C., Rossi F. and Dhar V. On the equivalence of constraint satisfaction problem. Act-ai-222-89, MCC Corporation, Austin, Texas, 1989.
Philips A., Minton S., Johnston M. and Laird P. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. In Artificial Intelligence, pages 161–205, 1992.
Raué P-E., Eiben A.E. and Ruttkay Zs. Solving constraint satisfaction problems using genetic algorithms. In Proceedings of the First IEEE Conf on Evolutionary Computation, pages 542–547, 1994.
Raué P-E., Eiben A.E. and Ruttkay Zs. Ga-easy and ga-hard constraint satisfaction problems. In M. Meyer, editor, Constraint Processing, pages 267–283, 1995.
Raué P-E., Eiben A.E. and Ruttkay Zs. Self-adaptivity for constraint satisfaction: Learning penalty functions. In B. Porto, editor, Proceedings of the Third IEEE Conf on Evolutionary Computation, pages 258–261, 1996.
Riff M.-C. From quasi-solutions to solution: An evolutionary algorithm to solve csp. In E. Freuder, editor, Proceedings of Constraint Processing CP96, pages 367–381, 1996.
Riff M.-C. Using the knowledge of the constraints network to design an evolutionary algorithm that solves csp. In B. Porto, editor, Proceedings of the Third IEEE Conf on Evolutionary Computation, pages 279–284, 1996.
Riff M.-C. Evolutionary search guided by the constraint network to solve csp. In Proceedings of the Fourth IEEE Conf on Evolutionary Computation, pages 337–342, 1997.
Tsang E. Applying genetic algorithms to constraint satisfaction optimization problems. In Proceedings of ECAI-90, pages 649–654, 1990.
Warwick T. and Tsang E. Using a genetic algorithm to tackle the processors configuration problem. In Proceedings of ACM Symposium on Applied Computing (SAC), pages 217–221, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Riff, MC. (1999). A Network-Based Adaptive Evolutionary Algorithm for Constraint Satisfaction Problems. In: Voß, S., Martello, S., Osman, I.H., Roucairol, C. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5775-3_19
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5775-3_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7646-0
Online ISBN: 978-1-4615-5775-3
eBook Packages: Springer Book Archive