Skip to main content
SpringerLink
Log in

A new genetic local search algorithm for graph coloring

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN V (PPSN 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1498))

Included in the following conference series:

Abstract

This paper presents a new genetic local search algorithm for the graph coloring problem. The algorithm combines an original crossover based on the notion of union of independent sets and a powerful local search operator (tabu search). This new hybrid algorithm allows us to improve ou the best known results of some large instances of the famous Dimacs benchmarks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Brélaz. New methods to color vertices of a graph. Communications of ACM. 22: 251–256. 1979.

    Article  MATH  Google Scholar 

  2. M. Chams, A. Hertz, and D. De Werra. Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research. 32: 260–266, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Costa, A. Hertz, and O. Dubuis. Embedding of a sequential procedure within an evolutionary algorithms for coloring problems in graphs. Journal of Heuristics. 1(1): 105–128, 1995.

    Article  MATH  Google Scholar 

  4. R. Dorne and J.K. Hao Tabu search for graph coloring, T-coloring and set T-colorings. Presented at the 2nd Intl. Conf. on Metaheuristics, Sophia-Antopollis, France, July, 1997, Under review for publication.

    Google Scholar 

  5. E. Falkenauer A hybrid grouping genetic algorithm for bin-packing. Journal of Heuristics, 2(1): 5–30, 1996.

    Article  Google Scholar 

  6. C. Fleurent and J.A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63: 437–463, 1995.

    Article  Google Scholar 

  7. B. Freisleben and P. Merz. New genetic local search operators for the traveling salesman problem. Proc. of PPSN-96, Lecture Notes in Computer Science 1141, pp890–899, Springer-Verlag, 1996.

    Google Scholar 

  8. P. Galinier and J.K. Hao New crossover operators for graph coloring. Research Report, April 1998.

    Google Scholar 

  9. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers. 1997.

    Google Scholar 

  10. A. Hertz and D. De Werra. Using tabu search techniques for graph coloring. Computing, 39: 345–351, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  11. 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.

    Article  MATH  Google Scholar 

  12. F.T. Leighton. A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau Standard, 84: 79–100, 1979.

    MathSciNet  Google Scholar 

  13. P. Merz and B. Freisleben. A genetic local search approach to the quadratic assignment problem. In Proc. of ICGA-97, pp 465–472, Morgan Kaufmann Publishers, 1997.

    Google Scholar 

  14. C. Morgenstern. Distributed coloration neighborhood search. Discrete Mathematics and Theoretical Computer Science, 26: 335–358. American Mathematical Society, 1996.

    Google Scholar 

  15. C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization — Algorithms and Complexity. Prentice Hall, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LGI2P/EMA-EERIE, Parc Scientifique Georges Besse, F-30000, NÎmes, France

    RaphaËl Dorne & Jin-Kao Hao

Authors
  1. RaphaËl Dorne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin-Kao Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Agoston E. Eiben Thomas Bäck Marc Schoenauer Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dorne, R., Hao, JK. (1998). A new genetic local search algorithm for graph coloring. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056916

Download citation

  • DOI: https://doi.org/10.1007/BFb0056916

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65078-2

  • Online ISBN: 978-3-540-49672-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation