{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:26:11Z","timestamp":1743056771982,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031232350"},{"type":"electronic","value":"9783031232367"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-23236-7_36","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T01:22:43Z","timestamp":1672536163000},"page":"520-532","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Approach GABC-LS to\u00a0Solve mTSP"],"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.","family":"Solteiro Pires","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4283-1243","authenticated-orcid":false,"given":"P.","family":"B. de Moura Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1101\/gr.10.3.350","volume":"10","author":"R Agarwala","year":"2000","unstructured":"Agarwala, R., Applegate, D., Maglott, D., Schuler, G.S.A.: A fast and scalable radiation hybrid map construction and integration strategy. Genome Res. 10, 350\u2013364 (2000)","journal-title":"Genome Res."},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1287\/mnsc.18.6.B279","volume":"10","author":"RD Angel","year":"1972","unstructured":"Angel, R.D., Caudle, W., Noonan, R., Whinson, A.: Computer assisted school bus scheduling. Manag. Sci. 10, 279\u2013288 (1972)","journal-title":"Manag. Sci."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Basu, S.: Tabu search implementation on traveling salesman problem and its variations: a literature survey. Am. J. Oper. Res. 2(2) (2012)","DOI":"10.4236\/ajor.2012.22019"},{"key":"36_CR4","unstructured":"Calado, F., Ladeira, A.: Traveling salesman problem: a comparative approach by using artificial intelligence techniques. Centro Universit\u00e1rio de Belo Horizonte, Belo Horizonte, MG (2011)"},{"key":"36_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100369","volume":"40","author":"O Cheikhrouhou","year":"2021","unstructured":"Cheikhrouhou, O., Khoufi, I.: A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy. Comput. Sci. Rev. 40, 100369 (2021)","journal-title":"Comput. Sci. Rev."},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.eswa.2015.12.047","volume":"54","author":"J Conesa-Mu\u00f1oz","year":"2016","unstructured":"Conesa-Mu\u00f1oz, J., Pajares, G., Ribeiro, A.: Mix-opt: a new route operator for optimal coverage path planning for a fleet in an agricultural environment. Expert Syst. Appl. 54, 364\u2013378 (2016)","journal-title":"Expert Syst. Appl."},{"issue":"6","key":"36_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."},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Darwin, C.: On the origin of species by means of natural selection, or the preservation of favoured races in the struggle for life, 6th edn. John Murray, London (1859). http:\/\/www.gutenberg.org\/etext\/1228","DOI":"10.5962\/bhl.title.82303"},{"key":"36_CR9","volume-title":"Genetic Algorithms and Grouping Problems","author":"E Falkenauer","year":"1992","unstructured":"Falkenauer, E.: Genetic Algorithms and Grouping Problems. Wiley, New York (1992)"},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ejor.2010.08.011","volume":"208","author":"D Karapetyan","year":"2010","unstructured":"Karapetyan, D., Gutin, G.: Lin-kernighan heuristic adaptations for the generalized traveling salesman problem. Eur. J. Oper. Res. 208(3), 221\u2013232 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"36_CR11","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2020","unstructured":"Katoch, S., Chauhan, S.S., Kumar, V.: A review on genetic algorithm: past, present, and future. Multimedia Tools Appl. 80(5), 8091\u20138126 (2020). https:\/\/doi.org\/10.1007\/s11042-020-10139-6","journal-title":"Multimedia Tools Appl."},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.cie.2019.01.020","volume":"129","author":"P Kitjacharoenchai","year":"2019","unstructured":"Kitjacharoenchai, P., Ventresca, M., Moshref-Javadi, M., Lee, S., Tanchoco, J., Brunese, P.: Multiple traveling salesman problem with drones: mathematical model and heuristic approach. Comput. Ind. Eng. 129, 14\u201330 (2019). https:\/\/doi.org\/10.1016\/j.cie.2019.01.020","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"36_CR13","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/j.orl.2007.02.001","volume":"35","author":"W Malik","year":"2007","unstructured":"Malik, W., Rathinam, S., Darbha, S.: An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem. Oper. Res. Lett. 35(6), 747\u2013753 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"36_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0377-2217(95)00185-9","volume":"93","author":"C Malmborg","year":"1996","unstructured":"Malmborg, C.: A genetic algorithm for service level based vehicle scheduling. Eur. J. Oper. Res. 93(1), 121\u2013134 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"36_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z., Schoenauer, M.: Evolutionary algorithms for constrained parameter optimization problems. Evol. Comput. 4(1), 1\u201332 (1996)","journal-title":"Evol. Comput."},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison, D.R., Jacobson, S.H., Sauppe, J.J., Sewell, E.C.: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning. Discret. Optim. 19, 79\u2013102 (2016). https:\/\/doi.org\/10.1016\/j.disopt.2016.01.005","journal-title":"Discret. Optim."},{"issue":"4","key":"36_CR17","first-page":"474","volume":"27","author":"J Potvin","year":"1989","unstructured":"Potvin, J., Lapalme, G., Rousseau, J.: A generalized k-opt exchange procedure for the MTSP. Inf. Syst. Oper. Res. 27(4), 474\u2013481 (1989)","journal-title":"Inf. Syst. Oper. Res."},{"key":"36_CR18","unstructured":"Rahbari, M., Jahed, A.: A hybrid simulated annealing algorithm for travelling salesman problem with three neighbor generation structures. In: 10th International Conference of Iranian Operations Research Society (ICIORS 2017) (2017)"},{"key":"36_CR19","unstructured":"Ratliff, H., Rosenthal, A.: Order-picking in a rectangular warehouse: a solvable case for the traveling salesman problem. Georgia Institute of Technology, PDRC Report Series, PDRC Report Series No. 81-10 (1981)"},{"key":"36_CR20","unstructured":"Reeves, C.: Modern Heuristic Techniques for Combinatorial Problems. Mcgraw-Hill transfer from Blackwell Scientific (1993)"},{"key":"36_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). https:\/\/doi.org\/10.1016\/j.cie.2015.10.010","journal-title":"Comput. Ind. Eng."},{"key":"36_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0377-2217(99)00380-X","volume":"124","author":"L Tang","year":"2000","unstructured":"Tang, L., Liu, J., Rong, A., Yang, Z.: A multiple traveling salesman problem model for hot rolling scheduling in Shangai Baoshan iron & steel complex. Eur. J. Oper. Res. 124, 267\u2013282 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"36_CR23","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s11370-018-0259-8","volume":"11","author":"S Trigui","year":"2018","unstructured":"Trigui, S., Cheikhrouhou, O., Koubaa, A., Zarrad, A., Youssef, H.: An analytical hierarchy process-based approach to solve the multi-objective multiple traveling salesman problem. Intel. Serv. Robot. 11(4), 355\u2013369 (2018). https:\/\/doi.org\/10.1007\/s11370-018-0259-8","journal-title":"Intel. Serv. Robot."},{"issue":"8","key":"36_CR24","first-page":"1226","volume":"12","author":"S Violina","year":"2021","unstructured":"Violina, S.: Analysis of brute force and branch & bound algorithms to solve the traveling salesperson problem (TSP). Turkish J. Comput. Math. Educ. 12(8), 1226\u20131229 (2021)","journal-title":"Turkish J. Comput. Math. Educ."},{"key":"36_CR25","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.comcom.2015.06.001","volume":"72","author":"A Wichmann","year":"2015","unstructured":"Wichmann, A., Korkmaz, T.: Smooth path construction and adjustment for multiple mobile sinks in wireless sensor networks. Comput. Commun. 72, 93\u2013106 (2015)","journal-title":"Comput. Commun."},{"issue":"4","key":"36_CR26","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1109\/TCYB.2015.2418052","volume":"46","author":"W Zhao","year":"2015","unstructured":"Zhao, W., Meng, Q., Chung, P.: A heuristic distributed task allocation method for multivehicle multitask problems and its application to search and rescue scenario. IEEE Trans. Cybern. 46(4), 902\u2013915 (2015)","journal-title":"IEEE Trans. Cybern."}],"container-title":["Communications in Computer and Information Science","Optimization, Learning Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23236-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:31:31Z","timestamp":1672540291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23236-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031232350","9783031232367"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23236-7_36","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OL2A","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization, Learning Algorithms and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bragan\u00e7a","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ol2a2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ol2a.ipb.pt\/EN_index.html","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":"145","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":"53","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":"3","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":"37% - 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":"3","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}