Graph coloring by multiagent fusion search

Journal of Combinatorial Optimization

Volumn 18, Issue 2, 2009, Pages 99-123

  Xie, Xiao Feng ^a   Liu, Jiming ^a  

^a HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

Global optimization; Graph coloring; Multiagent system

Indexed keywords

DECENTRALIZED PROTOCOLS; GRAPH COLORING PROBLEM; GRAPH COLORINGS; KNOWLEDGE COMPONENTS; LARGE GRAPHS; LIMITED MEMORY; LOCAL SEARCH; LOWER BOUNDS; MULTI-AGENT; SEARCH CHARACTERISTICS; STRUCTURAL INFORMATION;

COLORING; CONTROL THEORY; GLOBAL OPTIMIZATION; GRAPH THEORY;

TABU SEARCH;

EID: 72449146338     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-008-9140-6     Document Type: Article

References (70)

1. JR Anderson 2005 Human symbol manipulation within an integrated cognitive architecture Cogn Sci 29 3 313 341
2. Bandura A (1977) Social learning theory. Prentice Hall, Englewood Cliffs
3. VC Barbosa CAG Assis JO do Nascimento 2004 Two novel evolutionary formulations of the graph coloring problem J Comb Optim 8 1 41 63 1057.05030 10.1023/B:JOCO.0000021937.26468.b2 2058132
4. N Barnier P Brisset 2004 Graph coloring for air traffic flow management Ann Oper Res 130 1-4 163 178 1062.90011 10.1023/B:ANOR.0000032574.01332.98 2076516
5. KD Boese AB Kahng S Muddu 1994 A new adaptive multi-start technique for combinatorial global optimizations Oper Res Lett 16 101 113 0812.90126 10.1016/0167-6377(94)90065-5 1301749
6. S Boettcher AG Percus 2004 Extremal optimization at the phase transition of the three-coloring problem Phys Rev E 69 6 066703 10.1103/PhysRevE.69.066703
7. Bonabeau E, Dorigo M, Theraulaz G (1999) Swarm intelligence: from natural to artificial systems. Oxford University Press, London
8. D Brélaz 1979 New methods to color the vertices of a graph Commun ACM 22 4 251 256 0394.05022 10.1145/359094.359101 (Pubitemid 9452014)
9. TN Bui TH Nguyen CM Patel K-AT Phan 2008 An ant-based algorithm for coloring graphs Discrete Appl Math 156 2 190 200 1130.05054 10.1016/j.dam.2006. 07.012 2378676 (Pubitemid 350258665)
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
11. Chiarandini M (2005) Stochastic local search methods for highly constrained combinatorial optimisation problems. PhD thesis, Darmstadt University of Technology, Germany
12. C Cioffi-Revilla 2002 Invariance and universality in social agent-based simulations Proc Natl Acad Sci USA 99 3 7314 7316 10.1073/pnas.082081499 (Pubitemid 34522729)
13. Coudert O (1997) Exact coloring of real-life graphs is easy. In: Design automation conference, San Francisco, CA, USA, pp 121-126
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
15. D Curran C O'Riordan 2006 Increasing population diversity through cultural learning Adapt Behav 14 4 315 338 10.1177/1059712306072335 (Pubitemid 44706847)
16. V Cutello G Nicosia M Pavone 2007 An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem J Comb Optim 14 1 9 33 1125.05098 10.1007/s10878-006-9036-2 2322090 (Pubitemid 46791040)
17. A Di Blas A Jagota R Hughey 2002 Energy function-based approaches to graph coloring IEEE Trans Neural Netw 13 1 81 91 10.1109/72.977273 (Pubitemid 34236839)
18. TG Dietterich 1986 Learning at the knowledge level Mach Learn 1 287 316
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
20. T Edgington B Choi K Henson TS Raghu A Vinze 2004 Adopting ontology to facilitate knowledge sharing Commun ACM 47 11 85 90 10.1145/1029496.1029499 (Pubitemid 40085708)
21. D Eppstein 2003 Small maximal independent sets and faster exact graph coloring J Graph Algorithms Appl 7 2 131 140 1027.05092 2112051
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
23. E Falkenauer 1996 A hybrid grouping genetic algorithm for bin packing J Heuristics 2 1 5 30 10.1007/BF00226291
24. C Fleurent JA Ferland 1996 Genetic and hybrid algorithms for graph coloring Ann Oper Res 63 437 464 0851.90095 10.1007/BF02125407 (Pubitemid 126081086)
25. D Fragaszy E Visalberghi 2004 Socially biased learning in monkeys Learn Behav 32 1 24 35
26. J Frank P Cheeseman J Stutz 1997 When gravity fails: local search topology J Artif Intell Res 7 249 281 0894.68041 1618952
27. N Funabiki T Higashino 2000 A minimal-state processing search algorithm for graph coloring problems IEICE Trans Fundam Electron Commun Comput Sci E 83 7 1420 1430
28. BG Galef 1995 Why behaviour patterns that animals learn socially are locally adaptive Anim Behav 49 5 1325 1334 10.1006/anbe.1995.0164
29. P Galinier J-K Hao 1999 Hybrid evolutionary algorithms for graph coloring J Comb Optim 3 4 379 397 0958.90071 10.1023/A:1009823419804 1733298
30. P Galinier A Hertz 2006 A survey of local search methods for graph coloring Comput Oper Res 33 9 2547 2562 1086.90060 10.1016/j.cor.2005.07.028 2217906 (Pubitemid 43098900)
31. P Galinier A Hertz N Zufferey 2008 An adaptive memory algorithm for the k-colouring problem Discrete Appl Math 156 2 267 279 1131.05089 10.1016/j.dam.2006.07.017 2378681 (Pubitemid 350251597)
32. AH Gebremedhin F Manne A Pothen 2005 What color is your Jacobian? Graph coloring for computing derivatives SIAM Rev 47 4 629 705 1076.05034 10.1137/S0036144504444711 2212395
33. G Gigerenzer DG Goldstein 1996 Reasoning the fast and frugal way: models of bounded rationality Psych Rev 103 4 650 669 10.1037/0033-295X.103.4.650
34. CA Glass A Prugel-Bennett 2003 Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm J Comb Optim 7 3 229 236 1098.68096 10.1023/A:1027312403532 2024883
35. AM Glenberg 1997 What memory is for Behav Brain Sci 20 1 1 55
36. CP Gomes B Selman 2001 Algorithm portfolios Artif Intell 126 1-2 43 62 0969.68047 10.1016/S0004-3702(00)00081-3 1815489 (Pubitemid 32196231)
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
38. A Hertz D de Werra 1987 Using tabu search techniques for graph coloring Computing 39 345 351 0626.68051 10.1007/BF02239976 923459
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
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
41. DS Johnson CR Aragon LA McGeoch C Schevon 1991 Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning Oper Res 39 3 378 406 0739.90055 10.1287/opre.39.3.378
42. Johnson DS, Trick MA (eds) (1996) Cliques, coloring, and satisfiability: second DIMACS implementation challenge. Am Math Soc, Providence
43. DE Joslin DP Clements 1999 "Squeaky wheel" optimization J Artif Intell Res 10 353 373 0918.90120 1720091
44. S Khanna N Linial S Safra 2000 On the hardness of approximating the chromatic number Combinatorica 20 3 393 415 0964.68065 10.1007/s004930070013 1774844
45. Kirovski D (1998) Efficient coloring of a large spectrum of graphs. In: Design automation conference, San Francisco, CA, USA, pp 427-432
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
47. J Liu J Han YY Tang 2002 Multi-agent oriented constraint satisfaction Artif Intell 136 1 101 144 0984.68141 10.1016/S0004-3702(01)00174-6 1891586 (Pubitemid 34154698)
48. Liu J, Jin X, Tsui K-C (2005) Autonomy Oriented Computing (AOC): From problem solving to complex systems modeling. Kluwer Academic, Dordrecht
49. J Liu K-C Tsui 2006 Toward nature-inspired computing Commun ACM 49 10 59 64 10.1145/1164394.1164395 (Pubitemid 44536636)
50. A Mehrotra M Trick 1996 A column generation approach for graph coloring INFORMS J Comput 8 4 344 354 0884.90144 10.1287/ijoc.8.4.344
51. P Merz B Freisleben 2000 Fitness landscape analysis and memetic algorithms for the quadratic assignment problem IEEE Trans Evol Comput 4 4 337 352 10.1109/4235.887234 (Pubitemid 32075186)
52. M Mezard M Palassini O Rivoire 2005 Landscape of solutions in constraint satisfaction problems Phys Rev Lett 95 20 200202 10.1103/PhysRevLett.95.200202
53. Morgenstern C (1996) Distributed coloration neighborhood search. In: Cliques, coloring, and satisfiability: second DIMACS implementation challenge. Am Math Soc, Providence, pp 335-358
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
55. Newell A, Simon HA (1972) Human problem solving. Prentice-Hall, Englewood Cliffs
56. E Nowicki 1996 A fast tabu search algorithm for the permutation flow shop problem Eur J Oper Res 91 160 175 0947.90590 10.1016/0377-2217(95)00037-2 (Pubitemid 126369642)
57. CR Reeves T Yamada 1998 Genetic algorithms, path relinking, and the flowshop sequencing problem Evol Comput 6 1 45 60 10.1162/evco.1998.6.1.45
58. CM Reidys PF Stadler 2002 Combinatorial landscapes SIAM Rev 44 1 3 54 0996.92026 10.1137/S0036144501395952 1924545
59. D Schuurmans F Southey 2001 Local search characteristics of incomplete SAT procedures Artif Intell 132 2 121 150 0983.68180 10.1016/S0004-3702(01) 00151-5 1863601 (Pubitemid 32951238)
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
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
62. MD Smith N Ramsey G Holloway 2004 A generalized algorithm for graph-coloring register allocation ACM SIGPLAN Not 39 6 277 288 10.1145/996893.996875
63. P Stone M Veloso 2000 Multiagent systems: a survey from a machine learning perspective Auton Robots 8 3 345 383 10.1023/A:1008942012299 (Pubitemid 30904138)
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
65. Walsh T (2001) Search on high degree graphs. In: International joint conference on artificial intelligence, Seattle, Washington, USA, pp 266-274
66. D Weyns T Holvoet 2005 On the role of environments in multiagent systems Informatica 29 409 421
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
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
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
70. W Zhang 2004 Configuration landscape analysis and backbone guided local search Artif Intell 158 1 1 26 1085.68678 10.1016/j.artint.2004.04.001