{"id":"https://openalex.org/W4416054674","doi":"https://doi.org/10.48550/arxiv.2510.17888","title":"Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset","display_name":"Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset","publication_year":2025,"publication_date":"2025-10-18","ids":{"openalex":"https://openalex.org/W4416054674","doi":"https://doi.org/10.48550/arxiv.2510.17888"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2510.17888","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.17888","pdf_url":"https://arxiv.org/pdf/2510.17888","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/2510.17888","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.9351000189781189,"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.9351000189781189,"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/T12176","display_name":"Optimization and Packing Problems","score":0.01600000075995922,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.007400000002235174,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.678600013256073},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6237000226974487},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6103000044822693},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4595000147819519},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.43070000410079956},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4117000102996826},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.33090001344680786}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7289999723434448},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.678600013256073},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6237000226974487},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6103000044822693},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4862000048160553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48159998655319214},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4595000147819519},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.43070000410079956},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4117000102996826},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.33090001344680786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.314300000667572},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2590999901294708},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.25850000977516174},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.2535000145435333}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2510.17888","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.17888","pdf_url":"https://arxiv.org/pdf/2510.17888","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.2510.17888","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.17888","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:2510.17888","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.17888","pdf_url":"https://arxiv.org/pdf/2510.17888","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"a":[2,9,18,25,54],"joint":[3],"routing-assignment":[4],"optimization":[5],"problem":[6,59,91],"in":[7,124],"which":[8],"set":[10,19],"of":[11,20,73,86],"items":[12],"must":[13],"be":[14],"paired":[15],"one-to-one":[16],"with":[17,65,99],"placeholders":[21],"while":[22],"simultaneously":[23],"determining":[24],"Hamiltonian":[26],"cycle":[27],"that":[28],"visits":[29],"every":[30],"node":[31],"exactly":[32],"once.":[33],"Both":[34],"the":[35,45,74,83,90,96,100],"assignment":[36],"and":[37,77,94,112],"routing":[38],"decisions":[39],"are":[40],"optimized":[41],"jointly":[42],"to":[43,56],"minimize":[44],"total":[46],"travel":[47],"cost.":[48],"In":[49],"this":[50,58,87,125],"work,":[51],"we":[52,81],"propose":[53],"method":[55],"solve":[57],"using":[60],"an":[61],"exact":[62],"MIP":[63],"formulation":[64],"Gurobi,":[66],"including":[67],"cutting-plane":[68],"subtour":[69],"elimination.":[70],"With":[71],"analysis":[72],"computational":[75,84],"complexity":[76],"through":[78],"extensive":[79],"experiments,":[80],"analyze":[82],"limitations":[85],"approach":[88],"as":[89,119],"size":[92],"grows":[93],"reveal":[95],"challenges":[97],"associated":[98],"need":[101],"for":[102,106,121],"more":[103],"efficient":[104],"algorithms":[105],"larger":[107],"instances.":[108],"The":[109],"dataset,":[110],"formulations,":[111],"experimental":[113],"results":[114],"provided":[115],"here":[116],"can":[117],"serve":[118],"benchmarks":[120],"future":[122],"studies":[123],"research":[126],"area.":[127],"GitHub":[128],"repository:":[129],"https://github.com/QL-YUAN/Joint-Assignment-Routing-Optimization":[130]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-24T00:00:00"}