{"id":"https://openalex.org/W2735772617","doi":"https://doi.org/10.23919/acc.2017.7963559","title":"Multiple traveling salesmen and related problems: A maximum-entropy principle based approach","display_name":"Multiple traveling salesmen and related problems: A maximum-entropy principle based approach","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2735772617","doi":"https://doi.org/10.23919/acc.2017.7963559","mag":"2735772617"},"language":"en","primary_location":{"id":"doi:10.23919/acc.2017.7963559","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2017.7963559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 American Control Conference (ACC)","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/A5085311610","display_name":"Mayank Baranwal","orcid":"https://orcid.org/0000-0001-9354-2826"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mayank Baranwal","raw_affiliation_strings":["Department of Mechanical Science and Engineering, University of Illinois at Urbana-Champaign, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Science and Engineering, University of Illinois at Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014275023","display_name":"Brian Roehl","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian Roehl","raw_affiliation_strings":["Department of Mechanical Science and Engineering, University of Illinois at Urbana-Champaign, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Science and Engineering, University of Illinois at Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051680600","display_name":"Srinivasa M. Salapaka","orcid":"https://orcid.org/0000-0002-3259-6027"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Srinivasa M. Salapaka","raw_affiliation_strings":["Department of Mechanical Science and Engineering, University of Illinois at Urbana-Champaign, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Science and Engineering, University of Illinois at Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085311610"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":1.5054,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85085244,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"3944","last_page":"3949"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958000183105469,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958000183105469,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10698","display_name":"Transportation Planning and Optimization","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.857059121131897},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7762936949729919},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7347670197486877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.606597900390625},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.5516300797462463},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.538806676864624},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5201773643493652},{"id":"https://openalex.org/keywords/cross-entropy-method","display_name":"Cross-entropy method","score":0.4399419128894806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36714309453964233},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3432314395904541},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.27055174112319946},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16401317715644836},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.06532943248748779}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.857059121131897},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7762936949729919},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7347670197486877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.606597900390625},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.5516300797462463},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.538806676864624},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5201773643493652},{"id":"https://openalex.org/C75782508","wikidata":"https://www.wikidata.org/wiki/Q3333633","display_name":"Cross-entropy method","level":4,"score":0.4399419128894806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36714309453964233},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3432314395904541},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27055174112319946},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16401317715644836},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.06532943248748779},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc.2017.7963559","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2017.7963559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W76530103","https://openalex.org/W1508183291","https://openalex.org/W1521430106","https://openalex.org/W1596059437","https://openalex.org/W1823091789","https://openalex.org/W1992249619","https://openalex.org/W2002730737","https://openalex.org/W2018660239","https://openalex.org/W2050819731","https://openalex.org/W2099263473","https://openalex.org/W2112733682","https://openalex.org/W2119217175","https://openalex.org/W2161877964","https://openalex.org/W2163428398","https://openalex.org/W2253899129","https://openalex.org/W2962953008","https://openalex.org/W6654935975"],"related_works":["https://openalex.org/W2392101695","https://openalex.org/W2361943787","https://openalex.org/W4312532478","https://openalex.org/W2411789204","https://openalex.org/W2271841533","https://openalex.org/W4297427155","https://openalex.org/W2975368677","https://openalex.org/W3025823153","https://openalex.org/W3136451934","https://openalex.org/W3200006077"],"abstract_inverted_index":{"This":[0],"paper":[1,160],"presents":[2],"a":[3,56,65,145,151],"new":[4,166],"heuristic":[5],"approach":[6,68,127],"for":[7,103,128,168],"multiple":[8,84],"traveling":[9,131],"salesmen":[10],"problem":[11,108,133],"(mTSP)":[12],"and":[13,24,45,90,116,172],"other":[14,91],"variants":[15,26,96,174],"of":[16,38,147,153,164],"the":[17,22,43,46,95,98,104,117,162,179,188,192],"TSP.":[18],"In":[19],"this":[20,123,126,159,165],"approach,":[21],"TSP":[23,99,171],"its":[25],"are":[27],"seen":[28],"as":[29,79,87],"constrained":[30],"resource":[31,106],"allocation":[32,47,107],"problems,":[33],"where":[34],"an":[35,51],"ordered":[36],"set":[37],"resources":[39,73],"is":[40,48,109,136,144],"associated":[41,63,105],"to":[42,76,138],"cities,":[44],"done":[49],"through":[50],"iterative":[52],"algorithm":[53,102,182,198],"in":[54,88,158,170,203],"such":[55,78],"way":[57],"that":[58,93,178],"eventually":[59],"each":[60],"city":[61],"gets":[62],"with":[64,199],"resource.":[66],"The":[67,101,155],"allows":[69],"adding":[70],"constraints":[71,92],"on":[72,97,111],"which":[74,135],"translate":[75],"objectives":[77],"minimum":[80],"tour":[81,85],"length":[82],"(or":[83],"lengths":[86],"mTSP)":[89],"define":[94],"problem.":[100],"based":[110],"maximum":[112],"entropy":[113],"principle":[114],"(MEP)":[115],"deterministic":[118],"annealing":[119,197],"algorithm.":[120],"Besides":[121],"mTSP,":[122],"article":[124],"demonstrates":[125],"close":[129],"enough":[130],"salesman":[132],"(CETSP),":[134],"known":[137],"be":[139],"computationally":[140],"challenging":[141],"since":[142],"there":[143],"continuum":[146],"possible":[148],"edges":[149],"between":[150],"pair":[152],"cities.":[154],"examples":[156],"presented":[157],"illustrate":[161],"effectiveness":[163],"framework":[167],"use":[169],"many":[173],"thereof.":[175],"Simulations":[176],"demonstrate":[177],"proposed":[180],"MEP":[181],"achieves":[183],"significantly":[184],"better":[185],"solutions":[186],"than":[187],"ones":[189],"provided":[190],"by":[191],"most":[193],"commonly":[194],"used":[195],"simulated":[196],"only":[200],"marginal":[201],"increase":[202],"run-time.":[204]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}