{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:11:49Z","timestamp":1742955109177,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031249068"},{"type":"electronic","value":"9783031249075"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-24907-5_46","type":"book-chapter","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T10:02:05Z","timestamp":1693303325000},"page":"385-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Metaheuristic for the Clustered Travelling Salesman Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0383-0379","authenticated-orcid":false,"given":"Abtin","family":"Nourmohammadzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"issue":"1\u20132","key":"46_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0167-6377(98)00046-7","volume":"24","author":"S Anily","year":"1999","unstructured":"Anily, S., Bramel, J., & Hertz, A. (1999). An approximation algorithm for the clustered traveling salesman tour and path problems. Operations Research Letters,\u00a024(1\u20132), 29\u201335. https:\/\/doi.org\/10.1016\/S0167-6377(98)00046-7","journal-title":"Operations Research Letters"},{"issue":"23","key":"46_CR2","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.ipl.2012.08.020","volume":"112","author":"X Bao","year":"2012","unstructured":"Bao, X., & Liu, Z. (2012). An improved approximation algorithm for the clustered traveling salesman problem. Information Processing Letters,\u00a0112(23), 908\u2013910. https:\/\/doi.org\/10.1016\/j.ipl.2012.08.020","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Box, G. E. P., & Draper, N. R. (2007). Response surfaces, mixtures, and ridge analyses (2nd ed.). Wiley.","key":"46_CR3","DOI":"10.1002\/0470072768"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","volume":"2","author":"JA Chisman","year":"1975","unstructured":"Chisman, J. A. (1975). The clustered traveling salesman problem. Computers & Operations Research,\u00a02, 115\u2013119. https:\/\/doi.org\/10.1016\/0305-0548(75)90015-5","journal-title":"Computers & Operations Research"},{"unstructured":"Concorde Home. (2020, October 11). https:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html","key":"46_CR5"},{"unstructured":"Conover, W. J. (1999). Practical nonparametric statistics (3rd ed.). Wiley.","key":"46_CR6"},{"issue":"4","key":"46_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S1007-0214(07)70068-8","volume":"12","author":"C Ding","year":"2007","unstructured":"Ding, C., Cheng, Y., & He, M. (2007). Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs. Tsinghua Science and Technology,\u00a012(4), 459\u2013465. https:\/\/doi.org\/10.1016\/S1007-0214(07)70068-8","journal-title":"Tsinghua Science and Technology"},{"key":"46_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","author":"FW Glover","year":"2013","unstructured":"Glover, F. W., & Laguna, M. (2013). Tabu search. Springer. https:\/\/doi.org\/10.1007\/978-1-4615-6089-0","journal-title":"Springer"},{"issue":"1","key":"46_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0377-2217(85)90309-1","volume":"19","author":"K Jongens","year":"1985","unstructured":"Jongens, K., & Volgenant, T. (1985). The symmetric clustered traveling salesman problem. European Journal of Operational Research,\u00a019(1), 68\u201375. https:\/\/doi.org\/10.1016\/0377-2217(85)90309-1","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"46_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., & Basturk, B. (2007). A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm. Journal of Global Optimization,\u00a039(3), 459\u2013471. https:\/\/doi.org\/10.1007\/s10898-007-9149-x","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"46_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00127356","volume":"2","author":"G Laporte","year":"1997","unstructured":"Laporte, G., Potvin, J. Y., & Quilleret, F. (1997). A Tabu search heuristic using genetic diversification for the clustered traveling salesman problem. Journal of Heuristics,\u00a02(3), 187\u2013200. https:\/\/doi.org\/10.1007\/BF00127356.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"46_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory,\u00a028(2), 129\u2013137. https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Transactions on Information Theory"},{"key":"46_CR13","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.972","volume":"8","author":"Y Lu","year":"2022","unstructured":"Lu, Y., Hao, J. K., & Wu, Q. (2022). Solving the clustered traveling salesman problem via traveling salesman problem methods. PeerJ. Computer Science,\u00a08, e972. https:\/\/doi.org\/10.7717\/peerj-cs.972","journal-title":"PeerJ. Computer Science"},{"issue":"1","key":"46_CR14","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1831\/1\/012008","volume":"1831","author":"AT Mathew","year":"2021","unstructured":"Mathew, A. T., Paul, A., Rojan, A., & Thomas, A. (2021). Implementation of swarm intelligence algorithms for path planning. Journal of Physics: Conference Series,\u00a01831(1), 012008. https:\/\/doi.org\/10.1088\/1742-6596\/1831\/1\/012008","journal-title":"Journal of Physics: Conference Series"},{"key":"46_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2017.12.018","volume":"116","author":"M Mestria","year":"2018","unstructured":"Mestria, M. (2018). New hybrid heuristic algorithm for the clustered traveling salesman problem. Computers & Industrial Engineering,\u00a0116, 1\u201312. https:\/\/doi.org\/10.1016\/j.cie.2017.12.018","journal-title":"Computers & Industrial Engineering"},{"issue":"12","key":"46_CR16","doi-asserted-by":"publisher","first-page":"3218","DOI":"10.1016\/j.cor.2012.10.001","volume":"40","author":"M Mestria","year":"2013","unstructured":"Mestria, M., Satoru Ochi, L., & de Lima Martins, S. (2013). GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem. Computers & Operations Research,\u00a040(12), 3218\u20133229. https:\/\/doi.org\/10.1016\/j.cor.2012.10.001","journal-title":"Computers & Operations Research"},{"doi-asserted-by":"publisher","unstructured":"Potvin, J. Y., & Guertin, F. (1996). The clustered traveling salesman problem: A genetic approach. In Meta-heuristics (pp. 619\u2013631). Springer. https:\/\/doi.org\/10.1007\/978-1-4613-1361-8_37","key":"46_CR17","DOI":"10.1007\/978-1-4613-1361-8_37"},{"unstructured":"TSPLIB: MP-testdata\u2014The TSPLIB symmetric traveling salesman problem instances (2021). http:\/\/elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsp\/index.html","key":"46_CR18"}],"container-title":["Lecture Notes in Operations Research","Operations Research Proceedings 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24907-5_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T10:07:14Z","timestamp":1693303634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24907-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031249068","9783031249075"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24907-5_46","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"type":"print","value":"2731-040X"},{"type":"electronic","value":"2731-0418"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Karlsruhe","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"or2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}