{"id":"https://openalex.org/W7125796416","doi":"https://doi.org/10.48550/arxiv.2601.17572","title":"Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows","display_name":"Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows","publication_year":2026,"publication_date":"2026-01-24","ids":{"openalex":"https://openalex.org/W7125796416","doi":"https://doi.org/10.48550/arxiv.2601.17572"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.17572","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.17572","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":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.2601.17572","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123964319","display_name":"Ethan Gibbons","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gibbons, Ethan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017375445","display_name":"Mario Ventresca","orcid":"https://orcid.org/0000-0002-1246-297X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ventresca, Mario","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124039228","display_name":"Beatrice M. Ombuki-Berman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ombuki-Berman, Beatrice M.","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.9955000281333923,"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.9955000281333923,"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.00039999998989515007,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.8057000041007996},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.8057000041007996},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.590499997138977},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.590499997138977},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5759000182151794},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5759000182151794},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5637000203132629},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5637000203132629},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5583000183105469},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5583000183105469},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5055999755859375}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8057000041007996},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8057000041007996},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.590499997138977},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.590499997138977},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5759000182151794},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5759000182151794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5723999738693237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5723999738693237},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5637000203132629},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5637000203132629},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5583000183105469},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5583000183105469},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5397999882698059},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5397999882698059},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5055999755859375},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5055999755859375},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4941999912261963},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4941999912261963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4876999855041504},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4876999855041504},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.46869999170303345},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.46869999170303345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4555000066757202},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4555000066757202},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4523000121116638},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4523000121116638},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.4422000050544739},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.4422000050544739},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.36169999837875366},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.36169999837875366},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.35040000081062317},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.35040000081062317},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.29899999499320984},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.29899999499320984},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2964000105857849},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2964000105857849},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28220000863075256}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.17572","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.17572","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":"doi:10.48550/arxiv.2601.17572","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.17572","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.40800660848617554}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"For":[0,191],"many":[1],"kinds":[2],"of":[3,29,50,65,85,104,127,137,224],"vehicle":[4],"routing":[5],"problems":[6],"(VRPs),":[7],"a":[8,14,23,43,47,68,82,185],"popular":[9,209],"heuristic":[10],"approach":[11],"involves":[12],"constructing":[13],"Traveling":[15],"Salesman":[16],"Problem":[17],"(TSP)":[18],"solution,":[19],"referred":[20],"to":[21,39,118,165,183,199,218],"as":[22],"long":[24,69],"tour,":[25],"then":[26],"partitioning":[27],"segments":[28],"the":[30,55,61,76,124,128,138,174,180,189,192,196,201,208,221],"solution":[31],"into":[32],"routes":[33],"for":[34,54,188],"different":[35],"vehicles":[36],"with":[37,46,81,207],"respect":[38],"problem":[40],"constraints.":[41],"Previously,":[42],"Split":[44,79,98,140,182,198],"algorithm":[45,80,117,162],"worst-case":[48,83],"runtime":[49,84],"$\u0398(n)$":[51,161],"was":[52,72,88],"proposed":[53],"capacitated":[56],"VRP":[57,121,145],"(CVRP)":[58],"that":[59,87,141],"finds":[60],"most":[62],"cost-efficient":[63],"partition":[64],"customers,":[66],"given":[67],"tour.":[70],"This":[71],"an":[73,101,135],"improvement":[74],"over":[75],"previously":[77],"fastest-known":[78],"$\u0398(n^2)$":[86],"based":[89],"on":[90],"Bellman's":[91],"shortest":[92],"path":[93],"algorithm.":[94,129],"While":[95],"this":[96,116,131],"linear":[97,139,181,197,226],"has":[99,111],"been":[100,112],"integral":[102],"part":[103],"modern":[105],"state-of-the-art":[106],"CVRP":[107,202],"approaches,":[108],"little":[109],"progress":[110],"made":[113],"in":[114,205],"extending":[115],"handle":[119,184,200],"additional":[120],"variants,":[122],"limiting":[123],"general":[125],"applicability":[126],"In":[130],"work,":[132],"we":[133,178,194],"propose":[134],"extension":[136],"handles":[142],"two":[143],"cardinal":[144],"variants":[146],"simultaneously:":[147],"(i)":[148],"simultaneous":[149],"pickups":[150],"and":[151,154],"deliveries":[152],"(VRPSPD)":[153],"(ii)":[155],"time":[156,210],"windows":[157],"(VRPTW).":[158],"The":[159],"resulting":[160],"is":[163],"guaranteed":[164],"be":[166],"optimal,":[167],"assuming":[168],"travel":[169],"times":[170],"between":[171],"nodes":[172],"satisfy":[173],"triangle":[175],"inequality.":[176],"Additionally,":[177],"extend":[179,195],"capacity":[186,203],"penalty":[187,204,212],"VRPSPD.":[190],"VRPTW,":[193],"conjunction":[206],"warp":[211],"function.":[213],"Computational":[214],"experiments":[215],"are":[216],"performed":[217],"empirically":[219],"validate":[220],"speed":[222],"gains":[223],"these":[225],"Splits":[227],"against":[228],"their":[229],"$\u0398$($n^2$)":[230],"counterparts.":[231]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-01-28T00:00:00"}