Using differential evolution for the graph coloring

IEEE SSCI 2011 - Symposium Series on Computational Intelligence - SDE 2011: 2011 IEEE Symposium on Differential Evolution

Volumn , Issue , 2011, Pages 150-156

  Fister, Iztok ^a   Brest, Janez ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

3-COLORING; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPETITIVE TOOLS; DIFFERENTIAL EVOLUTION; FUNCTION OPTIMIZATION; GRAPH COLORING PROBLEM; GRAPH COLORINGS; HYBRID EVOLUTIONARY ALGORITHM; SELF-ADAPTIVE DIFFERENTIAL EVOLUTION ALGORITHMS;

ADAPTIVE ALGORITHMS; ARTIFICIAL INTELLIGENCE; COLORING; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 79961149082     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SDE.2011.5952075     Document Type: Conference Paper

References (35)

1. E. Aarts and J.K. Lenstra. Local search in combinatorial optimization. Princeton University Press, Princeton and Oxford, 1997.
2. T. Bäck. Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford, 1996.
3. J.A. Bondy and U.S.R. Murty. Graph Theory. Springer-Verlag, Berlin, 2008.
4. D. Brelaz. New methods to color vertices of a graph. Communications of the Association for Computing Machinery, 22:251-256, 1979. (Pubitemid 9452014)
5. J. Brest, S. Greiner, B. Boskovic, M. Mernik, and V. Zumer. Selfadapting control parameters in differential evolution: A comparative study on numerical benchmark problems. IEEE Trans. Evolutionary Computation, 10(6):646-657, 2006. (Pubitemid 46445554)
6. P. Cheeseman, B. Kanefsky, and W.M. Taylor. Where the really hard problems are. In Proceedings of the International Joint Conference on Artificial Intelligence, volume 1, pages 331-337, San Mateo, 1991. Morgan Kaufmann.
7. M. Chiandini and T. Stützle. An analysis of heuristics for vertex colouring. In Lecture Notes in Computer Science, volume 6049, pages 326-337. Springer-Verlag, Berlin, 2010.
8. M. Chiandini and T. Stützle. Online compendium to the article: An analysis of heuristics for vertex colouring, December 2010.
9. J. Culberson. Graph coloring page, December 2010.
10. S. Das and P.N. Suganthan. Differential evolution: A survey of the state-of-the-art. Evolutionary Computation, IEEE Transactions on. DOI: 10.1109/TEVC.2010.2059031, Accepted.
11. A.E. Eiben, K. Hauw, and J.I. Hemert. Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics, 4:25-46, 1998. (Pubitemid 128512786)
12. A.E. Eiben and J.E. Smith. Introduction to evolutionary computing. Springer-Verlag, Berlin, 2003.
13. C. Fleurent and J.A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63, 1996.
14. P. Galinier and J.-K. Hao. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3, 1999.
15. P. Galinier and A. Hertz. A survey of local search methods for graph coloring. Computers and operational research, 33:2547-2562, 2006. (Pubitemid 43098900)
16. M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Company, New York, NY, USA, 1979.
17. F. Glover. Future paths for integer programming and links to artificial intelligence. Computers and operational research, 13:533-549, 1986. (Pubitemid 17480188)
18. G.W. Greenwood. Using differential evolution for a subclass of graph theory problems. IEEE Transactions on Evolutionary Computation, 13(5):1190-1192, 2009.
19. G.R. Grimmet and C.J.H. McDiarmid. On colouring random graphs. In Mathematical Proceedings of the Cambridge Phylosophical Society, volume 77, pages 313-324, New York, NY, USA, 1975. Cambridge University Press.
20. B. Hayes. On the threshold. American Scientist, 91:12-17, 2003.
21. A. Hertz and D. de Werra. Using tabu search techniques for graph coloring. Computing, 39:345-351, 1987. (Pubitemid 18562739)
22. M. Kubale. Graph colorings. American Mathematical Society, Rhode Island, USA, 2004.
23. Z. Lu and J.-K. Hau. A memetic algorithm for graph coloring. European Journal of Operational Research, 203:241-250, 2010.
24. E. Malaguti and P. Toth. A survey on vertex coloring problems. International transactions in operational research, 17:1-34, 2010.
25. N. Mladenovic and P. Hansen. Variable neighborhood search. Computers & OR, 24(11):1097-1100, 1997.
26. R. Mulet, A. Pagnani, M. Weigt, and R. Zecchina. Coloring random graphs. Physical Review Letter, 89(26):268701, Dec 2002.
27. F. Neri and V. Tirronen. Recent advances in differential evolution: a survey and experimental analysis. Artificial Intelligence Review, 33(1- 2):61-106, 2010.
28. Q.-K. Pan, M.F. Tasgetiren, and Y.-C. Liang. A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Computers & Industrial Engineering, 35(4):795-816, 2008.
29. A.D. Petford and D.J.A. Welsh. A randomized 3-coloring algorithms. Discrete Mathematic, 74:253-261, 1989.
30. K. Price, R.M. Storn, and J.A. Lampinen. Differential Evolution: A Practical Approach to Global Optimization. Springer-Verlag, New York, NY, USA, 2005.
31. J. E. Smith. Self-adaptation in evolutionary algorithms for combinatorial optimization. In C. Cotta, M. Sevaux, and K. Sörensen, editors, Adaptive and Multilevel Metaheuristics, volume 136, pages 31-57. Springer- Verlag, Berlin, 2008.
32. M.F. Tasgetiren, P.N. Suganthan, T.J. Chua, and M.A. Al-Hajri. Differential evolution algorithms for the generalized assignment problem. In IEEE Congress on Evolutionary Computation, pages 2606-2613. IEEE, 2009.
33. M.F. Tasgetiren, P.N. Suganthan, Q.-K. Pan, R. Mallipeddi, and S. Sarman. An ensemble of differential evolution algorithms for constrained function optimization. In IEEE Congress on Evolutionary Computation, pages 1-8. IEEE, 2010.
34. J.S. Turner. Almost all k-colorable graphs are easy to color. Journal of Algorithms, 9:63-82, 1988.
35. J. Van Hemert. Janos homepage, December 2010.