{"id":"https://openalex.org/W4405778624","doi":"https://doi.org/10.1109/iros58592.2024.10802039","title":"iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning","display_name":"iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning","publication_year":2024,"publication_date":"2024-10-14","ids":{"openalex":"https://openalex.org/W4405778624","doi":"https://doi.org/10.1109/iros58592.2024.10802039"},"language":"en","primary_location":{"id":"doi:10.1109/iros58592.2024.10802039","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10802039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100314494","display_name":"Yifan Guo","orcid":"https://orcid.org/0009-0002-5176-9699"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yifan Guo","raw_affiliation_strings":["Purdue University,Flight Dynamics & Control/Hybrid Systems Lab,West Lafayette,IN,47907"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University,Flight Dynamics & Control/Hybrid Systems Lab,West Lafayette,IN,47907","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018561143","display_name":"Zhongqiang Ren","orcid":"https://orcid.org/0000-0003-2880-8653"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["Carnegie Mellon University,Robotics Institute,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Robotics Institute,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100340740","display_name":"Wang Chen","orcid":"https://orcid.org/0000-0001-7892-3575"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen Wang","raw_affiliation_strings":["University at Buffalo,Spatial AI & Robotics (SAIR) Lab,Department of Computer Science and Engineering,NY,USA,14260"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University at Buffalo,Spatial AI & Robotics (SAIR) Lab,Department of Computer Science and Engineering,NY,USA,14260","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"10245","last_page":"10252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.8478999733924866,"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"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.8478999733924866,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.771399974822998,"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.6991000175476074,"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.9259637594223022},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6345267295837402},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6319335103034973},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.6290333867073059},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6206768155097961},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4587898254394531},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2630390524864197},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19467175006866455}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9259637594223022},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6345267295837402},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6319335103034973},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.6290333867073059},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6206768155097961},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4587898254394531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2630390524864197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19467175006866455}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros58592.2024.10802039","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10802039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W2050819731","https://openalex.org/W2127052460","https://openalex.org/W2249989021","https://openalex.org/W2607264901","https://openalex.org/W2766736793","https://openalex.org/W2796035444","https://openalex.org/W2910105989","https://openalex.org/W2915338839","https://openalex.org/W2920821075","https://openalex.org/W2946288012","https://openalex.org/W2962760547","https://openalex.org/W2964117926","https://openalex.org/W2984503484","https://openalex.org/W3005764631","https://openalex.org/W3040879766","https://openalex.org/W3129736740","https://openalex.org/W3146106549","https://openalex.org/W3205558891","https://openalex.org/W3206820044","https://openalex.org/W4241811150","https://openalex.org/W4310533732","https://openalex.org/W4319459158","https://openalex.org/W4324031535","https://openalex.org/W4367281433","https://openalex.org/W4382469071","https://openalex.org/W4385245566","https://openalex.org/W4385430747","https://openalex.org/W4393285927","https://openalex.org/W4403068931","https://openalex.org/W6676023451","https://openalex.org/W6725207838","https://openalex.org/W6736685754","https://openalex.org/W6738741286","https://openalex.org/W6745515306","https://openalex.org/W6748487558","https://openalex.org/W6751300517","https://openalex.org/W6755202075","https://openalex.org/W6758687306","https://openalex.org/W6765145614","https://openalex.org/W6773817997","https://openalex.org/W6793739563","https://openalex.org/W6796228758","https://openalex.org/W6802180043"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2362402143","https://openalex.org/W2265604726","https://openalex.org/W2033053473","https://openalex.org/W2495211334"],"abstract_inverted_index":{"This":[0,105],"paper":[1],"considers":[2],"a":[3,16,94,139,166],"Min-Max":[4],"Multiple":[5],"Traveling":[6],"Salesman":[7],"Problem":[8],"(MTSP),":[9],"where":[10],"the":[11,28,32,35,65,99,113,134,157,162,188],"goal":[12],"is":[13,50,129],"to":[14,24,54,79,132,149,155,183,196],"find":[15,194],"set":[17],"of":[18,34,64,101],"tours,":[19],"one":[20],"for":[21,47,67],"each":[22],"agent,":[23],"collectively":[25],"visit":[26],"all":[27],"cities":[29,213],"while":[30],"minimizing":[31],"length":[33,200],"longest":[36,123],"tour.":[37],"Though":[38],"MTSP":[39,92,114,152,205],"has":[40],"been":[41],"widely":[42],"studied,":[43],"obtaining":[44],"near-optimal":[45],"solutions":[46,128],"large-scale":[48,209],"problems":[49,120,210],"still":[51],"challenging":[52],"due":[53],"its":[55],"NP-hardness.":[56],"Recent":[57],"efforts":[58],"in":[59,75,138,208],"data-driven":[60],"methods":[61],"face":[62],"challenges":[63],"need":[66],"hard-to-obtain":[68],"supervision":[69],"and":[70,82,193,214],"issues":[71,89,160],"with":[72,202],"high":[73],"variance":[74],"gradient":[76,159,169,181],"estimations,":[77],"leading":[78],"slow":[80],"convergence":[81],"highly":[83],"sub-optimal":[84],"solutions.":[85],"We":[86],"address":[87],"these":[88,126,176],"by":[90],"reformulating":[91],"as":[93,150],"bilevel":[95],"optimization":[96],"problem,":[97],"using":[98],"concept":[100],"imperative":[102,151],"learning":[103,144,191],"(IL).":[104],"involves":[106],"introducing":[107],"an":[108],"allocation":[109,135],"network":[110],"that":[111,175],"decomposes":[112],"into":[115],"multiple":[116],"single-agent":[117],"traveling":[118],"salesman":[119],"(TSPs).":[121],"The":[122],"tour":[124,199],"from":[125],"TSP":[127],"then":[130],"used":[131],"self-supervise":[133],"network,":[136],"resulting":[137],"new":[140],"self-supervised,":[141],"bilevel,":[142],"end-to-end":[143],"framework,":[145],"which":[146],"we":[147,164],"refer":[148],"(iMTSP).":[153],"Additionally,":[154],"tackle":[156],"high-variance":[158],"during":[161],"optimization,":[163],"introduce":[165],"control":[167],"variate-based":[168],"estimation":[170],"algorithm.":[171],"Our":[172],"experiments":[173],"showed":[174],"innovative":[177],"designs":[178],"enable":[179],"our":[180],"estimator":[182],"converge":[184],"20\u00d7":[185],"faster":[186],"than":[187],"advanced":[189],"reinforcement":[190],"baseline,":[192],"up":[195],"80%":[197],"shorter":[198],"compared":[201],"Google":[203],"OR-Tools":[204],"solver,":[206],"especially":[207],"(e.g.":[211],"1000":[212],"15":[215],"agents).":[216]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}