IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v24y2018i1d10.1007_s10732-017-9354-9.html
   My bibliography  Save this article

Variations on memetic algorithms for graph coloring problems

Author

Listed:
  • Laurent Moalic

    (Univ. Bourgogne Franche-Comté)

  • Alexandre Gondran

    (French Civil Aviation University)

Abstract

Graph vertex coloring with a given number of colors is a well-known and much-studied NP-complete problem. The most effective methods to solve this problem are proved to be hybrid algorithms such as memetic algorithms or quantum annealing. Those hybrid algorithms use a powerful local search inside a population-based algorithm. This paper presents a new memetic algorithm based on one of the most effective algorithms: the hybrid evolutionary algorithm (HEA) from Galinier and Hao (J Comb Optim 3(4): 379–397, 1999). The proposed algorithm, denoted HEAD—for HEA in Duet—works with a population of only two individuals. Moreover, a new way of managing diversity is brought by HEAD. These two main differences greatly improve the results, both in terms of solution quality and computational time. HEAD has produced several good results for the popular DIMACS benchmark graphs, such as 222-colorings for $${ }$$ , 81-colorings for $${ }$$ and even 47-colorings for $${ }$$ and 82-colorings for $${ }$$ .

Suggested Citation

  • Laurent Moalic & Alexandre Gondran, 2018. "Variations on memetic algorithms for graph coloring problems," Journal of Heuristics, Springer, vol. 24(1), pages 1-24, February.
    • Handle: RePEc:spr:joheur:v:24:y:2018:i:1:d:10.1007_s10732-017-9354-9
    DOI: 10.1007/s10732-017-9354-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-017-9354-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-017-9354-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1991. "Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning," Operations Research, INFORMS, vol. 39(3), pages 378-406, June.
    2. Olawale Titiloye & Alan Crispin, 2012. "Parameter Tuning Patterns for Random Graph Coloring with Quantum Annealing," PLOS ONE, Public Library of Science, vol. 7(11), pages 1-9, November.
    3. Nicolas Barnier & Pascal Brisset, 2004. "Graph Coloring for Air Traffic Flow Management," Annals of Operations Research, Springer, vol. 130(1), pages 163-178, August.
    4. Philippe Galinier & Jin-Kao Hao, 1999. "Hybrid Evolutionary Algorithms for Graph Coloring," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 379-397, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Casado, Silvia & Laguna, Manuel & Pacheco, Joaquín & Puche, Julio C., 2020. "Grouping products for the optimization of production processes: A case in the steel manufacturing industry," European Journal of Operational Research, Elsevier, vol. 286(1), pages 190-202.
    2. Zhou, Yangming & Wang, Gezi & Hao, Jin-Kao & Geng, Na & Jiang, Zhibin, 2023. "A fast tri-individual memetic search approach for the distance-based critical node problem," European Journal of Operational Research, Elsevier, vol. 308(2), pages 540-554.
    3. Melo, Rafael A. & Queiroz, Michell F. & Santos, Marcio C., 2021. "A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic," European Journal of Operational Research, Elsevier, vol. 295(1), pages 66-81.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiao-Feng Xie & Jiming Liu, 2009. "Graph coloring by multiagent fusion search," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 99-123, August.
    2. Severino F. Galán, 2017. "Simple decentralized graph coloring," Computational Optimization and Applications, Springer, vol. 66(1), pages 163-185, January.
    3. Alex Gliesch & Marcus Ritt, 2022. "A new heuristic for finding verifiable k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 28(1), pages 61-91, February.
    4. M Plumettaz & D Schindl & N Zufferey, 2010. "Ant Local Search and its efficient adaptation to graph colouring," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 819-826, May.
    5. C A Glass & A Prügel-Bennett, 2005. "A polynomially searchable exponential neighbourhood for graph colouring," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 324-330, March.
    6. Valmir C. Barbosa & Carlos A.G. Assis & Josina O. Do Nascimento, 2004. "Two Novel Evolutionary Formulations of the Graph Coloring Problem," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 41-63, March.
    7. Bradley Hardy & Rhyd Lewis & Jonathan Thompson, 2018. "Tackling the edge dynamic graph colouring problem with and without future adjacency information," Journal of Heuristics, Springer, vol. 24(3), pages 321-343, June.
    8. Caramia, Massimiliano & Dell'Olmo, Paolo, 2008. "Embedding a novel objective function in a two-phased local search for robust vertex coloring," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1358-1380, September.
    9. Vincenzo Cutello & Giuseppe Nicosia & Mario Pavone, 2007. "An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem," Journal of Combinatorial Optimization, Springer, vol. 14(1), pages 9-33, July.
    10. Celia A. Glass & Adam Prügel-Bennett, 2003. "Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 229-236, September.
    11. Avanthay, Cedric & Hertz, Alain & Zufferey, Nicolas, 2003. "A variable neighborhood search for graph coloring," European Journal of Operational Research, Elsevier, vol. 151(2), pages 379-388, December.
    12. Iztok Fister & Marjan Mernik & Bogdan Filipič, 2013. "Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm," Computational Optimization and Applications, Springer, vol. 54(3), pages 741-770, April.
    13. Olawale Titiloye & Alan Crispin, 2012. "Parameter Tuning Patterns for Random Graph Coloring with Quantum Annealing," PLOS ONE, Public Library of Science, vol. 7(11), pages 1-9, November.
    14. Philippe Galinier & Zied Boujbel & Michael Coutinho Fernandes, 2011. "An efficient memetic algorithm for the graph partitioning problem," Annals of Operations Research, Springer, vol. 191(1), pages 1-22, November.
    15. Nicolas Zufferey & Olivier Labarthe & David Schindl, 2012. "Heuristics for a project management problem with incompatibility and assignment costs," Computational Optimization and Applications, Springer, vol. 51(3), pages 1231-1252, April.
    16. Enrico Malaguti & Michele Monaci & Paolo Toth, 2008. "A Metaheuristic Approach for the Vertex Coloring Problem," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 302-316, May.
    17. Lü, Zhipeng & Hao, Jin-Kao, 2010. "A memetic algorithm for graph coloring," European Journal of Operational Research, Elsevier, vol. 203(1), pages 241-250, May.
    18. Malaguti, Enrico & Toth, Paolo, 2008. "An evolutionary approach for bandwidth multicoloring problems," European Journal of Operational Research, Elsevier, vol. 189(3), pages 638-651, September.
    19. Jagota, Arun, 1996. "An adaptive, multiple restarts neural network algorithm for graph coloring," European Journal of Operational Research, Elsevier, vol. 93(2), pages 257-270, September.
    20. Schlereth, Christian & Stepanchuk, Tanja & Skiera, Bernd, 2010. "Optimization and analysis of the profitability of tariff structures with two-part tariffs," European Journal of Operational Research, Elsevier, vol. 206(3), pages 691-701, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:24:y:2018:i:1:d:10.1007_s10732-017-9354-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.