{"id":"https://openalex.org/W7160651523","doi":"https://doi.org/10.48550/arxiv.2605.05389","title":"Two-Stage Learned Decomposition for Scalable Routing on Multigraphs","display_name":"Two-Stage Learned Decomposition for Scalable Routing on Multigraphs","publication_year":2026,"publication_date":"2026-05-06","ids":{"openalex":"https://openalex.org/W7160651523","doi":"https://doi.org/10.48550/arxiv.2605.05389"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.05389","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.05389","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.05389","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135674344","display_name":"Filip Rydin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rydin, Filip","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103015876","display_name":"Morteza Haghir Chehreghani","orcid":"https://orcid.org/0000-0002-2912-7422"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chehreghani, Morteza Haghir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5122873122","display_name":"Balazs Kulcsar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kulcs\u00e1r, Bal\u00e1zs","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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":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.8970999717712402,"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.8970999717712402,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.007499999832361937,"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"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.006800000090152025,"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/scalability","display_name":"Scalability","score":0.7828999757766724},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6008999943733215},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5952000021934509},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5882999897003174},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5418000221252441},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5126000046730042},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.47049999237060547},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.445499986410141},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.44519999623298645}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7828999757766724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6780999898910522},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6008999943733215},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5952000021934509},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5882999897003174},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5418000221252441},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5126000046730042},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.47049999237060547},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.445499986410141},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.44519999623298645},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.41609999537467957},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.392300009727478},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.37950000166893005},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.36309999227523804},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36059999465942383},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.34850001335144043},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.33489999175071716},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.32679998874664307},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.3221000134944916},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.3199000060558319},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.29829999804496765},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.29670000076293945},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2793000042438507},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2784999907016754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2761000096797943},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.2678999900817871},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2662999927997589},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2565000057220459}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.05389","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.05389","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"doi:10.48550/arxiv.2605.05389","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.05389","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"Most":[0],"neural":[1],"methods":[2,38],"for":[3,41,95],"Vehicle":[4],"Routing":[5],"Problems":[6],"(VRPs)":[7],"are":[8,39],"limited":[9],"to":[10,107],"Euclidean":[11],"settings":[12],"or":[13,122],"simple":[14],"graphs.":[15],"In":[16],"this":[17],"work,":[18],"we":[19,84],"instead":[20],"consider":[21],"multigraphs,":[22],"where":[23],"parallel":[24],"edges":[25],"represent":[26],"distinct":[27],"travel":[28],"options":[29],"with":[30],"varying":[31],"trade-offs":[32],"(e.g.,":[33],"distance":[34],"vs":[35],"time).":[36],"Few":[37],"designed":[40],"such":[42],"formulations":[43],"and":[44,75,91,137],"those":[45],"that":[46,119],"do":[47],"exist":[48],"face":[49],"major":[50],"scalability":[51,56],"issues.":[52],"We":[53],"mitigate":[54],"these":[55],"issues":[57],"via":[58],"a":[59,71,86,92,102],"Node-Edge":[60],"Policy":[61],"Factorization":[62],"(NEPF)":[63],"approach,":[64],"which":[65],"splits":[66],"the":[67,82,96,109,124],"routing":[68],"policy":[69],"into":[70],"node":[72],"permutation":[73],"stage":[74],"an":[76],"edge":[77,88,97],"selection":[78],"stage.":[79],"To":[80],"enable":[81],"decomposition,":[83],"introduce":[85],"pre-encoding":[87],"aggregation":[89],"scheme":[90],"non-autoregressive":[93],"architecture":[94],"stage,":[98],"as":[99,101],"well":[100],"hierarchical":[103],"reinforcement":[104],"learning":[105],"method":[106],"train":[108],"stages":[110],"jointly.":[111],"Our":[112],"experiments":[113],"across":[114],"six":[115],"VRP":[116],"variants":[117],"demonstrate":[118],"NEPF":[120],"matches":[121],"outperforms":[123],"state-of-the-art":[125],"in":[126,135],"terms":[127],"of":[128],"solution":[129],"quality,":[130],"while":[131],"being":[132],"significantly":[133],"faster":[134],"training":[136],"inference.":[138]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-09T00:00:00"}