{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T18:24:37Z","timestamp":1726079077106},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811532863"},{"type":"electronic","value":"9789811532870"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3287-0_12","type":"book-chapter","created":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T15:03:49Z","timestamp":1586012629000},"page":"155-165","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Meme-Based Computational Optimization Framework"],"prefix":"10.1007","author":[{"given":"Felis","family":"Dwiyasa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng-Hiot","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren-Xiang","family":"Foo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Wei Jason","family":"Teo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,5]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.ejor.2005.04.027","volume":"175","author":"AE Carter","year":"2006","unstructured":"A.E. Carter, C.T. Ragsdale, A new approach to solving the multiple traveling salesperson problem using genetic algorithms. Eur. J. Oper. Res. 175(1), 246\u2013257 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TEVC.2011.2132725","volume":"15","author":"X Chen","year":"2011","unstructured":"X. Chen, Y.-S. Ong, M.-H. Lim, K.C. Tan, A multi-facet survey on memetic computation. IEEE Trans. Evol. Comput. 15(5), 591\u2013607 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"X. Chen, Y.S. Ong, A conceptual modeling of meme complexes in stochastic search. IEEE Trans. Syst. Man Cybern. Part C (Applications and Reviews), 42(5), 612\u2013625 (2012)","DOI":"10.1109\/TSMCC.2012.2188832"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"D. Hales, Modelling meta-memes, in Simulating Social Phenomena (Springer, Berlin, 1997) (pp. 365\u2013384)","DOI":"10.1007\/978-3-662-03366-1_31"},{"key":"12_CR5","unstructured":"K. Helsgaun, An Effective Implementation of K-Opt Moves for the Lin-Kernighan TSP Heuristic. Roskilde University. Department of Computer Science (2006)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"H. Ismkhan, K. Zamanifar, Using ants as a genetic crossover operator in GLS to solve STSP, in Paper Presented at the 2010 International Conference of Soft Computing and Pattern Recognition (2010)","DOI":"10.1109\/SOCPAR.2010.5686165"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"A. Kir\u00e1ly, J. Abonyi, A novel approach to solve multiple traveling salesmen problem by genetic algorithm, in Computational Intelligence in Engineering (Springer, Berlin, 2010) (pp. 141\u2013151)","DOI":"10.1007\/978-3-642-15220-7_12"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"N. Krasnogor, B. Blackburne, E.K. Burke, J.D. Hirst, Multimeme algorithms for protein structure prediction, in Paper Presented at the International Conference on Parallel Problem Solving from Nature (2002)","DOI":"10.1007\/3-540-45712-7_74"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"S. Lin, B.W. Kernighan, An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.knosys.2016.01.009","volume":"97","author":"Z Meng","year":"2016","unstructured":"Z. Meng, J.-S. Pan, Monkey king evolution: a new memetic evolutionary algorithm and its application in vehicle fuel consumption optimization. Knowl.-Based Syst. 97, 144\u2013157 (2016)","journal-title":"Knowl.-Based Syst."},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s12293-009-0011-1","volume":"1","author":"R Meuth","year":"2009","unstructured":"R. Meuth, M.-H. Lim, Y.-S. Ong, D.C. Wunsch, A proposition on memes and meta-memes in computing for higher-order learning. Memetic Comput, 1(2), 85\u2013100 (2009)","journal-title":"Memetic Comput,."},{"key":"12_CR12","unstructured":"Y.-S. Ong, M.-H. Lim, N. Zhu, K.-W Wong, Classification of adaptive memetic algorithms: a comparative study. IEEE Trans. Syst. Man Cybern. Part B (Cybernetics) 36(1), 141\u2013152 (2006)"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MCI.2010.936309","volume":"5","author":"Y-S Ong","year":"2010","unstructured":"Y.-S. Ong, M.H. Lim, X. Chen, Memetic computation\u2014past, present and future. IEEE Comput. Intell. Mag. 5(2), 24\u201331 (2010)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.asoc.2016.07.032","volume":"49","author":"E \u00d6zcan","year":"2016","unstructured":"E. \u00d6zcan, J.H. Drake, C. Alt\u0131nta\u015f, S. Asta, A self-adaptive multimeme memetic algorithm co-evolving utility scores to control genetic operators and their parameter settings. Appl. Soft Comput. 49, 81\u201393 (2016)","journal-title":"Appl. Soft Comput."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.asoc.2015.03.038","volume":"32","author":"PV Paul","year":"2015","unstructured":"P.V. Paul, N. Moganarangan, S.S. Kumar, R. Raju, T. Vengattaraman, P. Dhavachelvan, Performance analyses over population seeding techniques of the permutation-coded genetic algorithm: an empirical study based on traveling salesman problems. Appl. Soft Comput. 32, 383\u2013402 (2015)","journal-title":"Appl. Soft Comput."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"L.Q. Song, M.-H. Lim, Y.-S. Ong, Neural meta-memes framework for managing search algorithms in combinatorial optimization, in Paper Presented at the IEEE Workshop on Memetic Computing (MC) (2011)","DOI":"10.1109\/MC.2011.5953634"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"S. Starke, N. Hendrich, J. Zhang, Memetic evolution for generic full-body inverse kinematics in robotics and animation. IEEE Trans. Evolut. Comput. (2018)","DOI":"10.1109\/TEVC.2018.2867601"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","volume":"12","author":"Y Yuan","year":"2015","unstructured":"Y. Yuan, H. Xu, Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans. Autom. Sci. Eng. 12(1), 336\u2013353 (2015)","journal-title":"IEEE Trans. Autom. Sci. Eng."}],"container-title":["Advances in Intelligent Systems and Computing","Soft Computing for Problem Solving 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3287-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T15:17:38Z","timestamp":1586013458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3287-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811532863","9789811532870"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3287-0_12","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}