Skip to main content

Advertisement

Springer Nature Link
Log in

A new memetic algorithm based on cellular learning automata for solving the vertex coloring problem

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

Vertex coloring problem is a combinatorial optimization problem in graph theory in which a color is assigned to each vertex of graph such that no two adjacent vertices have the same color. In this paper a new hybrid algorithm which is obtained from combination of cellular learning automata (CLA) and memetic algorithm (MA) is proposed for solving the vertex coloring problem. CLA is an effective probabilistic learning model combining cellular automata and learning automaton (LA). Irregular CLA (ICLA) is a generalization of CLA in which the restriction of rectangular grid structure in CLA is removed. The proposed algorithm is based on the irregular open CLA (IOCLA) that is an extension of ICLA in which the evolution of CLA is influenced by both local and global environments. Similar to other IOCLA-based algorithms, in the proposed algorithm, local environment is constituted by neighboring LAs of any cell and the global environment consists of a pool of memes in which each meme corresponds to a certain local search method. Each meme is represented by a set of LAs from which the history of the corresponding local search method can be extracted. To show the superiority of the proposed algorithm over some well-known algorithms, several computer experiments have been conducted. The results show that the proposed algorithm performs better than other methods in terms of running time of algorithm and the required number of colors.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Lewis R, Paechter B (2007) Finding feasible timetables using group-based operators. IEEE Trans Evol Comput 11:397–413

    Article  Google Scholar 

  2. Barnier N, Brisset P (2004) Graph coloring for air traffic flow management. Ann Oper Res 130:163–178

    Article  MathSciNet  MATH  Google Scholar 

  3. Chaitin GJ, Auslander MA, Chandra AK, Cocke J, Hopkins ME, Markstein PW (1981) Register allocation via coloring. Comput Lang 6:47–57

    Article  Google Scholar 

  4. Leighton FT (1979) A graph coloring algorithm for large scheduling problems. J Res Natl Bureau Standards 84:489–506

    Article  MathSciNet  MATH  Google Scholar 

  5. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85–103

  6. Narendra KS, Thathachar MAL (1989) Learning automata: an introduction. Prentice-Hall, New York

    MATH  Google Scholar 

  7. Thathachar MAL, Sastry PS (2002) Varieties of learning automata: an overview. IEEE Trans Syst Man Cybern Part B Cybern 32:711–722

    Article  Google Scholar 

  8. Caramia M, Dell’Olmo P (2008) Embedding a novel objective function in a two-phased local search for robust vertex coloring. Eur J Oper Res 189:1358–1380

    Article  MathSciNet  MATH  Google Scholar 

  9. Galinier P, Hertz A, Zufferey N (2008) An adaptive memory algorithm for the k-coloring problem. Discrete Appl Math 156:267–279

    Article  MathSciNet  MATH  Google Scholar 

  10. Lourenço HR, Martin O, Stutzle T, Glover F, Kochenberger G (2002) Iterated local search. In: Handbook of Metaheuristics, pp 321–353

  11. Caramia M, Dell’Olmo P, Italiano GF (2006) CHECKCOL: improved local search for graph coloring. J Discrete Algorit 4:277–298

    Article  MathSciNet  MATH  Google Scholar 

  12. Chiarandini M, Dumitrescu I, Stützle T (2007) Stochastic local search algorithms for the graph colouring problem. In: Handbook of approximation algorithms and metaheuristics, pp 1–63

  13. Akbari Torkestani J, Meybodi MR (2011) A cellular learning automata-based algorithm for solving the vertex coloring problem. Expert Syst Appl 38:9237–9247

    Article  Google Scholar 

  14. Lawler EL (1976) A note on the complexity of the chromatic number problem. Inf Process Lett 5:66–67

    Article  MathSciNet  MATH  Google Scholar 

  15. Jesper Makholm B (2004) Exact algorithms for graph colouring and exact satisfiability. Oper Res Lett 32:547–556

  16. Beigel R, Eppstein D (2005) 3-coloring in time O (n1. 3289). J Algorit 54:168–204

    Article  MATH  Google Scholar 

  17. Byskov JM (2004) Enumerating maximal independent sets with applications to graph colouring. Oper Res Lett 32:547–556

    Article  MathSciNet  MATH  Google Scholar 

  18. Rezapoor M, Meybodi MR (2013) LA-MA: a new memetic model based on learning automata. In: Proceeding of 18th national conference of Computer Society of Iran, Tehran, Iran, pp 1–16

  19. Hertz A, de Werra D (1987) Using tabu search techniques for graph coloring. Computing 39:345–351

    Article  MathSciNet  MATH  Google Scholar 

  20. Fleurent C, Ferland JA (1996) Genetic and hybrid algorithms for graph coloring. Ann Oper Res 63:437–461

    Article  MATH  Google Scholar 

  21. el Dorne R, Hao J (1998) A new genetic local search algorithm for graph coloring

  22. Galinier P, Hao J-K (1999) Hybrid evolutionary algorithms for graph coloring. J Combin Optim 3:379–397

    Article  MathSciNet  MATH  Google Scholar 

  23. Oommen B, Hansen E (1984) The asymptotic optimality of discretized linear reward-inaction learning automata. IEEE Trans Syst Man Cybernet 14:542–545

    Article  MathSciNet  MATH  Google Scholar 

  24. Johnoommen B (1986) Absorbing and ergodic discretized two-action learning automata. IEEE Trans Syst Man Cybernet 16:282–293

    Article  MathSciNet  Google Scholar 

  25. Akbari Torkestani J, Meybodi MR (2010) Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs. Int J Uncertain Fuzziness Knowl Based Syst 18:721–758

    Article  MathSciNet  MATH  Google Scholar 

  26. Akbari J (2012) An adaptive focused web crawling algorithm based on learning automata. Appl Intell 37:586–601

    Article  Google Scholar 

  27. Akbari Torkestani J, Meybodi MR (2010) An efficient cluster-based CDMA/TDMA scheme for wireless mobile ad-hoc networks: a learning automata approach. J Netw Comput Appl 33:477–490

    Article  Google Scholar 

  28. Akbari Torkestani J, Meybodi MR (2010) Mobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: a learning automata approach. Comput Commun 33:721–735

    Article  MATH  Google Scholar 

  29. Akbari Torkestani J, Meybodi MR (2010) An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata. Comput Netw 54:826–843

    Article  MATH  Google Scholar 

  30. Jahanshahi M, Dehghan M, Meybodi M (2013) LAMR: learning automata based multicast routing protocol for multi-channel multi-radio wireless mesh networks. Appl Intell 38:58–77

    Article  Google Scholar 

  31. Meybodi MR (1983) Learning automata and its application to priority assignment in a queueing system with unknown characteristics. Ph.D. thesis, Departement of Electrical Engineering and Computer Science. University of Oklahoma, Norman

  32. Tsetlin ML (1973) Automaton theory and modeling of biological systems, vol 102. Academic Press, New York

    MATH  Google Scholar 

  33. Hashim A, Amir S, Mars P (1986) Application of learning automata to data compression. In: Adaptive and learning systems, pp 229–234

  34. Manjunath B, Chellappa R (1988) Stochastic learning networks for texture segmentation. In: Twenty-second asilomar conference on signals, systems and computers, pp 511–516

  35. Oommen BJ, Hansen E (1987) List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations. SIAM J Comput 16:705–716

    Article  MathSciNet  MATH  Google Scholar 

  36. Oommen BJ, Ma DCY (1988) Deterministic learning automata solutions to the equipartitioning problem. IEEE Trans Comput 37:2–13

    Article  MathSciNet  MATH  Google Scholar 

  37. Frost GP (1998) Stochastic optimisation of vehicle suspension control systems via learning automata. Ph.D. Thesis, Department of Aeronautical and Automotive Engineering. Loughborough University, Loughborough

  38. Howell M, Frost G, Gordon T, Wu Q (1997) Continuous action reinforcement learning applied to vehicle suspension control. Mechatronics 7:263–276

    Article  Google Scholar 

  39. Unsal C, Kachroo P, Bay JS (1999) Multiple stochastic learning automata for vehicle path control in an automated highway system. IEEE Trans Syst Man Cybernet Part A Syst Humans 29:120–128

    Article  Google Scholar 

  40. Beigy H, Meybodi MR (2009) A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks. Int J Syst Sci 40:101–118

    Article  MATH  Google Scholar 

  41. Meybodi MR, Beigy H (2001) Neural network engineering using learning automata: determining of desired size of three layer feed forward neural networks. J Faculty Eng 34:1–26

    Google Scholar 

  42. Oommen BJ, Croix DS (1997) String taxonomy using learning automata. IEEE Trans Syst Man Cybern Part B Cybern 27:354–365

    Article  Google Scholar 

  43. Barto AG, Jordan MI (1987) Gradient following without back-propagation in layered networks. In: 1st International Conference Neural Nets, San Diego

  44. Thathachar M, Phansalkar VV (1995) Learning the global maximum with parameterized learning automata. IEEE Trans Neural Netw 6:398–406

    Article  Google Scholar 

  45. Galinier P, Hertz A (2006) A survey of local search methods for graph coloring. Comput Oper Res 33:2547–2562

    Article  MathSciNet  MATH  Google Scholar 

  46. Rezapoor M, Meybodi MR (2014) A new criteria for creating balance between local and global search in memetic algorithms. Iranian J Electr Comput Eng (IJECE) 12:31–37

  47. 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:378–406

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Information Technology, Amirkabir University of Technology, Tehran, Iran

    Mehdi Rezapoor Mirsaleh & Mohammad Reza Meybodi

Authors
  1. Mehdi Rezapoor Mirsaleh
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Mohammad Reza Meybodi
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Mohammad Reza Meybodi.

Appendix

Appendix

The notations used in the proposed algorithm are listed in Table 9.

Table 9 Notations used in the proposed algorithm
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rezapoor Mirsaleh, M., Meybodi, M.R. A new memetic algorithm based on cellular learning automata for solving the vertex coloring problem. Memetic Comp. 8, 211–222 (2016). https://doi.org/10.1007/s12293-016-0183-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-016-0183-4

Keywords