Solving randomly generated constraint satisfaction problems using a micro-evolutionary hybrid that evolves a population of hill-climbers
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 614-619
- https://doi.org/10.1109/icec.1995.487454
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Solving constraint satisfaction problems using genetic algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Comparison of Evolutionary Programming and Genetic Algorithms on Selected Constrained Optimization ProblemsSIMULATION, 1995
- Fast practical evolutionary timetablingPublished by Springer Nature ,1994
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- Solving the n-queens problem using genetic algorithmsPublished by Association for Computing Machinery (ACM) ,1992
- The N-queens problem and genetic algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992