Journal of Combinatorial Optimization

, Volume 18, Issue 2, pp 99–123 | Cite as

Graph coloring by multiagent fusion search

Article

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.

Keywords

Graph coloring Global optimization Multiagent system 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson JR (2005) Human symbol manipulation within an integrated cognitive architecture. Cogn Sci 29(3):313–341 CrossRefGoogle Scholar
  2. Bandura A (1977) Social learning theory. Prentice Hall, Englewood Cliffs Google Scholar
  3. Barbosa VC, Assis CAG, do Nascimento JO (2004) Two novel evolutionary formulations of the graph coloring problem. J Comb Optim 8(1):41–63 MATHCrossRefMathSciNetGoogle Scholar
  4. Barnier N, Brisset P (2004) Graph coloring for air traffic flow management. Ann Oper Res 130(1–4):163–178 MATHCrossRefMathSciNetGoogle Scholar
  5. Boese KD, Kahng AB, Muddu S (1994) A new adaptive multi-start technique for combinatorial global optimizations. Oper Res Lett 16:101–113 MATHCrossRefMathSciNetGoogle Scholar
  6. Boettcher S, Percus AG (2004) Extremal optimization at the phase transition of the three-coloring problem. Phys Rev E 69(6):Art066703 CrossRefGoogle Scholar
  7. Bonabeau E, Dorigo M, Theraulaz G (1999) Swarm intelligence: from natural to artificial systems. Oxford University Press, London MATHGoogle Scholar
  8. Brélaz D (1979) New methods to color the vertices of a graph. Commun ACM 22(4):251–256 MATHCrossRefGoogle Scholar
  9. Bui TN, Nguyen TH, Patel CM, Phan K-AT (2008) An ant-based algorithm for coloring graphs. Discrete Appl Math 156(2):190–200 MATHCrossRefMathSciNetGoogle Scholar
  10. Cheeseman P, Kanefsky B, Taylor WM (1991) Where the really hard problems are. In: International joint conference on artificial intelligence, San Mateo, CA, pp 331–337 Google Scholar
  11. Chiarandini M (2005) Stochastic local search methods for highly constrained combinatorial optimisation problems. PhD thesis, Darmstadt University of Technology, Germany Google Scholar
  12. Cioffi-Revilla C (2002) Invariance and universality in social agent-based simulations. Proc Natl Acad Sci USA 99(3):7314–7316 CrossRefGoogle Scholar
  13. Coudert O (1997) Exact coloring of real-life graphs is easy. In: Design automation conference, San Francisco, CA, USA, pp 121–126 Google Scholar
  14. Culberson JC, Luo F (1996) Exploring the k-colorable landscape with iterated greedy. In: Cliques, coloring, and satisfiability: second DIMACS implementation challenge. Am Math Soc, Providence, pp 245–284 Google Scholar
  15. Curran D, O’Riordan C (2006) Increasing population diversity through cultural learning. Adapt Behav 14(4):315–338 CrossRefGoogle Scholar
  16. Cutello V, Nicosia G, Pavone M (2007) An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem. J Comb Optim 14(1):9–33 MATHCrossRefMathSciNetGoogle Scholar
  17. Di Blas A, Jagota A, Hughey R (2002) Energy function-based approaches to graph coloring. IEEE Trans Neural Netw 13(1):81–91 CrossRefGoogle Scholar
  18. Dietterich TG (1986) Learning at the knowledge level. Mach Learn 1:287–316 Google Scholar
  19. Dorne R, Hao JK (1998) A new genetic local search algorithm for graph coloring. In: International conference on parallel problem solving from nature, Amsterdam, NL, pp 745–754 Google Scholar
  20. Edgington T, Choi B, Henson K, Raghu TS, Vinze A (2004) Adopting ontology to facilitate knowledge sharing. Commun ACM 47(11):85–90 CrossRefGoogle Scholar
  21. Eppstein D (2003) Small maximal independent sets and faster exact graph coloring. J Graph Algorithms Appl 7(2):131–140 MATHMathSciNetGoogle Scholar
  22. Erben W (2000) Grouping genetic algorithm for graph colouring and exam timetabling. In: International conference on practice and theory of automated timetabling, Konstanz, Germany, pp 132–156 Google Scholar
  23. Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heuristics 2(1):5–30 CrossRefGoogle Scholar
  24. Fleurent C, Ferland JA (1996) Genetic and hybrid algorithms for graph coloring. Ann Oper Res 63:437–464 MATHCrossRefGoogle Scholar
  25. Fragaszy D, Visalberghi E (2004) Socially biased learning in monkeys. Learn Behav 32(1):24–35 Google Scholar
  26. Frank J, Cheeseman P, Stutz J (1997) When gravity fails: local search topology. J Artif Intell Res 7:249–281 MATHMathSciNetGoogle Scholar
  27. Funabiki N, Higashino T (2000) A minimal-state processing search algorithm for graph coloring problems. IEICE Trans Fundam Electron Commun Comput Sci E 83A(7):1420–1430 Google Scholar
  28. Galef BG (1995) Why behaviour patterns that animals learn socially are locally adaptive. Anim Behav 49(5):1325–1334 CrossRefGoogle Scholar
  29. Galinier P, Hao J-K (1999) Hybrid evolutionary algorithms for graph coloring. J Comb Optim 3(4):379–397 MATHCrossRefMathSciNetGoogle Scholar
  30. Galinier P, Hertz A (2006) A survey of local search methods for graph coloring. Comput Oper Res 33(9):2547–2562 MATHCrossRefMathSciNetGoogle Scholar
  31. Galinier P, Hertz A, Zufferey N (2008) An adaptive memory algorithm for the k-colouring problem. Discrete Appl Math 156(2):267–279 MATHCrossRefMathSciNetGoogle Scholar
  32. Gebremedhin AH, Manne F, Pothen A (2005) What color is your Jacobian? Graph coloring for computing derivatives. SIAM Rev 47(4):629–705 MATHCrossRefMathSciNetGoogle Scholar
  33. Gigerenzer G, Goldstein DG (1996) Reasoning the fast and frugal way: models of bounded rationality. Psych Rev 103(4):650–669 CrossRefGoogle Scholar
  34. Glass CA, Prugel-Bennett A (2003) Genetic algorithm for graph coloring: exploration of Galinier and Hao’s algorithm. J Comb Optim 7(3):229–236 MATHCrossRefMathSciNetGoogle Scholar
  35. Glenberg AM (1997) What memory is for. Behav Brain Sci 20(1):1–55 Google Scholar
  36. Gomes CP, Selman B (2001) Algorithm portfolios. Artif Intell 126(1–2):43–62 MATHCrossRefMathSciNetGoogle Scholar
  37. Hamiez J-P, Hao J-K (2001) Scatter search for graph coloring. In: International conference on artificial evolution, Le Creusot, France, pp 168–179 Google Scholar
  38. Hertz A, de Werra D (1987) Using tabu search techniques for graph coloring. Computing 39:345–351 MATHCrossRefMathSciNetGoogle Scholar
  39. Hoos HH (1999) On the run-time behaviour of stochastic local search algorithms for SAT. In: National conference on artificial intelligence, Orlando, FL, pp 661–666 Google Scholar
  40. Hoos HH, Stützle T (1998) Evaluating Las Vegas algorithms—pitfalls and remedies. In: Conference on uncertainty in artificial intelligence, Madison, WI, pp 238–245 Google Scholar
  41. Johnson DS, Aragon CR, McGeoch LA, Schevon C (1991) Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Oper Res 39(3):378–406 MATHCrossRefGoogle Scholar
  42. Johnson DS, Trick MA (eds) (1996) Cliques, coloring, and satisfiability: second DIMACS implementation challenge. Am Math Soc, Providence MATHGoogle Scholar
  43. Joslin DE, Clements DP (1999) “Squeaky wheel” optimization. J Artif Intell Res 10:353–373 MATHMathSciNetGoogle Scholar
  44. Khanna S, Linial N, Safra S (2000) On the hardness of approximating the chromatic number. Combinatorica 20(3):393–415 MATHCrossRefMathSciNetGoogle Scholar
  45. Kirovski D (1998) Efficient coloring of a large spectrum of graphs. In: Design automation conference, San Francisco, CA, USA, pp 427–432 Google Scholar
  46. Lerman K, Galstyan A (2003) Agent memory and adaptation in multi-agent systems. In: International conference on autonomous agents and multi-agent systems, Melbourne, Australia, pp 797–803 Google Scholar
  47. Liu J, Han J, Tang YY (2002) Multi-agent oriented constraint satisfaction. Artif Intell 136(1):101–144 MATHCrossRefMathSciNetGoogle Scholar
  48. Liu J, Jin X, Tsui K-C (2005) Autonomy Oriented Computing (AOC): From problem solving to complex systems modeling. Kluwer Academic, Dordrecht Google Scholar
  49. Liu J, Tsui K-C (2006) Toward nature-inspired computing. Commun ACM 49(10):59–64 CrossRefGoogle Scholar
  50. Mehrotra A, Trick M (1996) A column generation approach for graph coloring. INFORMS J Comput 8(4):344–354 MATHCrossRefGoogle Scholar
  51. Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evol Comput 4(4):337–352 CrossRefGoogle Scholar
  52. Mezard M, Palassini M, Rivoire O (2005) Landscape of solutions in constraint satisfaction problems. Phys Rev Lett 95(20):Art200202 CrossRefGoogle Scholar
  53. Morgenstern C (1996) Distributed coloration neighborhood search. In: Cliques, coloring, and satisfiability: second DIMACS implementation challenge. Am Math Soc, Providence, pp 335–358 Google Scholar
  54. Mumford CL (2006) New order-based crossovers for the graph coloring problem. In: International conference on parallel problem solving from nature, Reykjavik, Iceland, pp 880–889 Google Scholar
  55. Newell A, Simon HA (1972) Human problem solving. Prentice-Hall, Englewood Cliffs Google Scholar
  56. Nowicki E (1996) A fast tabu search algorithm for the permutation flow shop problem. Eur J Oper Res 91:160–175 MATHCrossRefGoogle Scholar
  57. Reeves CR, Yamada T (1998) Genetic algorithms, path relinking, and the flowshop sequencing problem. Evol Comput 6(1):45–60 CrossRefGoogle Scholar
  58. Reidys CM, Stadler PF (2002) Combinatorial landscapes. SIAM Rev 44(1):3–54 MATHCrossRefMathSciNetGoogle Scholar
  59. Schuurmans D, Southey F (2001) Local search characteristics of incomplete SAT procedures. Artif Intell 132(2):121–150 MATHCrossRefMathSciNetGoogle Scholar
  60. Selman B, Kautz HA (1993) An empirical study of greedy local search for satisfiability testing. In: National conference on artificial intelligence, Washington, DC, USA, pp 46–51 Google Scholar
  61. Selman B, Kautz HA, Cohen B (1994) Noise strategies for improving local search. In: National conference on artificial intelligence, Seattle, WA, pp 337–343 Google Scholar
  62. Smith MD, Ramsey N, Holloway G (2004) A generalized algorithm for graph-coloring register allocation. ACM SIGPLAN Not 39(6):277–288 CrossRefGoogle Scholar
  63. Stone P, Veloso M (2000) Multiagent systems: a survey from a machine learning perspective. Auton Robots 8(3):345–383 CrossRefGoogle Scholar
  64. Trick MA, Yildiz H (2007) A large neighborhood search heuristic for graph coloring. In: International conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems, Brussels, Belgium, pp 346–360 Google Scholar
  65. Walsh T (2001) Search on high degree graphs. In: International joint conference on artificial intelligence, Seattle, Washington, USA, pp 266–274 Google Scholar
  66. Weyns D, Holvoet T (2005) On the role of environments in multiagent systems. Informatica 29:409–421 Google Scholar
  67. Xie X-F, Liu J (2005) A compact multiagent system based on autonomy oriented computing. In: IEEE/WIC/ACM international conference on intelligent agent technology, Compiègne, France, pp 38–44 Google Scholar
  68. Xie X-F, Liu J (2006) How autonomy oriented computing (AOC) tackles a computationally hard optimization problem. In: International joint conference on autonomous agents and multiagent systems, Hakodate, Japan, pp 646–653 Google Scholar
  69. Xie X-F, Zhang W-J (2004) SWAF: swarm algorithm framework for numerical optimization. In: Genetic and evolutionary computation conference, Seattle, WA, pp 238–250 Google Scholar
  70. Zhang W (2004) Configuration landscape analysis and backbone guided local search. Artif Intell 158(1):1–26 MATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Department of Computer ScienceHong Kong Baptist UniversityHong KongChina

Personalised recommendations