{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T05:12:59Z","timestamp":1748409179392,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030916077"},{"type":"electronic","value":"9783030916084"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-91608-4_32","type":"book-chapter","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T20:05:55Z","timestamp":1637697955000},"page":"324-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Genetic and Ant Colony Algorithms to Solve the Multi-TSP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5439-287X","authenticated-orcid":false,"given":"S\u00edlvia","family":"de Castro Pereira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3224-4926","authenticated-orcid":false,"given":"E. J. Solteiro","family":"Pires","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4283-1243","authenticated-orcid":false,"given":"Paulo Moura","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,23]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Alaidi, A.H.M., Mahmood, A.: Distributed hybrid method to solve multiple traveling salesman problems. In: 2018 International Conference on Advance of Sustainable Engineering and its Application (ICASEA), pp. 74\u201378. IEEE (2018)","key":"32_CR1","DOI":"10.1109\/ICASEA.2018.8370959"},{"issue":"1","key":"32_CR2","first-page":"425","volume":"3","author":"V Aray","year":"2014","unstructured":"Aray, V., Goyal, A., Jaiswal, V.: An optimal solution to multiple travelling salesperson problem using modified genetic algorithm. J. Appl. Innov. Eng. Manage. 3(1), 425\u2013430 (2014)","journal-title":"J. Appl. Innov. Eng. Manage."},{"issue":"3","key":"32_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006). https:\/\/doi.org\/10.1016\/j.omega.2004.10.004","journal-title":"Omega"},{"doi-asserted-by":"crossref","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006)","key":"32_CR4","DOI":"10.1016\/j.omega.2004.10.004"},{"issue":"02","key":"32_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1142\/S0219622007002447","volume":"6","author":"EC Brown","year":"2007","unstructured":"Brown, E.C., Ragsdale, C.T., Carter, A.E.: A grouping genetic algorithm for the multiple traveling salesperson problem. Int. J. Inf. Technol. Decis. Making 6(02), 333\u2013347 (2007)","journal-title":"Int. J. Inf. Technol. Decis. Making"},{"issue":"1","key":"32_CR6","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.ejor.2005.04.027","volume":"175","author":"AE Carter","year":"2006","unstructured":"Carter, A.E., Ragsdale, C.T.: 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":"6","key":"32_CR7","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."},{"unstructured":"Dorigo, M.: Optimization, learning and natural algorithms [ph. d. thesis]. Politecnico di Milano, Italy (1992)","key":"32_CR8"},{"issue":"2","key":"32_CR9","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"GN Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7(2), 178\u2013193 (1978). https:\/\/doi.org\/10.1137\/0207017","journal-title":"SIAM J. Comput."},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1016\/j.asoc.2010.03.002","volume":"11","author":"S Ghafurian","year":"2011","unstructured":"Ghafurian, S., Javadian, N.: An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems. Appl. Soft Comput. 11(1), 1256\u20131262 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"32_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1080\/25765299.2019.1565193","volume":"26","author":"Y Harrath","year":"2019","unstructured":"Harrath, Y., Salman, A.F., Alqaddoumi, A., Hasan, H., Radhi, A.: A novel hybrid approach for solving the multiple traveling salesmen problem. Arab J. Basic Appl. Sci. 26(1), 103\u2013112 (2019). https:\/\/doi.org\/10.1080\/25765299.2019.1565193","journal-title":"Arab J. Basic Appl. Sci."},{"key":"32_CR12","volume-title":"Adaption in Natural and Artificial Systems 1992 Editi","author":"J Holland","year":"1975","unstructured":"Holland, J.: Adaption in Natural and Artificial Systems 1992 Editi. MIT Press, Cambridge (1975)"},{"issue":"16","key":"32_CR13","first-page":"55","volume":"7","author":"H Larki","year":"2014","unstructured":"Larki, H., Yousefikhoshbakht, M.: Solving the multiple traveling salesman problem by a novel meta-heuristic algorithm. J. Optim. Indus. Eng. 7(16), 55\u201363 (2014)","journal-title":"J. Optim. Indus. Eng."},{"unstructured":"Liu, L.q., Dai, Y.t., Wang, L.H.: Ant colony algorithm parameters optimization. Comput. Eng. 34(11), 208\u2013210 (2008)","key":"32_CR14"},{"unstructured":"Liu, W., Li, S., Zhao, F., Zheng, A.: An ant colony optimization algorithm for the multiple traveling salesmen problem. In: 2009 4th IEEE Conference on Industrial Electronics and Applications, pp. 1533\u20131537. IEEE (2009)","key":"32_CR15"},{"issue":"4","key":"32_CR16","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM (JACM) 7(4), 326\u2013329 (1960)","journal-title":"J. ACM (JACM)"},{"unstructured":"Reeves, C.: Modern Heuristic Techniques for Combinatorial Problems, (ed.) Mcgraw-Hill, New York (1993)","key":"32_CR17"},{"issue":"2","key":"32_CR18","first-page":"1","volume":"9","author":"AS Rostami","year":"2015","unstructured":"Rostami, A.S., Mohanna, F., Keshavarz, H., Hosseinabadi, A.: Solving multiple traveling salesman problem using the gravitational emulation local search algorithm. Appl. Math. Inf. Sci. 9(2), 1\u201311 (2015)","journal-title":"Appl. Math. Inf. Sci."},{"key":"32_CR19","first-page":"73","volume":"4","author":"M Sedighpour","year":"2012","unstructured":"Sedighpour, M., Yousefikhoshbakht, M., Mahmoodi Darani, N.: An effective genetic algorithm for solving the multiple traveling salesman problem. J. Optim. Ind. Eng. 4, 73\u201379 (2012)","journal-title":"J. Optim. Ind. Eng."},{"issue":"1","key":"32_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00500-008-0312-1","volume":"13","author":"A Singh","year":"2009","unstructured":"Singh, A., Baghel, A.S.: A new grouping genetic algorithm approach to the multiple traveling salesperson problem. Soft Comput. 13(1), 95\u2013101 (2009)","journal-title":"Soft Comput."},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.cie.2015.10.010","volume":"90","author":"B Soylu","year":"2015","unstructured":"Soylu, B.: A general variable neighborhood search heuristic for multiple traveling salesmen problem. Comput. Ind. Eng. 90, 390\u2013401 (2015)","journal-title":"Comput. Ind. Eng."}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91608-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:52:19Z","timestamp":1710258739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91608-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030916077","9783030916084"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91608-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDEAL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Data Engineering and Automated Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Manchester","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":"25 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ideal2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ideal-conf.com\/ideal2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}