Advertisement

From quasi-solutions to solution: An Evolutionary algorithm to solve CSP

  • María Cristina Riff Rojas
Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1118)

Abstract

This paper describes an Evolutionary Algorithm that repairs to solve Constraint Satisfaction Problems. Knowledge about properties of the constraints network can permit to define a fitness function which is used to improve the stochastic search. A selection mechanism which exploits this fitness function has been defined. The algorithm has been tested by running experiments on randomly generated 3-colouring graphs, with different constraints networks. We have also designed a specialized operator “permutation”, which permits to improve the performance of the classic crossover operator, reducing the generations number and a faster convergence to a global optimum, when the population is staying in a local optimum. The results suggest that the technique may be successfully applied to other CSP.

Keywords

Constraint satisfaction Evolutionary algorithms Fitness evaluation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bowen James, Gerry Dozier, Solving Constraint Satisfaction Problems Using A Genetic/Systematic Search Hybrid That Realizes When to Quit Proceedings of the Sixth International Conference on Genetic Algorithms pp. 122–129, 1995.Google Scholar
  2. [2]
    Cheeseman Peter, Bob Kanefsky, William Taylor, Where the Really Hard Problems Are Proc. of IJCAI-91, pp. 163–169, 1991Google Scholar
  3. [3]
    Dechter Rina, Enhancement schemes for constraint processing: backjumping, leaarning, and cutset decomposition. Artificial Intelligence 41, pp. 273–312, 1990.Google Scholar
  4. [4]
    Dozier Gerry, James Bowen, Dennis Bahler, Solving Small and Large Scale Constraint Satisfaction Problems Using a Heuristic-Based Microgenetic Algorithm Proc. of the First IEEE Conf on Evolutionary Computation, Orlando, pp 306–311, 1994.Google Scholar
  5. [5]
    Eiben A.E., P-E Raué, Zs. Ruttkay, Solving Constraint Satisfaction Problems Using Genetic Algorithms Proc. of the First IEEE Conf on Evolutionary Computation, Orlando, pp 542–547, 1994.Google Scholar
  6. [6]
    Eiben Ágoston, Paul-Erik Raué, Zsófia Ruttkay, GA-easy and GA-hard Constraint Satisfaction Problems Constraint Processing, Ed. Manfred Meyer, pp. 267–283, 1995.Google Scholar
  7. [7]
    Freuder Eugene. C, A sufficient condition of backtrack-free search J. ACM. 29, pp. 24–32, 1982.Google Scholar
  8. [8]
    Goldberg D.E., Genetic Algorithms in Search, Optimization and Machine Learning Ed. Addison-Wesley, 1989.Google Scholar
  9. [9]
    Michalewicz Zbigniew, Cezary Janikow, Handling Constraints in Genetic Algorithms Proc. of 4th Conference on GA, Morgan Kaufmann Publishers Los Altos, CA, pp 151–157, 1991.Google Scholar
  10. [10]
    Michalewicz Zbigniew, Genetic Algorithms + Data Structures=Evolution Programs Ed. Springer-Verlag, Artifial Intelligence Series, 1994.Google Scholar
  11. [11]
    Montanari U., Networks of constraints: Fundamental properties and applications to picture processing. Inf. Sci. 7, pp. 95–132, 1974.Google Scholar
  12. [12]
    Paredis Jan, Co-evolutionary Constraint Satisfaction Proceedings PPSN III, Int. Conference on Evolutionary Computation Israel, pp. 46–55, Oct. 1994.Google Scholar
  13. [13]
    Riff María-Cristina, Improving fitness function for CSP in an Evolutionary Algorithm. Rapport de Recherche CERMICS, Dec. 1995.Google Scholar
  14. [14]
    Thorton A.C., Genetic Algorithms versus Simulated Annealing: Satisfaction of Large Sets of Algebraic Mechanical Design Constraints Artifial Intelligence in Design, pp 381–398, 1994.Google Scholar
  15. [15]
    Tsang Edward, Applying Genetic Algorithms to Constraint Satisfaction Optimization Problems Proc. of ECAI-90, Pitman Publishing, pp 649–654, 1990Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • María Cristina Riff Rojas
    • 1
  1. 1.INRIA, CERMICSSophia-AntipolisFrance

Personalised recommendations