A cellular learning automata-based algorithm for solving the vertex coloring problem

Expert Systems with Applications

Volumn 38, Issue 8, 2011, Pages 9237-9247

  Akbari Torkestani, Javad ^a   Meybodi, Mohammad Reza ^b,c  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^c INSTITUTE FOR STUDIES IN THEORETICAL PHYSICS AND MATHEMATICS IPM   (Iran)

Author keywords

Cellular learning automata; Learning automata; Vertex coloring problem

Indexed keywords

ADJACENT VERTICES; ARBITRARY GRAPHS; CELLULAR LEARNING AUTOMATA; COLORING ALGORITHMS; COMBINATORIAL OPTIMIZATION PROBLEMS; DISTRIBUTED ALGORITHM; EXISTING METHOD; LEARNING AUTOMATA; NEAR-OPTIMAL SOLUTIONS; OPTIMAL SOLUTIONS; PROBABILISTIC LEARNING; RECTANGULAR GRIDS; RUNNING TIME; SIMULATION EXPERIMENTS; TIME COMPLEXITY; VERTEX COLORING PROBLEM; VERTEX COLORING PROBLEMS;

ALGORITHMS; CELLULAR AUTOMATA; COLOR; COLORING; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; OPTIMAL SYSTEMS; PATTERN RECOGNITION SYSTEMS;

AUTOMATA THEORY;

EID: 79953712593     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2011.01.098     Document Type: Article

References (72)

