Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function

@inproceedings{Eiben1998SolvingBC,
  title={Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function},
  author={A. E. Eiben and Jano I. van Hemert and Elena Marchiori and Adri G. Steenbeek},
  booktitle={PPSN},
  year={1998}
}
1 I n t r o d u c t i o n Evolutionary algorithms are usually considered to be ill-suited for solving constraint satisfaction problems. Namely, the traditional search operators (mutation and recombination) are 'blind' to the constraints, that is, parents satisfying a certain constraint may very well result in an offspring that violates it. Furthermore, while EAs have a 'basic instinct' to optimize, there is no objective function in a CSP just a set of constraints to be satisfied. Despite such… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 20 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Phase transition and the mushy region in constraint satisfaction problems

  • B. M. Smith
  • Proceedings of the 11th European Conference on…
  • 1994
Highly Influential
4 Excerpts

Z . Michalewicz and M . Michalewicz . Pro - life versus pro - choice strategies in evolutionary computation techniques

  • M. Palaniswami, Y. Attikiouzel, J. MarksR., D. Fogel, T. Fukuda
  • Computational Intelligence : A Dynamic System…
  • 1997

Similar Papers

Loading similar papers…