{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:40:15Z","timestamp":1742960415608,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030166595"},{"type":"electronic","value":"9783030166601"}],"license":[{"start":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T00:00:00Z","timestamp":1555200000000},"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-3-030-16660-1_107","type":"book-chapter","created":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T20:06:56Z","timestamp":1555186016000},"page":"1096-1109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["AMGA: An Adaptive and Modular Genetic Algorithm for the Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Ryoma","family":"Ohira","sequence":"first","affiliation":[]},{"given":"Md. Saiful","family":"Islam","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Jo","sequence":"additional","affiliation":[]},{"given":"Bela","family":"Stantic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,14]]},"reference":[{"unstructured":"Oliver, I., Smith, D., Holland, J.R.: Study of permutation crossover operators on the traveling salesman problem. In: ICGA (1987)","key":"107_CR1"},{"unstructured":"Murata, T., Ishibuchi, H.: Performance evaluation of genetic algorithms for flowshop scheduling problems. In: CEC, pp. 812\u2013817 (1994)","key":"107_CR2"},{"key":"107_CR3","first-page":"61","volume":"2","author":"O Abdoun","year":"2012","unstructured":"Abdoun, O., Abouchabaka, J., Tajani, C.: Analyzing the performance of mutation operators to solve the travelling salesman problem. Int. J. Emerg. Sci. 2, 61\u201377 (2012)","journal-title":"Int. J. Emerg. Sci."},{"issue":"11","key":"107_CR4","first-page":"49","volume":"31","author":"O Abdoun","year":"2011","unstructured":"Abdoun, O., Abouchabaka, J.: A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem. Int. J. Comput. Appl. 31(11), 49\u201357 (2011)","journal-title":"Int. J. Comput. Appl."},{"unstructured":"Razali, N.M., Geraghty, J., et al.: Genetic algorithm performance with different selection strategies in solving TSP. In: WCE, vol. 2, pp. 1134\u20131139 (2011)","key":"107_CR5"},{"key":"107_CR6","first-page":"69","volume-title":"Foundations of Genetic Algorithms","author":"David E. Goldberg","year":"1991","unstructured":"Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Foundations of Genetic Algorithms, vol. 1, pp. 69\u201393 (1991)"},{"issue":"3","key":"107_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M \u010crepin\u0161ek","year":"2013","unstructured":"\u010crepin\u0161ek, M., Liu, S.H., Mernik, M.: Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput. Surv. (CSUR) 45(3), 35 (2013)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"2","key":"107_CR8","first-page":"167","volume":"19","author":"G Karafotias","year":"2015","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, \u00c1.E.: Parameter control in evolutionary algorithms: trends and challenges. CEC 19(2), 167\u2013187 (2015)","journal-title":"CEC"},{"doi-asserted-by":"crossref","unstructured":"Spears, W.M.: Adapting crossover in evolutionary algorithms. In: Evolutionary Programming, pp. 367\u2013384 (1995)","key":"107_CR9","DOI":"10.7551\/mitpress\/2887.003.0035"},{"doi-asserted-by":"crossref","unstructured":"Riff, M.C., Bonnaire, X.: Inheriting parents operators: a new dynamic strategy for improving evolutionary algorithms. In: International Symposium on Methodologies for Intelligent Systems, pp. 333\u2013341. Springer (2002)","key":"107_CR10","DOI":"10.1007\/3-540-48050-1_37"},{"doi-asserted-by":"crossref","unstructured":"Gomez, J.: Self adaptation of operator rates in evolutionary algorithms. In: Genetic and Evolutionary Computation Conference, pp. 1162\u20131173. Springer (2004)","key":"107_CR11","DOI":"10.1007\/978-3-540-24854-5_113"},{"doi-asserted-by":"crossref","unstructured":"Cruz-Salinas, A.F., Perdomo, J.G.: Self-adaptation of genetic operators through genetic programming techniques. In: GECCO, pp. 913\u2013920. ACM (2017)","key":"107_CR12","DOI":"10.1145\/3071178.3071214"},{"doi-asserted-by":"crossref","unstructured":"Montero, E., Riff, M.C.: Self-calibrating strategies for evolutionary approaches that solve constrained combinatorial problems. In: International Symposium on Methodologies for Intelligent Systems, pp. 262\u2013267. Springer (2008)","key":"107_CR13","DOI":"10.1007\/978-3-540-68123-6_29"},{"issue":"3","key":"107_CR14","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.ins.2010.09.016","volume":"181","author":"E Montero","year":"2011","unstructured":"Montero, E., Riff, M.C.: On-the-fly calibrating strategies for evolutionary algorithms. Inf. Sci. 181(3), 552\u2013566 (2011)","journal-title":"Inf. Sci."},{"issue":"2","key":"107_CR15","first-page":"1","volume":"12","author":"E Osaba","year":"2014","unstructured":"Osaba, E., Diaz, F., Onieva, E., Carballedo, R., Perallos, A.: AMCPA: a population metaheuristic with adaptive crossover probability and multi-crossover mechanism for solving combinatorial optimization problems. Int. J. Artif. Intell. 12(2), 1\u201323 (2014)","journal-title":"Int. J. Artif. Intell."},{"key":"107_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-319-01692-4_9","volume-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO 2013)","author":"E. Osaba","year":"2014","unstructured":"Osaba, E., Onieva, E., Carballedo, R., Diaz, F., Perallos, A.: An adaptive multi-crossover population algorithm for solving routing problems. In: Nature Inspired Cooperative Strategies for Optimization, pp. 113\u2013124 (2014)"},{"key":"107_CR17","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT Press, Cambridge (1992)"},{"unstructured":"Whitley, L.D., et al.: The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In: Proceedings of the 3rd International Conference on Genetic Algorithms, vol. 89, pp. 116\u2013123 (1989)","key":"107_CR18"},{"unstructured":"Baker, J.E.: Reducing bias and inefficiency in the selection algorithm. In: Proceedings of the 2nd International Conference on Genetic Algorithms and their Application, pp. 14\u201321 (1987)","key":"107_CR19"},{"unstructured":"Davis, L.: Applying adaptive algorithms to epistatic domains. In: International Joint Conference on Artificial Intelligence, vol. 85, pp. 162\u2013164 (1985)","key":"107_CR20"},{"unstructured":"Whitley, D., Starkweather, T., Shaner, D.: The traveling salesman and sequence scheduling: quality solutions using genetic edge recombination (1991)","key":"107_CR21"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Systems Design and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16660-1_107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T22:12:24Z","timestamp":1721167944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16660-1_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,14]]},"ISBN":["9783030166595","9783030166601"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16660-1_107","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,4,14]]},"assertion":[{"value":"14 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISDA 2018","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Systems Design and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vellore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isda2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mirlabs.net\/isda18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}