Improving the performance of evolutionary algorithms for the satisfiability problem by refining functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1498 LNCS, Issue , 1998, Pages 755-764

  Gottlieb, Jens ^a   Voss, Nico ^a  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; FORMAL LOGIC; REFINING;

ADAPTIVE MECHANISM; BIT-STRINGS; EVOLUTIONARY ALGORITHMS (EAS); FITNESS LANDSCAPE; HEURISTIC INFORMATION; SATISFIABILITY PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84878605937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056917     Document Type: Conference Paper

References (16)

1. J. Arabas, Z. Michalewicz and J. Mulawka, GAVaPS - a Genetic Algorithm with Varying Population Size, In Proceedings of the 1st IEEE International Conference on Evolutionary Computation, 73-78, IEEE Service Center, Piscataway, NJ, 1994
2. T. Back%, A. E. Eiben and M. E. Vink. A Superior Evolutionary Algorithm for 3-SAT. In Proceedings of the 7th Annual Conference on Evolutionary Programming, Lecture Notes in Computer Science, Springer, 1998 (in press)
3. K. A. De Jong and W. M. Spears. Using Genetic Algorithms to Solve NP-Complete Problems. In J. D. Schaffer (ed.), Proceedings of the Third International Conference on Genetic Algorithms, 124-132, Morgan Kaufmann Publishers, San Mateo, CA, 1989
4. M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. Journal of the ACM, Volume 7, 201-215, 1960
5. A. E. Eiben and J. K. van der Hauw. Solving 3-SAT with Adaptive Genetic Algorithms. In Proceedings of the 4th IEEE International Conference on Evolutionary Computation, 81-86, IEEE Service Center, Piscataway, NJ, 1997
6. C. Fleurent and J. A. Ferland. Object-oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique and Satisfiability. In D. S. Johnson and M. A. Trick (eds.), Cliques, Coloring and Satisfiability: 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 26, 619-652, 1996
7. J. Frank. A Study of Genetic Algorithms to Find Approximate Solutions to Hard 3CNF Problems. Golden West International Conference on Artificial Intelligence, 1994
8. J. Frank. Weighting for Godot: Learning Heuristics for GSAT. In Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, 338-343, 1996
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, CA, 1979
10. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997
11. J. Gottlieb and N. Voss. Representations, Fitness Functions and Genetic Operators for the Satisfiability Problem. In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (eds.), Artificial Evolution, Lecture Notes in Computer Science, Volume 1363, 55-68, Springer, 1998
12. J.-K. Hao. A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems. In D. W. Pearson, N. C. Steele, and R. F. Albrecht (eds.), Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, 289-292, Springer, Wien, 1995
13. R. Hinterding, Z. Michalewicz and A. E. Eiben. Adaptation in Evolutionary Computation: a Survey. In Proceedings of the 4th IEEE International Conference on Evolutionary Computation, 65-69, IEEE Service Center, Piscataway, 1997
14. D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In Proceedings of the 10th National Conference on Artificial Intelligence, 459-465, 1992
15. K. Park. A Comparative Study of Genetic Search. In L. J. Eshelman (ed.), Proceedings of the Sixth International Conference on Genetic Algorithms, 512-519, Morgan Kaufmann, San Mateo, CA, 1995
16. B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In Proceedings of the 10th National Conference on Artificial Intelligence, 440-446, 1992