{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:07:13Z","timestamp":1761808033655},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T00:00:00Z","timestamp":1459209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s12293-016-0183-4","type":"journal-article","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T22:24:24Z","timestamp":1459290264000},"page":"211-222","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A new memetic algorithm based on cellular learning automata for solving the vertex coloring problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Mehdi","family":"Rezapoor Mirsaleh","sequence":"first","affiliation":[]},{"given":"Mohammad Reza","family":"Meybodi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,29]]},"reference":[{"key":"183_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TEVC.2006.885162","volume":"11","author":"R Lewis","year":"2007","unstructured":"Lewis R, Paechter B (2007) Finding feasible timetables using group-based operators. IEEE Trans Evol Comput 11:397\u2013413","journal-title":"IEEE Trans Evol Comput"},{"key":"183_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/B:ANOR.0000032574.01332.98","volume":"130","author":"N Barnier","year":"2004","unstructured":"Barnier N, Brisset P (2004) Graph coloring for air traffic flow management. Ann Oper Res 130:163\u2013178","journal-title":"Ann Oper Res"},{"key":"183_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"GJ Chaitin","year":"1981","unstructured":"Chaitin GJ, Auslander MA, Chandra AK, Cocke J, Hopkins ME, Markstein PW (1981) Register allocation via coloring. Comput Lang 6:47\u201357","journal-title":"Comput Lang"},{"key":"183_CR4","doi-asserted-by":"publisher","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"Leighton FT (1979) A graph coloring algorithm for large scheduling problems. J Res Natl Bureau Standards 84:489\u2013506","journal-title":"J Res Natl Bureau Standards"},{"key":"183_CR5","doi-asserted-by":"publisher","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"183_CR6","volume-title":"Learning automata: an introduction","author":"KS Narendra","year":"1989","unstructured":"Narendra KS, Thathachar MAL (1989) Learning automata: an introduction. Prentice-Hall, New York"},{"key":"183_CR7","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/TSMCB.2002.1049606","volume":"32","author":"MAL Thathachar","year":"2002","unstructured":"Thathachar MAL, Sastry PS (2002) Varieties of learning automata: an overview. IEEE Trans Syst Man Cybern Part B Cybern 32:711\u2013722","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"183_CR8","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1016\/j.ejor.2007.01.063","volume":"189","author":"M Caramia","year":"2008","unstructured":"Caramia M, Dell\u2019Olmo P (2008) Embedding a novel objective function in a two-phased local search for robust vertex coloring. Eur J Oper Res 189:1358\u20131380","journal-title":"Eur J Oper Res"},{"key":"183_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.dam.2006.07.017","volume":"156","author":"P Galinier","year":"2008","unstructured":"Galinier P, Hertz A, Zufferey N (2008) An adaptive memory algorithm for the k-coloring problem. Discrete Appl Math 156:267\u2013279","journal-title":"Discrete Appl Math"},{"key":"183_CR10","unstructured":"Louren\u00e7o HR, Martin O, Stutzle T, Glover F, Kochenberger G (2002) Iterated local search. In: Handbook of Metaheuristics, pp 321\u2013353"},{"key":"183_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.jda.2005.03.006","volume":"4","author":"M Caramia","year":"2006","unstructured":"Caramia M, Dell\u2019Olmo P, Italiano GF (2006) CHECKCOL: improved local search for graph coloring. J Discrete Algorit 4:277\u2013298","journal-title":"J Discrete Algorit"},{"key":"183_CR12","unstructured":"Chiarandini M, Dumitrescu I, St\u00fctzle T (2007) Stochastic local search algorithms for the graph colouring problem. In: Handbook of approximation algorithms and metaheuristics, pp 1\u201363"},{"key":"183_CR13","doi-asserted-by":"publisher","first-page":"9237","DOI":"10.1016\/j.eswa.2011.01.098","volume":"38","author":"J Akbari Torkestani","year":"2011","unstructured":"Akbari Torkestani J, Meybodi MR (2011) A cellular learning automata-based algorithm for solving the vertex coloring problem. Expert Syst Appl 38:9237\u20139247","journal-title":"Expert Syst Appl"},{"key":"183_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"EL Lawler","year":"1976","unstructured":"Lawler EL (1976) A note on the complexity of the chromatic number problem. Inf Process Lett 5:66\u201367","journal-title":"Inf Process Lett"},{"key":"183_CR15","unstructured":"Jesper Makholm B (2004) Exact algorithms for graph colouring and exact satisfiability. Oper Res Lett 32:547\u2013556"},{"key":"183_CR16","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.jalgor.2004.06.008","volume":"54","author":"R Beigel","year":"2005","unstructured":"Beigel R, Eppstein D (2005) 3-coloring in time O (n1. 3289). J Algorit 54:168\u2013204","journal-title":"J Algorit"},{"key":"183_CR17","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"JM Byskov","year":"2004","unstructured":"Byskov JM (2004) Enumerating maximal independent sets with applications to graph colouring. Oper Res Lett 32:547\u2013556","journal-title":"Oper Res Lett"},{"key":"183_CR18","unstructured":"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\u201316"},{"key":"183_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A Hertz","year":"1987","unstructured":"Hertz A, de Werra D (1987) Using tabu search techniques for graph coloring. Computing 39:345\u2013351","journal-title":"Computing"},{"key":"183_CR20","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C Fleurent","year":"1996","unstructured":"Fleurent C, Ferland JA (1996) Genetic and hybrid algorithms for graph coloring. Ann Oper Res 63:437\u2013461","journal-title":"Ann Oper Res"},{"key":"183_CR21","doi-asserted-by":"crossref","unstructured":"el Dorne R, Hao J (1998) A new genetic local search algorithm for graph coloring","DOI":"10.1007\/BFb0056916"},{"key":"183_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P Galinier","year":"1999","unstructured":"Galinier P, Hao J-K (1999) Hybrid evolutionary algorithms for graph coloring. J Combin Optim 3:379\u2013397","journal-title":"J Combin Optim"},{"key":"183_CR23","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1109\/TSMC.1984.6313256","volume":"14","author":"B Oommen","year":"1984","unstructured":"Oommen B, Hansen E (1984) The asymptotic optimality of discretized linear reward-inaction learning automata. IEEE Trans Syst Man Cybernet 14:542\u2013545","journal-title":"IEEE Trans Syst Man Cybernet"},{"key":"183_CR24","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1109\/TSMC.1986.4308951","volume":"16","author":"B Johnoommen","year":"1986","unstructured":"Johnoommen B (1986) Absorbing and ergodic discretized two-action learning automata. IEEE Trans Syst Man Cybernet 16:282\u2013293","journal-title":"IEEE Trans Syst Man Cybernet"},{"key":"183_CR25","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1142\/S0218488510006775","volume":"18","author":"J Akbari Torkestani","year":"2010","unstructured":"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\u2013758","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"key":"183_CR26","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/s10489-012-0351-2","volume":"37","author":"J Akbari","year":"2012","unstructured":"Akbari J (2012) An adaptive focused web crawling algorithm based on learning automata. Appl Intell 37:586\u2013601","journal-title":"Appl Intell"},{"key":"183_CR27","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.jnca.2010.01.004","volume":"33","author":"J Akbari Torkestani","year":"2010","unstructured":"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\u2013490","journal-title":"J Netw Comput Appl"},{"key":"183_CR28","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.comcom.2009.11.019","volume":"33","author":"J Akbari Torkestani","year":"2010","unstructured":"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\u2013735","journal-title":"Comput Commun"},{"key":"183_CR29","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1016\/j.comnet.2009.10.007","volume":"54","author":"J Akbari Torkestani","year":"2010","unstructured":"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\u2013843","journal-title":"Comput Netw"},{"key":"183_CR30","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10489-012-0357-9","volume":"38","author":"M Jahanshahi","year":"2013","unstructured":"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\u201377","journal-title":"Appl Intell"},{"key":"183_CR31","unstructured":"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"},{"key":"183_CR32","volume-title":"Automaton theory and modeling of biological systems","author":"ML Tsetlin","year":"1973","unstructured":"Tsetlin ML (1973) Automaton theory and modeling of biological systems, vol 102. Academic Press, New York"},{"key":"183_CR33","doi-asserted-by":"publisher","unstructured":"Hashim A, Amir S, Mars P (1986) Application of learning automata to data compression. In: Adaptive and learning systems, pp 229\u2013234","DOI":"10.1007\/978-1-4757-1895-9_15"},{"key":"183_CR34","doi-asserted-by":"publisher","unstructured":"Manjunath B, Chellappa R (1988) Stochastic learning networks for texture segmentation. In: Twenty-second asilomar conference on signals, systems and computers, pp 511\u2013516","DOI":"10.1109\/ACSSC.1988.754595"},{"key":"183_CR35","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1137\/0216047","volume":"16","author":"BJ Oommen","year":"1987","unstructured":"Oommen BJ, Hansen E (1987) List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations. SIAM J Comput 16:705\u2013716","journal-title":"SIAM J Comput"},{"key":"183_CR36","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/12.75146","volume":"37","author":"BJ Oommen","year":"1988","unstructured":"Oommen BJ, Ma DCY (1988) Deterministic learning automata solutions to the equipartitioning problem. IEEE Trans Comput 37:2\u201313","journal-title":"IEEE Trans Comput"},{"key":"183_CR37","unstructured":"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"},{"key":"183_CR38","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0957-4158(97)00003-2","volume":"7","author":"M Howell","year":"1997","unstructured":"Howell M, Frost G, Gordon T, Wu Q (1997) Continuous action reinforcement learning applied to vehicle suspension control. Mechatronics 7:263\u2013276","journal-title":"Mechatronics"},{"key":"183_CR39","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/3468.736368","volume":"29","author":"C Unsal","year":"1999","unstructured":"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\u2013128","journal-title":"IEEE Trans Syst Man Cybernet Part A Syst Humans"},{"key":"183_CR40","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1080\/00207720802145924","volume":"40","author":"H Beigy","year":"2009","unstructured":"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\u2013118","journal-title":"Int J Syst Sci"},{"key":"183_CR41","first-page":"1","volume":"34","author":"MR Meybodi","year":"2001","unstructured":"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\u201326","journal-title":"J Faculty Eng"},{"key":"183_CR42","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/3477.558849","volume":"27","author":"BJ Oommen","year":"1997","unstructured":"Oommen BJ, Croix DS (1997) String taxonomy using learning automata. IEEE Trans Syst Man Cybern Part B Cybern 27:354\u2013365","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"183_CR43","unstructured":"Barto AG, Jordan MI (1987) Gradient following without back-propagation in layered networks. In: 1st International Conference Neural Nets, San Diego"},{"key":"183_CR44","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/72.363475","volume":"6","author":"M Thathachar","year":"1995","unstructured":"Thathachar M, Phansalkar VV (1995) Learning the global maximum with parameterized learning automata. IEEE Trans Neural Netw 6:398\u2013406","journal-title":"IEEE Trans Neural Netw"},{"key":"183_CR45","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P Galinier","year":"2006","unstructured":"Galinier P, Hertz A (2006) A survey of local search methods for graph coloring. Comput Oper Res 33:2547\u20132562","journal-title":"Comput Oper Res"},{"key":"183_CR46","unstructured":"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\u201337"},{"key":"183_CR47","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"DS Johnson","year":"1991","unstructured":"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\u2013406","journal-title":"Oper Res"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-016-0183-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-016-0183-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-016-0183-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-016-0183-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T02:33:55Z","timestamp":1567737235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-016-0183-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,29]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["183"],"URL":"https:\/\/doi.org\/10.1007\/s12293-016-0183-4","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,29]]}}}