Efficient graph coloring with parallel genetic algorithms

Computing and Informatics

Volumn 24, Issue 2, 2005, Pages 123-147

  Kokosiński, Zbigniew ^a   Kwarciany, Krzysztof ^a   Kołodziej, Marcin ^a,b  

^a CRACOW UNIVERSITY OF TECHNOLOGY   (Poland)

^b Electra   (Poland)

Author keywords

CEX crossover; Graph coloring; Migration model; Parallel genetic algorithm; SPPX crossover

Indexed keywords

EID: 27844532055     PISSN: 13359150     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. ALBA, E.-TOMASINI, M.: Parallelism and Evolutionary algorithms, IEEE Trans. Evol. Comput., Vol. 6, 2002, No. 5, pp. 443-462.
2. BÄCK, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, 1996.
3. th International Parallel and Distributed Processing Symposium, IPDPS '2001, Workshop on Biologically Inspired Solutions to Parallel Processing Problems, Proceedings, IEEE Comput. Society, 2001, pp. 1-8 (CD-ROM edition).
4. CANTÚ-PAZ, E.: A Survey of Parallel Genetic Algorithms. Calculateurs Paralleles, Reseaux et Systems Repartis Vol. 10, 1998, No. 2, Paris, Hermes, pp. 141-171.
5. CANTÚ-PAZ, E.: Topologies, Migration Rates, and Multi-Population Parallel Genetic Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO '99, Morgan Kaufmann, 1999, pp. 91-98.
6. CANTÚ-PAZ, E.: Efficient and Accurate Parallel Genetic Algorithms. Kluwer, 2000.
7. CANTÚ-PAZ, E.-GOLDBERG, D.E.: Parallel Genetic Algorithms: Theory and Practice. Computer Methods in Applied Mechanics and Engineering, Elsevier, 2000.
8. CROITORIU, C.-LUCHIAN, H.-GHEORGHIES, O.-APETREI A.: A New Genetic Graph Coloring Heuristic. Computational Symposium on Graph Coloring and Generalizations COLOR '02. In: Constraint Programming, Proceedings of the International Conference, CP '02, 2002.
9. DORNE, R.-HAO, J.-K.: A New Genetic Local Search for Graph Coloring. Parallel Problem Solving from Nature, Proceedings of the International Conference, PPSN '98, LNCS, Vol. 1498, 1998, pp. 745-754.
10. FILHO, G. R.,-LORENA, L. A. N.: Constructive Genetic Algorithm and Column Generation: An Application to Graph Coloring. Proc. Asia Pacific Operarions Research Symposium, APORS '2000, 2000.
11. FLEURENT, C.-FERLAND, J. A.: Genetic Algorithms and Hybrids for Graph Coloring. Annals of Operations Research Vol. 63, 1996, pp. 437-461.
12. GALINIER, P.-HAO, J.-K.: Hybrid Evolutionary Algorithms for Graph Coloring. J. Combinatorial Optimization, 1999, pp. 374-397.
13. GAREY, R.-JOHNSON, D. S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, 1979.
14. GLASS, C. A.-PRUGEL-BENNETT, A.: Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm, J. Combinatorial Optimization, 2003, pp. 229-236.
15. HUTCHINSON, G.: Partitioning Algorithms for Finite Sets. Comm. ACM No. 6, 1963, pp. 613-614.
16. IORIO, A.-Li, X.: Parameter Control with a Co-Operative, Co-Evolutionary Genetic Algorithm. Parallel Problem Solving from Nature, Proceedings of the International Conference, PPSN '2002, LNCS, Vol. 2439, 2002, pp. 247-256.
17. JENSEN, T. R.-TOFT, B.: Graph Coloring Problems. Wiley Interscience, 1995.
18. JOHNSON, D.S.,-TRICK, M. A.: Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discr. Math. and Theor. Comp. Sc., Vol. 26, 1996.
19. KARP, R. M.: Reducibility Among Combinatorial Problems. In: Miller R. E. and Thatcher J. W. (Eds.), Complexity of Computer Computations, Plenum Press, 1972, pp. 85-103.
20. KHURI, S.-WALTERS, T.-SUGONO, Y.: Grouping Genetic Algorithm for Coloring Edges of Graph, Proc. 2000 ACM Symposium on Applied Computing, 2000, pp. 422-427.
21. KOKOSIŃSKI, Z.: Effects of Versatile Crossover and Mutation Operators on Evolutionary Search in Partitions and Permutation Problems, Intelligent Information Processing and Web Mining. Proceedings of the International US: IIPWM '2005 Conference, Advances in Soft Computing, Springer, 2005, pp. 299-308.
22. KOKOSIŃSKI, Z.-KOŁODZIEJ, M.-KWARCIANY, K.: Parallel Genetic Algorithm for Graph Coloring Problem. Computational Science, Proceedings of the International Conference, ICCS '2004, LNCS, Vol. 3036, 2004, pp. 215-222.
23. KOLODZIEJ, M.: Genetic Algorithms for Edge Coloring Problem. M.S. Thesis. Cracow University of Technology, Krakow, 2003 (in Polish).
24. KUBALE, M.: Introduction to Computational Complexity and Algorithmic Graph . Coloring. GTN, Gdańsk, 1998.
25. KUBALE, M. (Ed.): Graph Colorings. American Mathematical Society, 2004.
26. nd National Conference, TI '2004, Scientific Papers of ETI Faculty, Gdansk University of Technology No. 5, 2004, pp. 747-754 (in Polish).
27. LEVINE, D.: A Parallel Genetic Algorithm for the Set Partitioning Problem. Argonne Nat. Lab., Argonne, IL, 1996.
28. LIS, J.: Parallel Genetic Algorithm with the Dynamic Control Parameter. Evolutionary Computation, ICEC '1996, Proceedings of the International Conference, IEEE Computer Society, 1996, pp. 324-329.
29. LORENA, L. A. N.-FILHO, G. R.: Constructive Genetic Algorithm for Graph Coloring. Proc. Asia Pacific Operarions Research Symposium, APORS '97, 1997.
30. NOWOSTAWSKI, M.-POLI, R.: Parallel Genetic Algorithm Taxonomy. Knowledge-based Intelligent Information Engineering Systems, KES '99, Proceedings of International Conference, IEEE, 1999, pp. 88-92.
31. NOWOSTAWSKI, M.-POLI, R.: Dynamic Denies Parallel Genetic Algorithm. Knowledge-based Intelligent Information Engineering Systems, KES '99, Proceedings of International Conference, IEEE, 1999, pp. 93-98.
32. SZYFELBEIN, D.: Genetic Algorithms for Graph Coloring. Neural Networks and Their Applications, Proceedings of the Conference, Polish Neural Network Society, 1999, pp. 605-610.
33. SZYFELBEIN, D.: Metaheuristics in Graph Coloring. In: Kubale M. (Ed.): Discrete Optimization. Models and Methods for Graph Coloring. WNT, Warszawa, 2002, pp. 26-52 (in Polish).
34. DE WERRA, D.: Heuristics for Graph Coloring. In: Tinhofer, G. et al. (Eds.) Computational Graph Theory, Springer-Verlag, 1990, pp. 191-208.
35. COLOR web site. Availaible on: http://mat.gsia.emu.edu/COLOR/instances. html.
36. DIMACS ftp site. Availaible on: ftp://dimacs.rutgers.edu/pub/challenge/ graph/benchmarks/.
37. COLORINGS web site. Availaible on: http://mat.gsia.cmu.edu/COLORING03/.