{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:05:21Z","timestamp":1761807921286},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,1,21]],"date-time":"2015-01-21T00:00:00Z","timestamp":1421798400000},"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":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10710-015-9241-9","type":"journal-article","created":{"date-parts":[[2015,1,20]],"date-time":"2015-01-20T09:33:41Z","timestamp":1421746421000},"page":"399-453","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A learning automata-based memetic algorithm"],"prefix":"10.1007","volume":"16","author":[{"given":"M.","family":"Rezapoor Mirsaleh","sequence":"first","affiliation":[]},{"given":"M. R.","family":"Meybodi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,21]]},"reference":[{"key":"9241_CR1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10710-009-9089-y","volume":"10","author":"M Weber","year":"2009","unstructured":"M. Weber, F. Neri, V. Tirronen, Distributed differential evolution with explorative\u2013exploitative population families. Genet. Progr. Evolvable Mach. 10, 343\u2013371 (2009)","journal-title":"Genet. Progr. Evolvable Mach."},{"key":"9241_CR2","unstructured":"K.W. Ku, M.-W. Mak, Empirical analysis of the factors that affect the Baldwin effect, in Parallel Problem Solving from Nature\u2014PPSN V (1998), pp. 481\u2013490"},{"key":"9241_CR3","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1002\/(SICI)1096-987X(19981115)19:14<1639::AID-JCC10>3.0.CO;2-B","volume":"19","author":"GM Morris","year":"1998","unstructured":"G.M. Morris, D.S. Goodsell, R.S. Halliday, R. Huey, W.E. Hart, R.K. Belew, A.J. Olson, Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function. J. Comput. Chem. 19, 1639\u20131662 (1998)","journal-title":"J. Comput. Chem."},{"key":"9241_CR4","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TEVC.2011.2132725","volume":"15","author":"C Xianshun","year":"2011","unstructured":"C. Xianshun, O. Yew-Soon, L. Meng-Hiot, T. Kay Chen, A multi-facet aurvey on memetic computation. IEEE Trans. Evol. Comput. 15, 591\u2013607 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9241_CR5","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"N. Krasnogor, J. Smith, A tutorial for competent memetic algorithms: model, taxonomy, and design issues. Evol. Comput. IEEE Trans. 9, 474\u2013488 (2005)","journal-title":"Evol. Comput. IEEE Trans."},{"key":"9241_CR6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1011953410319","volume":"2","author":"K Downing","year":"2001","unstructured":"K. Downing, Reinforced genetic programming. Genet. Progr. Evolvable Mach. 2, 259\u2013288 (2001)","journal-title":"Genet. Progr. Evolvable Mach."},{"key":"9241_CR7","volume-title":"Learning automata: an introduction","author":"KS Narendra","year":"1989","unstructured":"K.S. Narendra, M.A.L. Thathachar, Learning automata: an introduction (Prentice-Hall, Inc, Upper Saddle River, 1989)"},{"key":"9241_CR8","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1109\/TSMCB.2002.1049606","volume":"32","author":"MAL Thathachar","year":"2002","unstructured":"M.A.L. Thathachar, P.S. Sastry, Varieties of learning automata: an overview. IEEE Trans. Syst. Man Cybern. B Cybern. 32, 711\u2013722 (2002)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"key":"9241_CR9","unstructured":"M. Rezapoor, M.R. Meybodi, A hybrid algorithm for solving graph isomorphism problem, in Proceedings of the Second International Conference on Information and Knowledge Technology (IKT2005), Tehran, Iran (2005)"},{"key":"9241_CR10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/12.75146","volume":"37","author":"BJ Oommen","year":"1988","unstructured":"B.J. Oommen, D.C.Y. Ma, Deterministic learning automata solutions to the equipartitioning problem. IEEE Trans. Comput. 37, 2\u201313 (1988)","journal-title":"IEEE Trans. Comput."},{"key":"9241_CR11","unstructured":"M. Rezapoor, M.R. Meybodi, Improving GA+ LA algorithm for solving graph isomorphic problem, in Proceedings of the 11th Annual CSI Computer Conference of Iran, Tehran, Iran (2006), pp. 474\u2013483"},{"key":"9241_CR12","first-page":"28","volume":"1","author":"K Asghari","year":"2008","unstructured":"K. Asghari, A. Safari Mamaghani, F. Mahmoudi, M.R. Meybodi, A relational databases query optimization using hybrid evolutionary algorithm. J. Comput. Robot. 1, 28\u201339 (2008)","journal-title":"J. Comput. Robot."},{"key":"9241_CR13","unstructured":"K. Asghari, A. Safari Mamaghani, M.R. Meybodi, An evolutionary approach for query optimization problem in database, in Procceding of Internatinal Joint Conferance on Computers, Information and System Sciences, and Engineering (CISSE2007) (University of Bridgeport, England, 2007)"},{"key":"9241_CR14","unstructured":"A. Safari Mamaghani, K. Asghari, M.R. Meybodi, F. Mahmoodi, A new method based on genetic algorithm for minimizing join operations cost in data base, in Proceedings of 13th Annual CSI Computer Conference of Iran, Kish Island, Iran (2008)"},{"key":"9241_CR15","unstructured":"A. Safari Mamaghani, K. Asghari, F. Mahmoudi, and M. R. Meybodi, A novel hybrid algorithm for joint ordering problem in database queries, in Proceedings of 6th WSEAS international Conference on Computational Intelligence, Man-Machine Systems and Cybernetics, Tenerife, Spain (2007), pp. 104\u2013109"},{"key":"9241_CR16","unstructured":"B. Zaree, M. R. Meybodi, An evolutionary method for solving symmetric TSP, in Proceedings of the Third International Conference on Information and Knowledge Technology (IKT2007), Mashhad, Iran (2007)"},{"key":"9241_CR17","first-page":"394","volume":"2007","author":"B Zaree","year":"2007","unstructured":"B. Zaree, M.R. Meybodi, M. Abbaszadeh, A hybrid method for solving traveling salesman problem. IEEE\/ACIS International Conference on Computer and Information Science, ICIS 2007, 394\u2013399 (2007)","journal-title":"IEEE\/ACIS International Conference on Computer and Information Science, ICIS"},{"key":"9241_CR18","unstructured":"B. Zaree, K. Asghari, M.R. Meybodi, A hybrid method based on clustering for solving large traveling salesman problem, in Proceedings of 13th Annual CSI Computer Conference of Iran, Kish Island, Iran (2008)"},{"key":"9241_CR19","unstructured":"K. Asghari, M.R. Meybodi, Searching for Hamiltonian cycles in graphs using evolutionary methods, in Proceedings of the second Joint Congress on Fuzzy and Intelligent Systems, Tehran, Iran (2008)"},{"key":"9241_CR20","unstructured":"B. Zaree, M.R. Meybodi, A hybrid method for sorting problem, in Proceedings of the Third International Conference on Information and Knowledge Technology (IKT2007), Mashhad, Iran (2007)"},{"key":"9241_CR21","unstructured":"A. Safari Mamaghani, M.R. Meybodi, Hybrid algorithms (learning automata\u00a0+\u00a0genetic algorithm) for solving graph bandwidth minimization problem, in Proceedings of the second Joint Congress on Fuzzy and Intelligent Systems, Tehran, Iran (2008)"},{"key":"9241_CR22","doi-asserted-by":"crossref","unstructured":"A.S. Mamaghani, M.R. Meybodi, A learning automaton based approach to solve the graph bandwidth minimization problem, in International Conference on Application of Information and Communication Technologies (AICT) (2011), pp. 1\u20135","DOI":"10.1109\/ICAICT.2011.6110885"},{"key":"9241_CR23","first-page":"51","volume":"6","author":"A Isazadeh","year":"2012","unstructured":"A. Isazadeh, H. Izadkhah, A. Mokarram, A learning based evolutionary approach for minimization of matrix bandwidth problem. Appl. Math. 6, 51\u201357 (2012)","journal-title":"Appl. Math."},{"key":"9241_CR24","doi-asserted-by":"crossref","unstructured":"A.S. Mamaghani, M.R. Meybodi, Clustering of software systems using new hybrid algorithms, in Ninth IEEE International Conference on Computer and Information Technology (2009), pp. 20\u201325","DOI":"10.1109\/CIT.2009.111"},{"key":"9241_CR25","unstructured":"A. Safari Mamaghani, M.R. Meybodi, Hybrid evolutionary algorithms for solving software clustering problem, in Proceedings of the second Joint Congress on Fuzzy and Intelligent Systems, Tehran, Iran (2008)"},{"key":"9241_CR26","unstructured":"K. Asghari, M.R. Meybodi, Solving single machine total weighted tardiness scheduling problem using learning automata and genetic algorithm, in Proceedings of the 3rd Iran Data Mining Conference(IDMC\u201909), Tehran Iran (2009)"},{"key":"9241_CR27","unstructured":"A.S. Mamaghani, M. Mahi, M.R. Meybodi, A learning automaton based approach for data fragments allocation in distributed database systems, in IEEE 10th International Conference on Computer and Information Technology (CIT) (2010), pp. 8\u201312"},{"key":"9241_CR28","doi-asserted-by":"crossref","unstructured":"A.S. Mamaghani, M. Mahi, M.R. Meybodi, M.H. Moghaddam, A novel evolutionary algorithm for solving static data allocation problem in distributed database systems, in Second International Conference on Network Applications Protocols and Services (NETAPPS) (2010), pp. 14\u201319","DOI":"10.1109\/NETAPPS.2010.10"},{"key":"9241_CR29","first-page":"32","volume":"8","author":"V Majid Nezhad","year":"2011","unstructured":"V. Majid Nezhad, H. Motee Gader, E. Efimov, A novel hybrid algorithm for task graph scheduling. Int. J. Comput. Sci. Issues 8, 32\u201338 (2011)","journal-title":"Int. J. Comput. Sci. Issues"},{"key":"9241_CR30","unstructured":"A. Bansal, R. Kaur, Task graph scheduling on multiprocessor system using genetic algorithm. Int. J. Eng. Res. Technol. 1, 1\u20135 (2012)"},{"key":"9241_CR31","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1109\/3477.604100","volume":"27","author":"W Yuan-Kai","year":"1997","unstructured":"W. Yuan-Kai, F. Kuo-Chin, H. Jorng-Tzong, Genetic-based search for error-correcting graph isomorphism. IEEE Trans. Syst. Man Cybern. B Cybern. 27, 588\u2013597 (1997)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"key":"9241_CR32","unstructured":"P. Foggia, C. Sansone, M. Vento, A database of graphs for isomorphism and sub-graph isomorphism benchmarking, in Proceedings of the 3rd IAPR TC-15 International Workshop on Graph-based Representations (2001), pp. 176\u2013187"},{"key":"9241_CR33","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"J.R. Ullmann, An algorithm for subgraph isomorphism. J. ACM 23, 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"9241_CR34","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"L.P. Cordella, P. Foggia, C. Sansone, M. Vento, A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26, 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-015-9241-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-015-9241-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-015-9241-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:22:08Z","timestamp":1559254928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-015-9241-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,21]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["9241"],"URL":"https:\/\/doi.org\/10.1007\/s10710-015-9241-9","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,21]]}}}