{"id":"https://openalex.org/W4226057557","doi":"https://doi.org/10.1145/3501774.3501795","title":"The Improvement of Simulated Annealing Algorithm on the Penalty Function in Multi-agent Traveling Salesman Problem","display_name":"The Improvement of Simulated Annealing Algorithm on the Penalty Function in Multi-agent Traveling Salesman Problem","publication_year":2021,"publication_date":"2021-11-19","ids":{"openalex":"https://openalex.org/W4226057557","doi":"https://doi.org/10.1145/3501774.3501795"},"language":"en","primary_location":{"id":"doi:10.1145/3501774.3501795","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3501774.3501795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 2nd European Symposium on Software Engineering","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/A5040323059","display_name":"Tianchen Ren","orcid":"https://orcid.org/0009-0009-5241-4022"},"institutions":[{"id":"https://openalex.org/I4210133467","display_name":"Xi'an Aeronautical University","ror":"https://ror.org/03qn8zy63","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210133467"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Tianchen Ren","raw_affiliation_strings":["Xi'an Aeronautical University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi'an Aeronautical University, China","institution_ids":["https://openalex.org/I4210133467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100459965","display_name":"Jiayi Yang","orcid":"https://orcid.org/0000-0001-5498-5069"},"institutions":[{"id":"https://openalex.org/I152031979","display_name":"Nanjing Normal University","ror":"https://ror.org/036trcv74","country_code":"CN","type":"education","lineage":["https://openalex.org/I152031979"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiayi Yang","raw_affiliation_strings":["Nanjing Normal University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing Normal University, China","institution_ids":["https://openalex.org/I152031979"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100711225","display_name":"Jinxin Li","orcid":"https://orcid.org/0000-0002-3797-5093"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jinxin Li","raw_affiliation_strings":["University of Michigan, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040323059"],"corresponding_institution_ids":["https://openalex.org/I4210133467"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22587634,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"142","last_page":"149"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9901999831199646,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/simulated-annealing","display_name":"Simulated annealing","score":0.8773499727249146},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8104251623153687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6648833751678467},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.6489638090133667},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6295673251152039},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5637837648391724},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5482986569404602},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.4672735929489136},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.44629862904548645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24816465377807617}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.8773499727249146},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8104251623153687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6648833751678467},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.6489638090133667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6295673251152039},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5637837648391724},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5482986569404602},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.4672735929489136},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.44629862904548645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24816465377807617},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3501774.3501795","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3501774.3501795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 2nd European Symposium on Software Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2295081642","https://openalex.org/W2592094003","https://openalex.org/W2885203396","https://openalex.org/W2996129536"],"related_works":["https://openalex.org/W2392101695","https://openalex.org/W2411789204","https://openalex.org/W2271841533","https://openalex.org/W2077092686","https://openalex.org/W2261837478","https://openalex.org/W4297427155","https://openalex.org/W2975368677","https://openalex.org/W3025823153","https://openalex.org/W2116432473","https://openalex.org/W2361943787"],"abstract_inverted_index":{"To":[0,94],"solve":[1,38,73,121],"the":[2,6,39,54,74,80,105,113,122,132],"MTSP":[3,123],"and":[4,43,50,115],"discover":[5],"efficiency":[7],"of":[8,26,56,91],"different":[9],"methods,":[10],"this":[11,99],"paper":[12,100],"compares":[13],"Monte":[14,34],"Carlo":[15,35],"with":[16],"Simulating":[17],"Annealing":[18,70],"Algorithm":[19,71],"by":[20],"testing":[21],"them":[22],"in":[23,112,134],"three":[24],"sizes":[25],"map":[27],"samples":[28],"from":[29],"small":[30],"to":[31,47,103,108,120],"large.":[32,59],"The":[33,68],"can":[36,72],"just":[37],"simple":[40],"TSP":[41],"problems":[42],"become":[44],"useless":[45],"due":[46],"its":[48],"time":[49],"space":[51],"complexity":[52],"when":[53,85,124],"number":[55],"cities":[57],"goes":[58],"Therefore,":[60],"we":[61],"adopt":[62],"a":[63,89,96,117],"heuristic":[64],"algorithm,":[65],"Simulated":[66,69],"Annealing.":[67],"MTSP,":[75],"although":[76],"it":[77],"is":[78],"not":[79],"most":[81],"optimal":[82],"path,":[83],"especially":[84],"an":[86],"agent":[87],"faces":[88],"group":[90,127],"clustered":[92,126],"cities.":[93],"get":[95],"better":[97,118],"result,":[98],"describes":[101],"how":[102],"alternate":[104],"penalty":[106],"function":[107],"set":[109],"some":[110],"limitations":[111],"SAA":[114],"provide":[116],"way":[119],"facing":[125],"locations,":[128],"which":[129],"helps":[130],"optimize":[131],"path":[133],"practice":[135]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}