{"id":"https://openalex.org/W4408898079","doi":"https://doi.org/10.1109/secon64284.2024.10934896","title":"Budget-Constrained Traveling Salesman Problem: a Cooperative Multi-Agent Reinforcement Learning Approach","display_name":"Budget-Constrained Traveling Salesman Problem: a Cooperative Multi-Agent Reinforcement Learning Approach","publication_year":2024,"publication_date":"2024-12-02","ids":{"openalex":"https://openalex.org/W4408898079","doi":"https://doi.org/10.1109/secon64284.2024.10934896"},"language":"en","primary_location":{"id":"doi:10.1109/secon64284.2024.10934896","is_oa":false,"landing_page_url":"https://doi.org/10.1109/secon64284.2024.10934896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 21st Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","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/A5109758040","display_name":"Ka Fung Henry Mak","orcid":null},"institutions":[{"id":"https://openalex.org/I290598920","display_name":"California State University, Dominguez Hills","ror":"https://ror.org/04pyvbw03","country_code":"US","type":"education","lineage":["https://openalex.org/I290598920"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"King To Mak","raw_affiliation_strings":["California State University,Department of Computer Science,Dominguez Hills"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California State University,Department of Computer Science,Dominguez Hills","institution_ids":["https://openalex.org/I290598920"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101513939","display_name":"Christopher Gonz\u00e1lez","orcid":"https://orcid.org/0000-0002-0626-8601"},"institutions":[{"id":"https://openalex.org/I290598920","display_name":"California State University, Dominguez Hills","ror":"https://ror.org/04pyvbw03","country_code":"US","type":"education","lineage":["https://openalex.org/I290598920"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christopher Gonzalez","raw_affiliation_strings":["California State University,Department of Computer Science,Dominguez Hills"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California State University,Department of Computer Science,Dominguez Hills","institution_ids":["https://openalex.org/I290598920"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5116820999","display_name":"Zari Magnaye","orcid":null},"institutions":[{"id":"https://openalex.org/I290598920","display_name":"California State University, Dominguez Hills","ror":"https://ror.org/04pyvbw03","country_code":"US","type":"education","lineage":["https://openalex.org/I290598920"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zari Magnaye","raw_affiliation_strings":["California State University,Department of Computer Science,Dominguez Hills"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California State University,Department of Computer Science,Dominguez Hills","institution_ids":["https://openalex.org/I290598920"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087758612","display_name":"Jessica Gonz\u00e1lez","orcid":"https://orcid.org/0000-0002-6847-5315"},"institutions":[{"id":"https://openalex.org/I290598920","display_name":"California State University, Dominguez Hills","ror":"https://ror.org/04pyvbw03","country_code":"US","type":"education","lineage":["https://openalex.org/I290598920"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jessica Gonzalez","raw_affiliation_strings":["California State University,Department of Computer Science,Dominguez Hills"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California State University,Department of Computer Science,Dominguez Hills","institution_ids":["https://openalex.org/I290598920"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101904982","display_name":"Yutian Chen","orcid":"https://orcid.org/0000-0002-3118-4389"},"institutions":[{"id":"https://openalex.org/I59897056","display_name":"California State University, Long Beach","ror":"https://ror.org/0080fxk18","country_code":"US","type":"education","lineage":["https://openalex.org/I59897056"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yutian Chen","raw_affiliation_strings":["California State University,Economics Department,Long Beach"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California State University,Economics Department,Long Beach","institution_ids":["https://openalex.org/I59897056"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101402778","display_name":"Bin Tang","orcid":"https://orcid.org/0000-0003-2710-9076"},"institutions":[{"id":"https://openalex.org/I290598920","display_name":"California State University, Dominguez Hills","ror":"https://ror.org/04pyvbw03","country_code":"US","type":"education","lineage":["https://openalex.org/I290598920"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bin Tang","raw_affiliation_strings":["California State University,Department of Computer Science,Dominguez Hills"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California State University,Department of Computer Science,Dominguez Hills","institution_ids":["https://openalex.org/I290598920"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9258000254631042,"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/T11182","display_name":"Auction Theory and Applications","score":0.9258000254631042,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9126999974250793,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"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.8886041641235352},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.7874330878257751},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6477041840553284},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5094714760780334},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5025300979614258},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4966655373573303},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.4784296154975891},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4124772250652313},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3208109140396118},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1757012903690338},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11599218845367432}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8886041641235352},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7874330878257751},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6477041840553284},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5094714760780334},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5025300979614258},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4966655373573303},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.4784296154975891},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4124772250652313},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3208109140396118},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1757012903690338},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11599218845367432}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/secon64284.2024.10934896","is_oa":false,"landing_page_url":"https://doi.org/10.1109/secon64284.2024.10934896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 21st Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","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":37,"referenced_works":["https://openalex.org/W1566652554","https://openalex.org/W1968594877","https://openalex.org/W1977655452","https://openalex.org/W1995327008","https://openalex.org/W2017938154","https://openalex.org/W2082400728","https://openalex.org/W2085147795","https://openalex.org/W2088036356","https://openalex.org/W2114832965","https://openalex.org/W2120327309","https://openalex.org/W2129105694","https://openalex.org/W2343633712","https://openalex.org/W2343988619","https://openalex.org/W2346699423","https://openalex.org/W2600422751","https://openalex.org/W2896811665","https://openalex.org/W2898731180","https://openalex.org/W2948266528","https://openalex.org/W3047863327","https://openalex.org/W3100789280","https://openalex.org/W3128707967","https://openalex.org/W3129246858","https://openalex.org/W3129736740","https://openalex.org/W3170112077","https://openalex.org/W3211583675","https://openalex.org/W4296872783","https://openalex.org/W4387872607","https://openalex.org/W4403760123","https://openalex.org/W6630520071","https://openalex.org/W6632558091","https://openalex.org/W6633472260","https://openalex.org/W6684470913","https://openalex.org/W6730742100","https://openalex.org/W6736495275","https://openalex.org/W6744110128","https://openalex.org/W6748487558","https://openalex.org/W6774220362"],"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/W8433631"],"abstract_inverted_index":{"We":[0,32],"study":[1],"a":[2,22,34,57,76],"new":[3],"variation":[4],"of":[5,48,94,102,112,116,135,148,150,179],"the":[6,12,43,49,60,66,85,91,95,99,117,123,126,139,155,168,183],"Traveling":[7,14],"Salesman":[8,15],"Problem":[9,16],"(TSP)":[10],"called":[11],"Budget-Constrained":[13],"(BC-TSP).":[17],"BC-TSP":[18,64],"is":[19,53],"inspired":[20],"by":[21,131,182],"few":[23],"emerging":[24],"network":[25,190],"applications,":[26],"such":[27],"as":[28],"robotic":[29],"sensor":[30],"networks.":[31],"design":[33,75],"prize-driven":[35],"multi-agent":[36],"reinforcement":[37,71,158],"learning":[38,72,104],"(MARL)":[39],"framework":[40],"to":[41,74,97],"solve":[42],"BC-TSP.":[44],"The":[45],"main":[46],"novelty":[47],"framework,":[50],"named":[51],"P-MARL,":[52],"that":[54,121],"it":[55,144],"makes":[56],"connection":[58],"between":[59],"prize":[61],"maximization":[62,69],"in":[63,70],"and":[65,171],"cumulative":[67],"reward":[68,92],"(RL)":[73],"more":[77,136,165],"efficient":[78],"MARL":[79,96,129],"algorithm.":[80],"In":[81],"particular,":[82],"P-MARL":[83,124,173],"integrates":[84],"prizes":[86,137,166,175],"available":[87],"at":[88,176],"nodes":[89],"into":[90],"model":[93],"guide":[98],"cooperative":[100],"effort":[101],"multiple":[103],"agents.":[105],"Via":[106],"extensive":[107],"simulations":[108],"using":[109],"synthetic":[110],"data":[111],"state":[113],"capital":[114],"cities":[115],"U.S.,":[118],"we":[119],"show":[120],"a)":[122],"outperforms":[125],"existing":[127],"prize-oblivious":[128],"work":[130],"collecting":[132,162],"28.8":[133],"%":[134,164],"under":[138,167,188],"same":[140,169],"budget":[141],"constraints,":[142],"b)":[143],"takes":[145],"two":[146],"orders":[147],"magnitudes":[149],"shorter":[151],"training":[152],"time":[153],"than":[154],"state-of-the-art":[156],"deep":[157],"learning-based":[159],"approach":[160],"while":[161],"45.3":[163],"budgets,":[170],"c)":[172],"collects":[174],"least":[177],"91.9%":[178],"optimal":[180],"obtained":[181],"Integer":[184],"Linear":[185],"Programming":[186],"(ILP)":[187],"different":[189],"parameters.":[191]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
