{"id":"https://openalex.org/W4416237347","doi":"https://doi.org/10.48550/arxiv.2511.09563","title":"An Efficient and Almost Optimal Solver for the Joint Routing-Assignment Problem via Partial JRA and Large-\u03b1 Optimization","display_name":"An Efficient and Almost Optimal Solver for the Joint Routing-Assignment Problem via Partial JRA and Large-\u03b1 Optimization","publication_year":2025,"publication_date":"2025-11-07","ids":{"openalex":"https://openalex.org/W4416237347","doi":"https://doi.org/10.48550/arxiv.2511.09563"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2511.09563","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.09563","pdf_url":"https://arxiv.org/pdf/2511.09563","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2511.09563","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103168228","display_name":"Qilong Yuan","orcid":"https://orcid.org/0000-0003-1087-1793"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yuan, Qilong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5103168228"],"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9711999893188477,"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.9711999893188477,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.0038999998942017555,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.00279999990016222,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.824999988079071},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5896000266075134},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5400000214576721},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5281000137329102},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43779999017715454},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.43130001425743103},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4097999930381775},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.35830000042915344}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.824999988079071},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7389000058174133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5922999978065491},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5896000266075134},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5400000214576721},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5281000137329102},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43779999017715454},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.43130001425743103},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4097999930381775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40720000863075256},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.33009999990463257},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3231000006198883},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2511.09563","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.09563","pdf_url":"https://arxiv.org/pdf/2511.09563","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.09563","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.09563","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2511.09563","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.09563","pdf_url":"https://arxiv.org/pdf/2511.09563","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,106,242],"Joint":[1],"Routing-Assignment":[2],"(JRA)":[3],"optimization":[4,167,251],"problem":[5],"simultaneously":[6],"determines":[7],"the":[8,26,52,86,133,140,150,155,166,182,204,219,228,231],"assignment":[9],"of":[10,28,216],"items":[11],"to":[12,122,131,169,185,247],"placeholders":[13],"and":[14,45,74,93,200,234,249],"a":[15,46,91,110,124,175],"Hamiltonian":[16],"cycle":[17],"that":[18,50,97,116,203],"visits":[19],"each":[20],"node":[21],"pair":[22],"exactly":[23],"once,":[24],"with":[25,43,161,195],"objective":[27],"minimizing":[29],"total":[30],"travel":[31],"cost.":[32],"Previous":[33],"studies":[34],"introduced":[35],"an":[36,213],"exact":[37,53],"mixed-integer":[38],"programming":[39],"(MIP)":[40],"solver,":[41],"along":[42,165],"datasets":[44,194],"Gurobi":[47],"implementation,":[48],"showing":[49],"while":[51,222],"approach":[54,96],"guarantees":[55],"optimality,":[56],"it":[57],"becomes":[58],"computationally":[59],"inefficient":[60],"for":[61,102,239],"large-scale":[62,103],"instances.":[63],"To":[64],"overcome":[65],"this":[66,137],"limitation,":[67],"heuristic":[68,142],"methods":[69],"based":[70,163],"on":[71,192],"merging":[72,143],"algorithms":[73],"shaking":[75],"procedures":[76],"were":[77],"proposed,":[78],"achieving":[79,212],"solutions":[80,101,144],"within":[81],"approximately":[82],"1%":[83],"deviation":[84,151,215],"from":[85,218],"optimum.":[87],"This":[88],"work":[89],"presents":[90],"novel":[92],"more":[94],"efficient":[95],"attains":[98],"high-accuracy,":[99],"near-optimal":[100],"JRA":[104,183,229],"problems.":[105,252],"proposed":[107,205,232],"method":[108,206],"introduces":[109],"Partial":[111],"Path":[112],"Reconstructon":[113],"(PPR)":[114],"solver":[115,164],"first":[117],"identifies":[118],"key":[119],"item-placeholder":[120],"pairs":[121],"form":[123],"reduced":[125],"subproblem,":[126],"which":[127],"is":[128,179],"solved":[129],"efficiently":[130],"refine":[132],"global":[134,176],"solution.":[135],"Using":[136],"PJAR":[138],"framework,":[139],"initial":[141],"can":[145,157,244],"be":[146,158,245],"further":[147,186],"improved,":[148],"reducing":[149],"by":[152],"half.":[153],"Moreover,":[154],"solution":[156,188],"iteratively":[159],"polished":[160],"PPR":[162],"path":[168],"yield":[170],"highly":[171],"accurate":[172],"tours.":[173],"Additionally,":[174],"Large-\u03b1":[177],"constraint":[178],"incorporated":[180],"into":[181],"model":[184],"enhance":[187],"optimality.":[189],"Experimental":[190],"evaluations":[191],"benchmark":[193],"n":[196],"=":[197],"300,":[198],"500,":[199],"1000":[201],"demonstrate":[202],"consistently":[207],"delivers":[208],"almost":[209],"optimal":[210],"solutions,":[211],"average":[214],"0.00%":[217],"ground":[220],"truth":[221],"maintaining":[223],"high":[224],"computational":[225],"efficiency.":[226],"Beyond":[227],"problem,":[230],"framework":[233],"methodologies":[235],"exhibit":[236],"strong":[237],"potential":[238],"broader":[240],"applications.":[241],"Framework":[243],"applied":[246],"TSP":[248],"related":[250]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-11-15T00:00:00"}