1. Akbari Torkestani, J.; & Meybodi, M. R. (in press-a). A learning automata-based cognitive radio for clustered wireless ad-hoc networks. Journal of Network and Systems Management.
2. Akbari Torkestani, J.; & Meybodi, M. R. (in press-b). A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs. Journal of Supercomputing.
3. Akbari Torkestani, J.; & Meybodi, M. R. (in press-c). Weighted steiner connected dominating set and its application to multicast routing in wireless MANETs. Wireless Personal Communications.
4. Akbari Torkestani, J.; & Meybodi, M. R. (in press-d). A mobility-based cluster formation algorithm for wireless mobile ad Hoc networks. Journal of Cluster Computing.
5. J. Akbari Torkestani, and M.R. Meybodi Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs International Journal of Uncertainty, Fuzziness and Knowledge-based Systems 18 6 2010 721 758
6. J. Akbari Torkestani, and M.R. Meybodi Mobility-based multicast routing algorithm in wireless mobile ad hoc networks: A learning automata approach Journal of Computer Communications 33 2010 721 735
7. J. Akbari Torkestani, and M.R. Meybodi A new vertex coloring algorithm based on variable action-set learning automata Journal of Computing and Informatics 29 3 2010 1001 1020
8. J. Akbari Torkestani, and M.R. Meybodi An efficient cluster-based CDMA/TDMA scheme for wireless mobile ad-hoc networks: A learning automata approach Journal of Network and Computer applications 33 2010 477 490
9. J. Akbari Torkestani, and M.R. Meybodi Clustering the wireless ad-hoc networks: A distributed learning automata approach Journal of Parallel and Distributed Computing 70 2010 394 405
10. J. Akbari Torkestani, and M.R. Meybodi An intelligent backbone formation algorithm in wireless ad hoc networks based on distributed learning automata Journal of Computer Networks 54 2010 826 843
11. H. Asmuni, E.K. Burke, J.M. Garibaldi, B. McCollum, and A.J. Parkes An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables Computers & Operations Research 36 2009 981 1001
12. Barnier, N.; & Brisset, P.; (2002). Graph coloring for air traffic flow management. In Proceedings of the fourth international workshop on integration of AI and OR techniques (pp. 133-147). France: Le Croisic.
13. R. Beigel, and D. Eppstein 3-coloring in time Journal of Algorithms 54 2005 168 204
14. H. Beigy, and M.R. Meybodi A self-organizing channel assignment algorithm: A cellular learning automata approach Springer-verlag lecture notes in computer science Vol. 2690 2003 Springer-Verlag 119 126 (Pubitemid 36996080)
15. H. Beigy, and M.R. Meybodi Open synchronous cellular learning automata Advances in Complex Systems 10 4 2007 527 556
16. I. Blchliger, and N. Zufferey A graph coloring heuristic using partial solutions and a reactive tabu scheme Computers & Operations Research 35 2008 960 975 (Pubitemid 47368857)
17. D. Brelaz New methods to color the vertices of a graph Communications of the ACM 22 4 1979 252 256
18. T.N. Bui, T.H. Nguyen, C.M. Patel, and K.T. Phan An ant-based algorithm for coloring graph Discrete Applied Mathematics 156 2008 190 200
19. J.M. Byskov Enumerating maximal independent sets with applications to graph coloring Operations Research Letters 32 2004 547 556
20. Byskov, J. M.; (2005). Exact algorithms for graph coloring and exact satisfiability, PhD thesis, University of Aarhus, Aarhus, Denmark.
21. M. Caramia, and P. Dell'Olmo A fast and simple local search for graph coloring Lecture Notes in Computer Science, Algorithm Engineering 1618 1999 319 333
22. M. Caramia, and P. Dell'Olmo Embedding a novel objective function in a two-phased local search for robust vertex coloring European Journal of Operational Research 189 2008 1358 1380 (Pubitemid 351400572)
23. M. Caramia, and P. Dellolmo Coloring graphs by iterated local search traversing feasible and infeasible solutions Discrete Applied Mathematics 156 2008 201 217 (Pubitemid 350251595)
24. M. Caramia, P. Dellolmo, and G.F. Italiano CHECKCOL: Improved local search for graph coloring Journal of Discrete Algorithms 4 2006 277 298 (Pubitemid 44275103)
25. M. Carter, G. Laporte, and S. Lee Examination timetabling: Algorithmic strategies and applications Journal of the Operational Research Society 47 1996 373 383 (Pubitemid 126576128)
26. G.J. Chaitin, M.A. Auslander, A.K. Chandra, J. Cocke, M.E. Hopkins, and P.W. Markstein Register allocation via coloring Computer Languages 6 1981 47 57
27. M. Chams, A. Hertz, and D. de Werra Some experiments with simulated annealing for coloring graphs European Journal of Operational Research 32 1987 260 266 (Pubitemid 18516642)
28. M. Chiarandin, and T. Stutzle Stochastic local search algorithms for graph set T-coloring and frequency assignment Constraints 12 3 2007 371 403 (Pubitemid 47115409)
29. C. Cooper, M. Dyer, and A. Frieze On Markov chains for randomly H-coloring a graph Journal of Algorithms 39 2001 117 134 (Pubitemid 33666060)
30. D. de Werra An introduction to timetabling European Journal of Operational Research 19 1985 151 162
31. S. Dobrev, H. Schröder, O. Sykora, and I. Vrto Evolutionary graph coloring Information Processing Letters 76 2000 91 94
32. Dorne, R.; & Hao, J. K.; (1998). A new genetic local search algorithm for graph coloring. Lecture Notes in Computer Science (Vol. 1498). Germany, pp. 745-754. (Pubitemid 128146004)
33. K.A. Dowsland, and J.M. Thompson An improved ant colony optimization heuristic for graph coloring Discrete Applied Mathematics 156 2008 313 324
34. A.E. Eiben, J.K. Vanderhauw, and J.I. Vanhemert Graph coloring with adaptive evolutionary algorithms Journal of Heuristics 4 1998 25 46 (Pubitemid 128512786)
35. Enami Eraghi, A.; Akbari Torkestani, J.; & Meybodi, M. R.; (2009). Solving the bandwidth multicoloring problem: A cellular learning automata approach. In International IACSIT conference on machine learning and computing (IACSIT ICMLC 2009). Perth, Australia.
36. Enami Eraghi, A.; Akbari Torkestani, J.; & Meybodi, M. R.; (2009). Cellular learning automata-based graph coloring problem. In International IACSIT conference on machine learning and computing (IACSIT ICMLC 2009). Perth, Australia.
37. M. Esnaashari, and M.R. Meybodi A cellular learning automata based clustering algorithm for wireless sensor networks Sensor Letters 6 5 2008 723 735
38. C. Fleurent, and J.A. Ferland Genetic and hybrid algorithms for graph coloring Annals of Operations Research 63 1996 437 461 (Pubitemid 126729251)
39. E. Fredkin Digital machine: A informational process based on reversible cellular automata Physica D45 1990 245 270
40. P. Galindier, and J.K. HAO Hybrid evolutionary algorithms for graph coloring Journal of Combinatorial Optimization 3 1999 379 397
41. Galinier, P.; & Hao, J. K.; (1997). Tabu search for maximal constraint satisfaction problems. In Proceedings of the third international conference on principles and practice of constraint programming (CP'97) (pp. 196-208). Lecture Notes in Computer Science, Vol. 1330. Germany. (Pubitemid 127147355)
42. P. Galinier, and A. Hertz A survey of local search methods for graph coloring Computers & Operations Research 33 2006 2547 2562 (Pubitemid 43098900)
43. P. Galinier, A. Hertz, and N. Zufferey An adaptive memory algorithm for the K-coloring problem Discrete Applied Mathematics 156 2008 267 279 (Pubitemid 350251597)
44. A. Gamst Some lower bounds for a class of frequency assignment problems IEEE Transactions of Vehicular Technology 35 1 1986 8 14 (Pubitemid 16614221)
45. M.R. Garey, and D.S. Johnson Computers and intractability: A guide to the theory of NP-completeness 1979 W.H. Freeman and Co. San Francisco, CA
46. C. Glass, and A. Prügel-Bennett Genetic algorithm for graph coloring: Exploration of Galinier and Hao's Algorithm Journal of Combinatorial Optimization 7 2003 229 236
47. A. Hertz, and D. Werra Using tabu search techniques for graph coloring Computing 39 1987 345 351 (Pubitemid 18562739)
48. D.R. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon Optimization by simulated annealing: An experimental evaluation, part II, graph coloring and number partitioning Operations Research 39 1991 378 406
49. J. Kari Reversibility of 2D cellular automata is undecidable Physica D45 1990 379 385
50. R.M. Karp Reducibility among combinatorial problems complexity of computer computations 1972 Plenum Press USA pp. 85-103
51. E. Lawler A note on the complexity of the chromatic number problem Information Processing Letters 5 1976 66 67
52. F.T. Leighton A graph coloring algorithm for large scheduling problems Journal of Research of the National Bureau of Standards 84 6 1979 489 506
53. R. Lewis, and B. Paechter Finding feasible timetables using group based operators IEEE Transactions on Evolutionary Computation 11 3 2007 397 413 (Pubitemid 46895415)
54. H.R. Lourenco, O. Martin, and T. Stutzle Iterated local search F. Glover, G. Kochenberger, Handbook of metaheuristics 2002 Kluwer Academic Publishers USA 321 353
55. B.B. Mabrouk, H. Hasni, and Z. Mahjoub On a parallel genetic-tabu search based algorithm for solving the graph coloring problem European Journal of Operational Research 2008 10.1016/j.ejor.2008.03.050
56. E. Malaguti, and P. Toth An evolutionary approach for bandwidth multi coloring problems European Journal of Operational Research 189 2008 638 651 (Pubitemid 351400541)
57. Meybodi, M. R.; & Khojasteh, M. R.; (2001). Application of cellular learning automata in modelling of commerce networks. In Proceedings of 6th annual international computer society of iran computer conference CSICC-2001 (pp. 284-295). Isfehan, Iran.
58. Meybodi, M. R.; & Mehdipour, F.; (2003). VLSI placement using cellular learning automata. In Proceedings of 8th annual international computer society of iran computer conference CSICC-2001 (pp. 195-203). Mashad, Iran.
59. Meybodi, M. R.; & Taherkhani, M.; (2001). Application of cellular learning automata in modeling of rumor diffusion. In Proceedings of 9th conference on electrical engineering, power and water institute of technology (pp. 102-110), Tehran, Iran.
60. M.R. Meybodi, and H. Beigy A mathematical framework for cellular learning automata Journal of Advances in Complex Systems 7 3-4 2004 295 320
61. Meybodi, M. R.; Beigy, H.; & Taherkhani, M.; (2000). Application of cellular learning automata to image processing. In Proceedings of first conference in mathematics and communication, iranian telecommunication research center (pp. 23.1-23.10). Tehran, Iran.
62. Mitchell, M.; (1996). Computation in cellular automata: A selected review, Technical report, Santa Fe Institute, Santa Fe, NM, USA.
63. S. Munoz, M.T. Ortuno, J. Ramirez, and J. Yanez Coloring fuzzy graphs Omega 33 2005 211 221 (Pubitemid 40030615)
64. K.S. Narendra, and K.S. Thathachar Learning automata: An introduction 1989 Printice-Hall New York
65. N.H. Packard, and S. Wolfram Two dimensional cellular automata Journal of Statistical Physics 38 1985 901 946
66. S. Prestwich Generalized graph coloring by a hybrid of local search and constraint programming Discrete Applied Mathematics 156 2008 148 158 (Pubitemid 350251592)
67. P.M. Talavan, and J. Yanez The graph coloring problem: A neuronal network approach European Journal of Operational Research 191 2008 100 111
68. M.A.L. Thathachar, and P.S. Sastry A hierarchical system of learning automata that can learn the globally optimal path Information Science 42 1997 743 766
69. J. Thompson, and K. Dowsland A robust simulated annealing based examination timetabling system Computers & Operations Research 25 1998 637 648
70. C. Voudouris, and E.P.K. Tsang Guided local search F. Glover, Handbook of metaheuristics 2003 Kluwer Academic Publishers USA 185 218
71. T. Vredeveld, and J.K. Lenstra On local search for the generalized graph coloring problem Operations Research Letters 31 2003 28 34 (Pubitemid 35432902)
72. Zymolka, A. M. C. A.; Koster, & Wessaly, R.; (2003). Transparent optical network design with sparse wavelength conversion. In Proceedings of the 7th IFIP working conference on optical network design and modelling (pp. 61-80). Budapest, Hungary.