{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:09:47Z","timestamp":1742969387860,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030870935"},{"type":"electronic","value":"9783030870942"}],"license":[{"start":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T00:00:00Z","timestamp":1637193600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T00:00:00Z","timestamp":1637193600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-87094-2_9","type":"book-chapter","created":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T07:06:45Z","timestamp":1637132805000},"page":"95-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["ACO Inspired GA Mutation Applied to\u00a0the TSP"],"prefix":"10.1007","author":[{"given":"Darren M.","family":"Chitty","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,18]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45724-0_35","volume-title":"Ant Algorithms","author":"A Acan","year":"2002","unstructured":"Acan, A.: GAACO: a GA + ACO hybrid for faster and better search capability. In: Dorigo, M., Di Caro, G., Sampels, M. (eds.) ANTS 2002. LNCS, vol. 2463, pp. 300\u2013301. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45724-0_35"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M Albayrak","year":"2011","unstructured":"Albayrak, M., Allahverdi, N.: Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Syst. Appl. 38(3), 1313\u20131320 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS J. Comput. 15(1), 82\u201392 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00203625","volume":"64","author":"W Banzhaf","year":"1990","unstructured":"Banzhaf, W.: The \u201cmolecular\u2019\u2019 traveling salesman. Biol. Cybern. 64(1), 7\u201314 (1990)","journal-title":"Biol. Cybern."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1007\/3-540-45105-6_90","volume-title":"Genetic and Evolutionary Computation \u2014 GECCO 2003","author":"J Branke","year":"2003","unstructured":"Branke, J., Barz, C., Behrens, I., et al.: Ant-based crossover for permutation problems. In: Cant\u00fa-Paz, E. (ed.) GECCO 2003. LNCS, vol. 2723, pp. 754\u2013765. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45105-6_90"},{"key":"9_CR6","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-66939-7_9","volume-title":"Advances in Computational Intelligence Systems","author":"DM Chitty","year":"2018","unstructured":"Chitty, D.M.: Applying ACO to large scale TSP instances. In: Chao, F., Schockaert, S., Zhang, Q. (eds.) UKCI 2017. AISC, vol. 650, pp. 104\u2013118. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-66939-7_9"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chitty, D.M.: Scalable partial-ACO applied to fleet optimisation: sampling and multi-colony approaches. In: 2020 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 3156\u20133163. IEEE (2020)","DOI":"10.1109\/SSCI47803.2020.9308283"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chitty, D.M.: A partially asynchronous global parallel genetic algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1771\u20131778 (2021)","DOI":"10.1145\/3449726.3463190"},{"issue":"6","key":"9_CR9","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"key":"9_CR10","unstructured":"Davis, L.: Applying adaptive algorithms to epistatic domains. In: IJCAI, vol. 85, pp. 162\u2013164 (1985)"},{"issue":"5","key":"9_CR11","doi-asserted-by":"publisher","first-page":"5006","DOI":"10.1016\/j.eswa.2011.10.012","volume":"39","author":"G Dong","year":"2012","unstructured":"Dong, G., Guo, W.W., Tickle, K.: Solving the traveling salesman problem using cooperative genetic ant systems. Expert Syst. Appl. 39(5), 5006\u20135011 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00202901","volume":"60","author":"DB Fogel","year":"1988","unstructured":"Fogel, D.B.: An evolutionary approach to the traveling salesman problem. Biol. Cybern. 60(2), 139\u2013144 (1988)","journal-title":"Biol. Cybern."},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/01969729308961697","volume":"24","author":"DB Fogel","year":"1993","unstructured":"Fogel, D.B.: Applying evolutionary programming to selected traveling salesman problems. Cybern. Syst. 24(1), 27\u201336 (1993)","journal-title":"Cybern. Syst."},{"issue":"11","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.4304\/jsw.5.11.1179-1186","volume":"5","author":"S Gao","year":"2010","unstructured":"Gao, S., Zhang, Z., Cao, C.: A novel ant colony genetic hybrid algorithm. JSW 5(11), 1179\u20131186 (2010)","journal-title":"JSW"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Gong, D., Ruan, X.: A hybrid approach of GA and ACO for TSP. In: Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No. 04EX788), vol. 3, pp. 2068\u20132072. IEEE (2004)","DOI":"10.1109\/WCICA.2004.1341948"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-46004-7_8","volume-title":"Applications of Evolutionary Computing","author":"M Guntsch","year":"2002","unstructured":"Guntsch, M., Middendorf, M.: A population based approach for ACO. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoWorkshops 2002. LNCS, vol. 2279, pp. 72\u201381. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46004-7_8"},{"key":"9_CR18","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. U Michigan Press (1975)"},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"9_CR20","unstructured":"Louis, S.J., Tang, R.: Interactive genetic algorithms for the traveling salesman problem. In: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation, vol. 1, pp. 385\u2013392 (1999)"},{"key":"9_CR21","volume-title":"Genetic Algorithms+ Data Structures = Evolution Programs","author":"Z Michalewicz","year":"2013","unstructured":"Michalewicz, Z.: Genetic Algorithms+ Data Structures = Evolution Programs. Springer, Heidelberg (2013)"},{"key":"9_CR22","unstructured":"Oliver, I., Smith, D., Holland, J.R.: Study of permutation crossover operators on the traveling salesman problem. In: Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms: 28\u201331 July 1987 at the Massachusetts Institute of Technology, Cambridge, MA. L. Erlhaum Associates, Hillsdale (1987)"},{"key":"9_CR23","unstructured":"Whitley, L.D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesmen: the genetic edge recombination operator. In: ICGA, vol. 89, pp. 133\u201340 (1989)"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Computational Intelligence Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87094-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T10:20:52Z","timestamp":1726136452000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87094-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,18]]},"ISBN":["9783030870935","9783030870942"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87094-2_9","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2021,11,18]]},"assertion":[{"value":"18 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UKCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"UK Workshop on Computational Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aberystwyth","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ukci2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ukci2021.dcs.aber.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}