IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v18y2009i2d10.1007_s10878-008-9140-6.html
   My bibliography  Save this article

Graph coloring by multiagent fusion search

Author

Listed:
  • Xiao-Feng Xie

    (Hong Kong Baptist University)

  • Jiming Liu

    (Hong Kong Baptist University)

Abstract

A multiagent fusion search is presented for the graph coloring problem. In this method, each of agents performs the fusion search, involving a local search working in a primary exploitation role and a recombination search in a navigation role, with extremely limited memory and interacts with others through a decentralized protocol, thus agents are able to explore in parallel as well as to achieve a collective performance. As the knowledge components implemented with available structural information and in formalized forms, the Quasi-Tabu local search and grouping-based recombination rules are especially useful in addressing neutrality and ruggedness of the problem landscape. The new method has been tested on some hard benchmark graphs, and has been shown competitive in comparison with several existing algorithms. In addition, the method provides new lower bound solutions when applied to two large graphs. Some search characteristics of the proposed method is also discussed.

Suggested Citation

  • Xiao-Feng Xie & Jiming Liu, 2009. "Graph coloring by multiagent fusion search," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 99-123, August.
    • Handle: RePEc:spr:jcomop:v:18:y:2009:i:2:d:10.1007_s10878-008-9140-6
    DOI: 10.1007/s10878-008-9140-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-008-9140-6
    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/s10878-008-9140-6?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. 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.
    3. Anuj Mehrotra & Michael A. Trick, 1996. "A Column Generation Approach for Graph Coloring," INFORMS Journal on Computing, INFORMS, vol. 8(4), pages 344-354, November.
    4. Nicolas Barnier & Pascal Brisset, 2004. "Graph Coloring for Air Traffic Flow Management," Annals of Operations Research, Springer, vol. 130(1), pages 163-178, August.
    5. 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.
    6. 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.
    7. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1996. "A fast tabu search algorithm for the permutation flow-shop problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 160-175, May.
    8. 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)

    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. Severino F. Galán, 2017. "Simple decentralized graph coloring," Computational Optimization and Applications, Springer, vol. 66(1), pages 163-185, January.
    2. 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.
    3. 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.
    4. Laurent Moalic & Alexandre Gondran, 2018. "Variations on memetic algorithms for graph coloring problems," Journal of Heuristics, Springer, vol. 24(1), pages 1-24, February.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Massimiliano Caramia & Paolo Dell'Olmo, 2001. "Iterative coloring extension of a maximum clique," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 518-550, September.
    10. 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.
    11. 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.
    12. 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.
    13. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    14. 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.
    15. Stefano Gualandi & Federico Malucelli, 2012. "Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 81-100, February.
    16. Bernard Gendron & Alain Hertz & Patrick St-Louis, 2007. "On edge orienting methods for graph coloring," Journal of Combinatorial Optimization, Springer, vol. 13(2), pages 163-178, February.
    17. Albert E. Fernandes Muritiba & Manuel Iori & Enrico Malaguti & Paolo Toth, 2010. "Algorithms for the Bin Packing Problem with Conflicts," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 401-415, August.
    18. 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.
    19. 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.
    20. 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.

    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:jcomop:v:18:y:2009:i:2:d:10.1007_s10878-008-9140-6. 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.