Robust parameter settings for variation operators by measuring the resampling ratio: A study on binary constraint satisfaction problems

Journal of Heuristics

Volumn 10, Issue 6, 2004, Pages 629-640

  Van Hemert, Jano I ^a   Bäck, Thomas ^b,c  

^a National Research Institute for Mathematics and Computer Science   (Netherlands)

^b LEIDEN UNIVERSITY   (Netherlands)

^c NuTech Solutions GmbH   (Germany)

Author keywords

Binary constraint satisfaction; Problem difficulty; Resampling ratio; Searched space; Variation operators

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; DATA REDUCTION; MATHEMATICAL OPERATORS; PARAMETER ESTIMATION; ROBUSTNESS (CONTROL SYSTEMS);

BINARY CONSTRAINT SATISFACTION; PROBLEM DIFFICULTY; RESAMPLING RATIO; SEARCHED SPACE; VARIATION OPERATORS;

PROBLEM SOLVING;

EID: 14844352546     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10732-005-5433-4     Document Type: Article

References (30)

1. Achlioptas, D., L. Kirousis, E. Kranakis, D. Krizanc, M. Molloy, and Y. Stamatiou. (2001). "Random Constraint Satisfaction: A More Accurate Picture." Constraints 4(6), 329-344.
2. Bacchus, F. and P. van Beek. (1998). "On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems." In Proceedings of the 15th International Conference on Artificial Intelligence. Morgan Kaufmann.
3. Back, T., G. Rudolph, and H.-P. Schwefel. (1993). "Evolutionary Programming and Evolution Strategies: Similarities and Differences." In D. Fogel and W. Atmar (eds.), Proceedings of the Second Annual Conference on Evolutionary Programming. San Diego, CA: Evolutionary Programming Society, pp. 11-22.
4. Biethahn, J. and V. Nissen (eds.) (1995). Evolutionary Algorithms in Management Applications. Springer.
5. Clearwater, S. and T. Hogg. (1996). "Problem Structure Heuristics and Scaling Behavior for Genetic Algorithms." Journal of Artificial Intelligence 81, 327-347.
6. Craenen, B., A. Eiben, and J. van Hemert. (2003). "Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems." IEEE Transactions on Evolutionary Computation 7(5), 424-444.
7. Davis, L. (1991). Handbook of Genetic Algorithms. Van Nostrand Reinhold.
8. Dozier, G., J. Bowen, and A. Homaifar. (1998). "Solving Constraint Satisfaction Problems Using Hybrid Evolutionary Search." IEEE Transactions on Evolutionary Computation 2(1), 23-33.
9. Eiben, A., E. Aarts, and K.V. Hee. (1991). "Global Convergence of Genetic Algorithms: An Infinite Markov Chain Analysis." In Proceedings of the First International Conference on Parallel Problem Solving from Nature. Springer, Berlin, pp. 4-12.
10. Eiben, A., J. van der Hauw, and J. van Hemert. (1998). "Graph Coloring with Adaptive Evolutionary Algorithms." Journal of Heuristics 4(1), 25-46.
11. Falkenauer, E. (1998). Genetic Algorithms and Grouping Problems. John Wiley & Son Ltd.
12. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability/A Guide to the Theory of NP-Completeness. New York: W.H. Freeman & Company.
13. Gent, I., E. MacIntyre, P. Prosser, B. Smith, and T. Walsh. (2001). "Random Constraint Satisfaction: Flaws and Structure." Constraints 6(2), 345-372.
14. Gent, I.P., E. MacIntyre, P. Prosser, and T. Walsh. (1996). "The Constrainedness of Search." In Proceedings of the AAAI-96, pp. 246-252.
15. Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.
16. Marchiori, E. and A. Steenbeek. (2000). "A Genetic Local Search Algorithm for Random Binary Constraint Satisfaction Problems." In ACM Symposium on Applied Computing, pp. 458-462.
17. Mitchell, M. (1996). An Introduction to Genetic Algorithms. MIT.
18. Palmer, E.M. (1985). Graphical Evolution. New York: John-Wiley & Sons. An Introduction to the Theory of Random Graphs - An Important Tool in Modeling Networks of Interactions.
19. Prosser, P. (1988). "A Hybrid Genetic Algorithm for Pallet Loading." In Proceedings European Conference on Artificial Intelligence (ECAI-88).
20. Rechenberg, I. (1973). Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Stuttgart: Frommann-Holzboog.
21. Rossi, F., C. Petrie, and V. Dhar. (1990). "On the Equivalence of Constraint Satisfaction Problems." In L.C. Aiello (ed.), ECAI'90: Proceedings of the 9th European Conference on Artificial Intelligence. Stockholm: Pitman, pp. 550-556.
22. Rudolph, G. (1994). "Convergence Analysis of Canonical Genetic Algorithms." IEEE Transactions on Neural Networks 5(1), 96-101.
23. Schoofs, L. (2002). "An Empirical Study of Heuristicall Solving Constraint Satisfaction Problems with Stochastic Evolutionary Algorithms." Ph.D. thesis, University of Antwerp.
24. Smith, B. (1994). "In Search of Exceptionally Difficult Constraint Satisfaction Problems." Technical Report RR 94.2, University of Leeds.
25. Smith, B.M. and M.E. Dyer. (1996). "Locating the Phase Transition in Binary Constraint Satisfaction Problems." Artificial Intelligence 81(1-2), 155-181.
26. Tsang, E. (1993). Foundations of Constraint Satisfaction. Academic Press.
27. van Hemert, J. (2002a). "Application of Evolutionary Computation to Constraint Satisfaction and Data Mining." Ph.D. thesis, Leiden University.
28. van Hemert, J. (2002b). "Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation." In S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, and G. Raidi (eds.), Applications of Evolutionary Computing. Berlin: Springer-Verlag, pp. 81-90.
29. van Hemert, J. and T. Bäck. (2002). "Measuring the Searched Space to Guide Efficiency: The Principle and Evidence on Constraint Satisfaction." In J. Merelo, A. Panagiotis, H.-G. Beyer, J.-L. Fernández-Villacañas, and H.-P. Schwefel (eds.), Parallel Problem Solving from Nature-PPSN VII. Springer-Verlag, Berlin, pp. 23-32.
30. Walsh, T. (2000). "SAT v CSP." In Proceedings of the 6th Conference on Principles and Practice of Constraint Programming (CP 2000), pp. 441-456.