Adaptive penalties for evolutionary graph coloring

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

Volumn 1363, Issue , 1998, Pages 95-106

  Eiben, A E ^a   van der Hauw, J K ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS;

ADAPTIVE PENALTY; COMPARATIVE EXPERIMENTS; CONSTRAINED PROBLEM; CONSTRAINT HANDLING; GRAPH COLORING HEURISTIC; GRAPH COLORING PROBLEM; GRAPH COLORINGS; PENALTY FUNCTION;

GRAPH THEORY;

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

References (27)

1. 0.4)-approximation algorithm for 3-coloring (and improved approximation algorithms for k-coloring). In Proceedings o/the 21st A CM Symposium on Theory of Computing, pages 535-542, New York, 1989. ACM.
2. D. Brélaz. New methods to color vertices of a graph. Communications of the ACM, 22:251-256, 1979.
3. G.J. Chaitin. Register allocation and spilling via graph coloring. In Proceedings of the ACM SIGPLAN 82 Symposium on Compiler Construction, pages 98-105. ACM Press, 1982.
4. P. Cheeseman, B. Kenefsky, and W. M. Taylor. Where the really hard problems are. In Proceedings of the IJCAI-91, pages 331-337, 1991.
5. S.H. Clearwater and T. Hogg. Problem structure heuristics and scaling behavior for genetic algorithms. Artificial Intelligence, 81:327-347, 1996.
6. J.C. Culberson and F. Luo. Exploring the k-cotorable landscape with iterated greedy. In Second DIMACS Challenge, Discrete Mathematics and Theoretical Computer Science. AMS, 1995. Available by http://web.cs.ualberta.ca/~joe/.
7. L. Davis. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.
8. A.E. Eiben. Multi-parent recombination. In T. Bäck, D. FogeI, and Z. Michalewicz, editors, Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd, Bristol and Oxford University Press, New York, 1997. Section C3.3.7, to appear in the 1st supplement.
9. A.E. Eiben, P.-E. Raué, and Zs. Ruttkay. Constrained problems. In L. Chambers, editor, Practical Handbook of Genetic Algorithms, pages 307-365. CRC Press, 1995.
10. A.E. Eiben and ZS. Ruttkay. Self-adaptivity for constraint satisfaction: Learning penalty functions. In Proceedings of the 3rd IEEE Conference on Evolutionary Computation, pages 258-261. IEEE, IEEE Press, 1996.
11. A.E. Eiben and Zs. Ruttkay. Constraint satisfaction problems. In Th. Bäck, D. Fogel, and M. Michalewicz, editors, Handbook of Evolutionary Algorithms, pages C5.7:1-C5.7: 8. IOP Publishing Ltd. and Oxford University Press, 1997.
12. A.E. Eiben and J.K. van der Hauw. Graph coloring with adaptive evolutionary algorithms. Technical Report TR-96-11, Leiden University, August 1996. also available as http://www.wi.leidenuniv.nl/~gusz/graphcol.ps.gz.
13. A.E. Eiben and J.K. van der Hauw. Solving 3-SAT with adaptive Genetic Algorithms. In Proceedings of the 4th IEEE Conference on Evolutionary Computation, pages 81-86. IEEE, IEEE Press, 1997.
14. E. Falkenauer. A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary Computation, 2(2):123-144, 1994.
15. E. Falkenauer. Solving equal piles with the grouping genetic algorithm. In S. Forrest, editor, Proceedings of the 6th International Conference on Genetic Algorithms, pages 492-497. Morgan Kaufmann, 1995.
16. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freedman and Co., 1979.
17. M.R. Garey, D.S. Johnson, and H.C. So. An application of graph coloring to printed circuit testing. IEEE Trans. on Circuits and Systems, CAS-23:591-599, 1976.
18. R. Hinterding, Z. Michalewicz, and A.E. Eiben. Adaptation in Evolutionary Computation: a survey. In Proceedings of the 4th IEEE Conference on Evolutionary Computation, pages 65-69. IEEE Service Center, 1997.
19. D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research, 39(3):378-406, 1991.
20. L. Kučera. The greedy coloring is a bad probabilistic algorithm. Journal of Algorithms, 12:674-684, 1991.
21. P. Moris. The breakout method for escaping from local minima. In Proceedings of the 11th National Conference on Artificial Intelligence, AAAI-93. AAAI Press/The MIT Press, 1993.
22. B. Selman and H. Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In R. Bajcsy, editor, Proceedings of IJCAI'93, pages 290-295. Morgan Kaufmann, 1993.
23. J.S. Turner. Almost all k-colorable graphs are easy to color. Journal of Algorithms, 9:63-82, 1988.
24. G. von Laszewski. Intelligent structural operators for the k-way graph partitioning problem. In R.K. Belew and L.B. Booker, editors, Proceedings of the 4th International Conference on Genetic Algorithms, pages 45-52. Morgan Kaufmann, 1991.
25. D. De Werra. An introduction to timetabling. European Journal of Operations Research, 19:151-162, 1985.
26. Michalewicz Z. and Michalewicz M. Pro-life versus pro-choice strategies in evolutionary computation techniques. In Palaniswami M., Attikiouzel Y., Marks R.J, Fogel D., and Fukuda T., editors, Computational Intelligence: A Dynamic System Perspective, pages 137-151. IEEE Press, 1995.
27. Michalewicz Z. and Schoenauer M. Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation, 4(1):1-32, 1996.