{"id":"https://openalex.org/W2735355336","doi":"https://doi.org/10.1007/s00500-017-2705-5","title":"Two phase heuristic algorithm for the multiple-travelling salesman problem","display_name":"Two phase heuristic algorithm for the multiple-travelling salesman problem","publication_year":2017,"publication_date":"2017-07-12","ids":{"openalex":"https://openalex.org/W2735355336","doi":"https://doi.org/10.1007/s00500-017-2705-5","mag":"2735355336"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-017-2705-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-017-2705-5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00500-017-2705-5.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs00500-017-2705-5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100777027","display_name":"Xiaolong Xu","orcid":"https://orcid.org/0000-0001-6254-5864"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaolong Xu","raw_affiliation_strings":["Department of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042810252","display_name":"Hao Yuan","orcid":"https://orcid.org/0000-0002-2951-9215"},"institutions":[{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"government","lineage":["https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Yuan","raw_affiliation_strings":["State Key Laboratory of Information Security, Chinese Academy of Sciences, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Information Security, Chinese Academy of Sciences, Beijing, China","institution_ids":["https://openalex.org/I19820366"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052445888","display_name":"Mark Liptrott","orcid":null},"institutions":[{"id":"https://openalex.org/I165525304","display_name":"Edge Hill University","ror":"https://ror.org/028ndzd53","country_code":"GB","type":"education","lineage":["https://openalex.org/I165525304"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mark Liptrott","raw_affiliation_strings":["Department of Computer Science, Edge Hill University, Ormskirk, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Edge Hill University, Ormskirk, UK","institution_ids":["https://openalex.org/I165525304"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053739348","display_name":"Marcello Trovati","orcid":"https://orcid.org/0000-0001-6607-422X"},"institutions":[{"id":"https://openalex.org/I165525304","display_name":"Edge Hill University","ror":"https://ror.org/028ndzd53","country_code":"GB","type":"education","lineage":["https://openalex.org/I165525304"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Marcello Trovati","raw_affiliation_strings":["Department of Computer Science, Edge Hill University, Ormskirk, UK"],"raw_orcid":"https://orcid.org/0000-0001-6607-422X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Edge Hill University, Ormskirk, UK","institution_ids":["https://openalex.org/I165525304"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053739348"],"corresponding_institution_ids":["https://openalex.org/I165525304"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":4.3005,"has_fulltext":true,"cited_by_count":68,"citation_normalized_percentile":{"value":0.95218347,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"22","issue":"19","first_page":"6567","last_page":"6581"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8765592575073242},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6219432353973389},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5710589289665222},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5533561110496521},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.533530592918396},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.5123447179794312},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.49226561188697815},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4737696945667267},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43871474266052246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3036729097366333},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26751190423965454}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8765592575073242},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6219432353973389},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5710589289665222},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5533561110496521},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.533530592918396},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.5123447179794312},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.49226561188697815},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4737696945667267},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43871474266052246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3036729097366333},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26751190423965454}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00500-017-2705-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-017-2705-5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00500-017-2705-5.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/ee68b75b-8958-4068-b7a5-1846a638efcf","is_oa":true,"landing_page_url":"https://research.edgehill.ac.uk/en/publications/ee68b75b-8958-4068-b7a5-1846a638efcf","pdf_url":"https://research.edgehill.ac.uk/ws/files/20203722/article_POST_REVIEW.pdf","source":{"id":"https://openalex.org/S4306402462","display_name":"Edge Hill University Research Information Repository (Edge Hill University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165525304","host_organization_name":"Edge Hill University","host_organization_lineage":["https://openalex.org/I165525304"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Xu, X, Yuan, H, Liptrott, M & Trovati, M 2018, 'Two Phase Heuristic Algorithm for theMultiple-Travelling Salesman Problem', Soft Computing - A Fusion of Foundations, Methodologies and Applications, vol. 22, no. 19, pp. 6567-6581. https://doi.org/10.1007/s00500-017-2705-5","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:publications/ee68b75b-8958-4068-b7a5-1846a638efcf","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85023160201&partnerID=8YFLogxK","pdf_url":"https://research.edgehill.ac.uk/en/publications/ee68b75b-8958-4068-b7a5-1846a638efcf","source":{"id":"https://openalex.org/S4306402462","display_name":"Edge Hill University Research Information Repository (Edge Hill University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165525304","host_organization_name":"Edge Hill University","host_organization_lineage":["https://openalex.org/I165525304"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Xu, X, Yuan, H, Liptrott, M & Trovati, M 2018, 'Two Phase Heuristic Algorithm for theMultiple-Travelling Salesman Problem', Soft Computing - A Fusion of Foundations, Methodologies and Applications, vol. 22, no. 19, pp. 6567-6581. https://doi.org/10.1007/s00500-017-2705-5","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:repository.edgehill.ac.uk:9162","is_oa":false,"landing_page_url":"http://repository.edgehill.ac.uk/9162/1/article_POST_REVIEW.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4406922844","display_name":"Edge Hill University Research Archive","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/s00500-017-2705-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-017-2705-5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00500-017-2705-5.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7200000286102295,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G8862026260","display_name":"\u9762\u5411\u7eff\u8272\u4e91\u8ba1\u7b97\u7684\u8282\u80fd\u578b\u8d44\u6e90\u6574\u5408\u548c\u4efb\u52a1\u8c03\u5ea6\u5173\u952e\u6280\u672f\u7684\u7814\u7a76","funder_award_id":"61472192","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321605","display_name":"Government of Jiangsu Province","ror":"https://ror.org/004svx814"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2735355336.pdf","grobid_xml":"https://content.openalex.org/works/W2735355336.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W184668183","https://openalex.org/W1484312685","https://openalex.org/W1521139502","https://openalex.org/W1608301497","https://openalex.org/W1974999601","https://openalex.org/W1980495840","https://openalex.org/W1999598961","https://openalex.org/W2011039300","https://openalex.org/W2017052626","https://openalex.org/W2030307332","https://openalex.org/W2032142854","https://openalex.org/W2033915107","https://openalex.org/W2061344791","https://openalex.org/W2091437223","https://openalex.org/W2097860440","https://openalex.org/W2119217175","https://openalex.org/W2162949035","https://openalex.org/W2163557644","https://openalex.org/W2182977007","https://openalex.org/W2330394466","https://openalex.org/W2334169000","https://openalex.org/W2372307003","https://openalex.org/W2392369732","https://openalex.org/W3104258108","https://openalex.org/W4232878250","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2359992618","https://openalex.org/W4220987199","https://openalex.org/W2766731260","https://openalex.org/W1966089951","https://openalex.org/W2362402143","https://openalex.org/W2361554335"],"abstract_inverted_index":{"The":[0],"multiple-travelling":[1],"salesman":[2],"problem":[3],"(MTSP)":[4],"is":[5,98,110,152],"a":[6,44,94,140,163,177],"computationally":[7],"complex":[8],"combinatorial":[9],"optimisation":[10],"problem,":[11],"with":[12,118,123],"several":[13],"theoretical":[14],"and":[15],"real-world":[16],"applications.":[17],"However,":[18],"many":[19],"state-of-the-art":[20],"heuristic":[21,64],"approaches":[22],"intended":[23],"to":[24,100,184],"specifically":[25,46],"solve":[26],"MTSP,":[27,68],"do":[28],"not":[29],"obtain":[30],"satisfactory":[31],"solutions":[32],"when":[33],"considering":[34],"an":[35,71],"optimised":[36],"workload":[37,48,165],"balance.":[38],"In":[39,154],"this":[40],"article,":[41],"we":[42,59],"propose":[43],"method":[45,122],"addressing":[47],"balance,":[49],"whilst":[50,167],"minimising":[51,168],"the":[52,61,75,81,102,113,119,124,128,131,137,148,156,170,185],"overall":[53,171],"travelling":[54,172],"salesman\u2019s":[55],"distance.":[56],"More":[57],"specifically,":[58],"introduce":[60],"two":[62],"phase":[63],"algorithm":[65,78,97,115,188],"(TPHA)":[66],"for":[67,105,144],"which":[69],"includes":[70],"improved":[72],"version":[73],"of":[74,130,136,169],"K":[76],"-means":[77],"by":[79],"grouping":[80],"visited":[82],"cities":[83],"based":[84,88,146,190],"on":[85,89,147,191],"their":[86],"locations":[87],"specific":[90],"capacity":[91],"constraints.":[92],"Secondly,":[93],"route":[95,104,186],"planning":[96,187],"designed":[99],"assess":[101],"ideal":[103],"each":[106],"above":[107],"sets.":[108],"This":[109],"achieved":[111],"via":[112],"genetic":[114],"(GA),":[116],"combined":[117],"roulette":[120],"wheel":[121],"elitist":[125],"strategy":[126],"in":[127,180],"design":[129],"selection":[132],"process.":[133],"As":[134],"part":[135],"validation":[138],"process,":[139],"mobile":[141],"guide":[142],"system":[143],"tourists":[145],"Baidu":[149],"electronic":[150],"map":[151],"discussed.":[153],"particular,":[155],"evaluation":[157],"results":[158],"demonstrate":[159],"that":[160],"TPHA":[161],"achieves":[162],"better":[164,178],"balance":[166],"distance,":[173],"as":[174,176],"well":[175],"performance":[179],"solving":[181],"MTSP":[182],"compared":[183],"solely":[189],"GA.":[192]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2017-07-21T00:00:00"}