{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:04:21Z","timestamp":1775145861570,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2017,7,12]],"date-time":"2017-07-12T00:00:00Z","timestamp":1499817600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472192"],"award-info":[{"award-number":["61472192"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific and Technological Support Project (Society) of Jiangsu Province","award":["BE2016776"],"award-info":[{"award-number":["BE2016776"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00500-017-2705-5","type":"journal-article","created":{"date-parts":[[2017,7,12]],"date-time":"2017-07-12T06:53:35Z","timestamp":1499842415000},"page":"6567-6581","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":53,"title":["Two phase heuristic algorithm for the multiple-travelling salesman problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Xiaolong","family":"Xu","sequence":"first","affiliation":[]},{"given":"Hao","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Liptrott","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6607-422X","authenticated-orcid":false,"given":"Marcello","family":"Trovati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,12]]},"reference":[{"key":"2705_CR1","unstructured":"Alves RMF, Lopes CR (2015) Using genetic algorithms to minimize the distance and balance the routes for the multiple traveling salesman problem. In: Proceedings Sendai, CEC, pp 1\u20138"},{"key":"2705_CR2","doi-asserted-by":"crossref","unstructured":"An H, Wei L (2011) Synthetically improved genetic algorithm on the traveling salesman problem in material transportation. In: Proceedings Harbin, Heilongjiang, EMEIT, pp 3386\u20133371","DOI":"10.1109\/EMEIT.2011.6023808"},{"key":"2705_CR3","unstructured":"Atif AK, Muhammad UK, Muneeb I (2012) Multilevel graph partitioning scheme to solve traveling salesman problem. In: Proceedings Las Vegas, NV, ITNG, pp 458\u2013463"},{"key":"2705_CR4","unstructured":"Avin R, Agin D, Adnan M (2012) Solving TSP using genetic algorithms\u2014case of Kosovo, Advances in Computer Science, pp 256\u2013260"},{"key":"2705_CR5","doi-asserted-by":"crossref","unstructured":"Chen P (2013) An improved genetic algorithm for solving the traveling salesman problem. In: Proceedings Shenyang, ICNC, pp 397\u2013401","DOI":"10.1109\/ICNC.2013.6818008"},{"key":"2705_CR6","doi-asserted-by":"crossref","unstructured":"Falcon R, Nayak A (2010) The one-commodity traveling salesman problem with selective pickup and delivery: an ant colony approach. In: Proceedings Barcelona, Spain, CEC, pp 4326\u20134333","DOI":"10.1109\/CEC.2010.5586036"},{"key":"2705_CR7","doi-asserted-by":"crossref","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness, in computers and intractability, vol 24, New York, pp 90\u201391","DOI":"10.1137\/1024022"},{"key":"2705_CR8","doi-asserted-by":"crossref","unstructured":"Ghadiry W, Habibi J, Aghdam AG (2015) Generalized formulation for trajectory optimization in patrolling problems. In: Proceedings Halifax, NS, CCECE, pp 231\u2013236","DOI":"10.1109\/CCECE.2015.7129191"},{"issue":"1","key":"2705_CR9","first-page":"169","volume":"4","author":"KP Ghadle","year":"2014","unstructured":"Ghadle KP, Muley YM (2014) An application of assignment problem in traveling salesman problem (TSP). J Eng Res Appl 4(1):169\u2013172","journal-title":"J Eng Res Appl"},{"issue":"6","key":"2705_CR10","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/mnsc.16.6.B373","volume":"16","author":"S Gorenstein","year":"1970","unstructured":"Gorenstein S (1970) Printing press scheduling for multi-edition periodicals. Manag Sci 16(6):373\u2013383","journal-title":"Manag Sci"},{"issue":"3","key":"2705_CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s12532-015-0080-8","volume":"7","author":"K Helsgun","year":"2014","unstructured":"Helsgun K (2014) Solving the equality generalized traveling salesman problem using the Lin\u2013Kernighan\u2013Helsgaun algorithm. Math Program Comput 7(3):269\u2013287","journal-title":"Math Program Comput"},{"key":"2705_CR12","doi-asserted-by":"crossref","unstructured":"Hosseinabadi AAR, Kardgar M, Shojafar M et al (2014) GELS-GA: hybrid metaheuristic algorithm for solving multiple travelling salesman problem. In: Proceedings Okinawa, ISDA, pp 76\u201381","DOI":"10.1109\/ISDA.2014.7066271"},{"issue":"2","key":"2705_CR13","first-page":"139","volume":"35","author":"CQ Hu","year":"2014","unstructured":"Hu CQ (2014) A K-means algorithm. J Changchun Univ Technol 35(2):139\u2013142","journal-title":"J Changchun Univ Technol"},{"key":"2705_CR14","doi-asserted-by":"crossref","unstructured":"Kaliaperumal R, Ramalingam A, Sripriya J (2015) A modified two part chromosome crossover for solving MTSP using genetic algorithms. In: Proceedings ICARCSET, New York, 2015, pp 1\u20134","DOI":"10.1145\/2743065.2743103"},{"key":"2705_CR15","unstructured":"Kiraly A, Abonyi J (2011) Optimization of Multiple Traveling Salesmen Problem by a Novel Representation Based Genetic Algorithm, in International Computational in Engineering. Vol. 366, pp. 241-269"},{"key":"2705_CR16","doi-asserted-by":"crossref","unstructured":"Li J (2013) An improved dynamic programming algorithm for bitonic TSP. In Proceedings ISCCCA-13, Paris, France, pp 24\u201327","DOI":"10.2991\/isccca.2013.7"},{"issue":"02","key":"2705_CR17","first-page":"247","volume":"23","author":"M Liu","year":"2014","unstructured":"Liu M, Zhang PY (2014) New hybrid genetic algorithm for solving the multiple traveling saleman problem: an example of distribution of emergence materials. J Syst Manag 23(02):247\u2013254","journal-title":"J Syst Manag"},{"key":"2705_CR18","doi-asserted-by":"crossref","unstructured":"Liu Y, Shen X, Chen H (2012) An adaptive ant colony algorithm based on common information for solving the traveling salesman problem. In: Proceedings Shandong, ICSAI, pp 763\u2013766","DOI":"10.1109\/ICSAI.2012.6223122"},{"key":"2705_CR19","doi-asserted-by":"crossref","unstructured":"Mahfoudh SS, Khaznaji W, Bellalouna M (2015) A branch and bound algorithm for the porbabilistic traveling salesman problem. In: Proceedings Takamatsu, SNPD, pp 1\u20136","DOI":"10.1109\/SNPD.2015.7176284"},{"key":"2705_CR20","doi-asserted-by":"crossref","unstructured":"Masmoudi M, Mellouli R (2014) MILP for synchronized-mTSPTW: application to home healthCare scheduling. In: Proceedings Metz, CoDIT, pp 297\u2013302","DOI":"10.1109\/CoDIT.2014.6996910"},{"key":"2705_CR21","unstructured":"Pham DT, Huynh TTB (2015) New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem, in knowledge and systems engineering, 2nd ed., vol 326, Switzerland, pp 367\u2013379"},{"key":"2705_CR22","unstructured":"Singh G, Mehta R (2014) Implementation of travelling salesman problem using ant colony optimization. J Eng Res Appl 6(3):385\u2013389"},{"key":"2705_CR23","doi-asserted-by":"crossref","unstructured":"Wang Y (2014) A nearest neighbor method with a frequency graph for traveling salesman problem. In: Proceedings IHMSC. Hangzhou, pp 335\u2013338","DOI":"10.1109\/IHMSC.2014.88"},{"key":"2705_CR24","doi-asserted-by":"crossref","unstructured":"Ye C, Yang ZC, Yan TX (2014) An efficient and scalable algorithm for the traveling salesman problem. In: Proceedings Beijing, ICSESS, pp 335\u2013339","DOI":"10.1109\/ICSESS.2014.6933576"},{"issue":"6","key":"2705_CR25","first-page":"264","volume":"9","author":"XS Yan","year":"2012","unstructured":"Yan XS, Zhang C, Luo WJ et al (2012) Solve traveling salesman problem using particle swarm optimization algorithm. Int J Comput Sci Issues 9(6):264\u2013271","journal-title":"Int J Comput Sci Issues"},{"issue":"1","key":"2705_CR26","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.ejor.2013.01.043","volume":"228","author":"S Yuan","year":"2013","unstructured":"Yuan S, Skinner B, Huang S, Liu D (2013) A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms. Eur J Oper Res 228(1):72\u201382","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2705-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2705-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2705-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,29]],"date-time":"2019-09-29T14:20:13Z","timestamp":1569766813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2705-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,12]]},"references-count":26,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["2705"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2705-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,12]]}}}