{"id":"https://openalex.org/W4319978025","doi":"https://doi.org/10.1109/cipae55637.2022.00088","title":"Research on multi-traveling salesman problem based on simulated annealing algorithm","display_name":"Research on multi-traveling salesman problem based on simulated annealing algorithm","publication_year":2022,"publication_date":"2022-08-01","ids":{"openalex":"https://openalex.org/W4319978025","doi":"https://doi.org/10.1109/cipae55637.2022.00088"},"language":"en","primary_location":{"id":"doi:10.1109/cipae55637.2022.00088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipae55637.2022.00088","pdf_url":null,"source":{"id":"https://openalex.org/S4363608510","display_name":"2022 International Conference on Computers, Information Processing and Advanced Education (CIPAE)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Computers, Information Processing and Advanced Education (CIPAE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068599283","display_name":"Wenming Xia","orcid":"https://orcid.org/0000-0002-9609-6064"},"institutions":[{"id":"https://openalex.org/I4210161807","display_name":"Taizhou Vocational and Technical College","ror":"https://ror.org/05pt0p091","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210161807"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wenming Xia","raw_affiliation_strings":["School of Mechanical Engineering Electrical and Mould, Taizhou Vocational College of Science,Taizhou,China","School of Mechanical Engineering Electrical and Mould, Taizhou Vocational College of Science, Taizhou, China"],"affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering Electrical and Mould, Taizhou Vocational College of Science,Taizhou,China","institution_ids":["https://openalex.org/I4210161807"]},{"raw_affiliation_string":"School of Mechanical Engineering Electrical and Mould, Taizhou Vocational College of Science, Taizhou, China","institution_ids":["https://openalex.org/I4210161807"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101497185","display_name":"Guofu Li","orcid":"https://orcid.org/0000-0001-5838-5722"},"institutions":[{"id":"https://openalex.org/I109935558","display_name":"Ningbo University","ror":"https://ror.org/03et85d35","country_code":"CN","type":"education","lineage":["https://openalex.org/I109935558"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guofu Li","raw_affiliation_strings":["School of Mechanical Engineering and Mechanics, Ningbo University,Ningbo,China","School of Mechanical Engineering and Mechanics, Ningbo University, Ningbo, China"],"affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering and Mechanics, Ningbo University,Ningbo,China","institution_ids":["https://openalex.org/I109935558"]},{"raw_affiliation_string":"School of Mechanical Engineering and Mechanics, Ningbo University, Ningbo, China","institution_ids":["https://openalex.org/I109935558"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111410172","display_name":"Yuyan Zeng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuyan Zeng","raw_affiliation_strings":["Taizou Hoolea Mould Co. Ltd,Research and Development Department,Taizhou,China","Research and Development Department, Taizou Hoolea Mould Co. Ltd, Taizhou, China"],"affiliations":[{"raw_affiliation_string":"Taizou Hoolea Mould Co. Ltd,Research and Development Department,Taizhou,China","institution_ids":[]},{"raw_affiliation_string":"Research and Development Department, Taizou Hoolea Mould Co. Ltd, Taizhou, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068599283"],"corresponding_institution_ids":["https://openalex.org/I4210161807"],"apc_list":null,"apc_paid":null,"fwci":0.1199,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.46820191,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"390","last_page":"393"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9815000295639038,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9609000086784363,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9491387605667114},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.7295562624931335},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6978750228881836},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6953463554382324},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6275317668914795},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5852601528167725},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5806550979614258},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.4924539029598236},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.445323646068573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43638160824775696},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2786371409893036}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9491387605667114},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.7295562624931335},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6978750228881836},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6953463554382324},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6275317668914795},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5852601528167725},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5806550979614258},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.4924539029598236},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.445323646068573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43638160824775696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2786371409893036},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cipae55637.2022.00088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipae55637.2022.00088","pdf_url":null,"source":{"id":"https://openalex.org/S4363608510","display_name":"2022 International Conference on Computers, Information Processing and Advanced Education (CIPAE)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Computers, Information Processing and Advanced Education (CIPAE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7599999904632568,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1969606507","https://openalex.org/W2048424596","https://openalex.org/W2119178547","https://openalex.org/W2144571961","https://openalex.org/W2616036777","https://openalex.org/W2883819615","https://openalex.org/W2898231767","https://openalex.org/W2929257666"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W1595757466","https://openalex.org/W4200179302","https://openalex.org/W2766731260","https://openalex.org/W1645834615","https://openalex.org/W2171568915","https://openalex.org/W3210931532","https://openalex.org/W2620231896","https://openalex.org/W4376138746","https://openalex.org/W87675801"],"abstract_inverted_index":{"As":[0],"an":[1],"extension":[2],"of":[3,29,44,60,97,111],"the":[4,8,26,30,34,41,50,58,61,65,72,76,85,90,98,109],"traveling":[5],"salesman":[6,10,36,47,87],"problem,":[7,18],"multi-traveling":[9],"problem":[11,37],"is":[12,100],"also":[13],"a":[14,78,103],"typical":[15],"NP":[16],"hard":[17],"but":[19],"it":[20,107],"has":[21],"wider":[22],"practical":[23],"significance.":[24],"In":[25,53],"past,":[27],"most":[28],"research":[31],"on":[32,57],"solving":[33],"multi-travel":[35,86],"was":[38,81],"limited":[39],"to":[40,83],"minimum":[42,62],"sum":[43],"all":[45],"travel":[46,63,69],"paths":[48],"as":[49],"optimization":[51],"standard.":[52],"this":[54],"paper,":[55],"based":[56],"constraints":[59],"quotient,":[64],"path":[66,88],"balance":[67],"among":[68],"agents,":[70],"and":[71,106],"time":[73],"window":[74],"traversing":[75],"city,":[77],"mathematical":[79],"model":[80],"established":[82],"optimize":[84],"using":[89],"improved":[91],"simulated":[92],"annealing":[93],"algorithm.":[94],"The":[95],"feasibility":[96],"algorithm":[99],"verified":[101],"by":[102],"simulation":[104],"example,":[105],"meets":[108],"requirements":[110],"real-time":[112],"performance.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}