Skip to main content
SpringerLink
Log in

A Study of Breakout Local Search for the Minimum Sum Coloring Problem

  • Conference paper
Simulated Evolution and Learning (SEAL 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7673))

Included in the following conference series:

Abstract

Given an undirected graph G = (V,E), the minimum sum coloring problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. In this paper, we present Breakout Local Search (BLS) for MSCP which combines some essential features of several well-established metaheuristics. BLS explores the search space by a joint use of local search and adaptive perturbation strategies. Tested on 27 commonly used benchmark instances, our algorithm shows competitive performance with respect to recently proposed heuristics and is able to find new record-breaking results for 4 instances.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Battiti, R., Protasi, M.: Reactive search, a history-based heuristic for max-sat. ACM Journal of Experimental Algorithmics 2 (1996)

    Google Scholar 

  2. Benlic, U., Hao, J.K.: Breakout local search for maximum clique problems. Operations Research 40(1), 192–206 (2013)

    Google Scholar 

  3. Bouziri, H., Jouini, M.: A tabu search approach for the sum coloring problem. Electronic Notes in Discrete Mathematics 36, 915–922 (2010)

    Article  Google Scholar 

  4. Douiri, S.M., Elbernoussi, S.: New algorithm for the sum coloring problem. International Journal of Contemporary Mathematical Sciences 6, 453–463 (2011)

    MathSciNet  MATH  Google Scholar 

  5. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)

    Book  MATH  Google Scholar 

  6. Helmar, A., Chiarandini, M.: A local search heuristic for chromatic sum. In: MIC 2011, pp. 161–170 (2011)

    Google Scholar 

  7. Kelly, J.P., Laguna, M., Glover, F.: A study of diversification strategies for the quadratic assignment problem. Computers and Operations Research 21(8), 885–893 (1994)

    Article  MATH  Google Scholar 

  8. Kirkpatrick, S., Gelett, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 621–630 (1983)

    Article  Google Scholar 

  9. Kokosiński, Z., Kwarciany, K.: On Sum Coloring of Graphs with Parallel Genetic Algorithms. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds.) ICANNGA 2007, Part I. LNCS, vol. 4431, pp. 211–219. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Li, Y., Lucet, C., Moukrim, A., Sghiouer, K.: Greedy algorithms for minimum sum coloring algorithm. In: Proceedings of LT 2009 (2009)

    Google Scholar 

  11. Lourenco, H.R., Martin, O., Stützle, T.: Iterated local search. Handbook of Meta-heuristics. Springer, Heidelberg (2003)

    Google Scholar 

  12. Malafiejski, M.: Sum coloring of graphs. In: Kubale, M. (ed.) AMS Graph Colorings, pp. 55–65 (2004)

    Google Scholar 

  13. Wu, Q., Hao, J.K.: An effective heuristic algorithm for sum coloring of graphs. Computers & Operations Research 39(7), 1593–1600 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LERIA, Université d’Angers, 2 Bd Lavoisier, 49045, Angers Cedex 01, France

    Una Benlic & Jin-Kao Hao

Authors
  1. Una Benlic
    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

Editors and Affiliations

  1. Faculty of Information Technology, Le Quy Don Technical University, 100 Hoang Quoc Viet Street, Cau Giay District,, Hanoi, Vietnam

    Lam Thu Bui

  2. School of Computer Engineering, Nanyang Technological University, Block N4, 2b-39, Nanyang Avenue, 639798,, Singapore, Singapore

    Yew Soon Ong

  3. Faculty of Information Technology,, Hanoi University, km9 Nguyen Trai Road, Hanoi, Vietnam

    Nguyen Xuan Hoai

  4. Graduate School of Engineering, Department of Computer Science, Osaka Prefecture University, 1-1 Gakuen-cho, Nakaku, 599-8531, Sakai, Osaka, Japan

    Hisao Ishibuchi

  5. School of Electrical and Electronic Engineering, Nanyang Technological University, Block N4, 2b-39, Nanyang Avenue, 639798, Singapore, Singapore

    Ponnuthurai Nagaratnam Suganthan

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benlic, U., Hao, JK. (2012). A Study of Breakout Local Search for the Minimum Sum Coloring Problem. In: Bui, L.T., Ong, Y.S., Hoai, N.X., Ishibuchi, H., Suganthan, P.N. (eds) Simulated Evolution and Learning. SEAL 2012. Lecture Notes in Computer Science, vol 7673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34859-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34859-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34858-7

  • Online ISBN: 978-3-642-34859-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation