{"id":"https://openalex.org/W3197954964","doi":"https://doi.org/10.1145/3474832","title":"VRPDiv: A Divide and Conquer Framework for Large Vehicle Routing Problems","display_name":"VRPDiv: A Divide and Conquer Framework for Large Vehicle Routing Problems","publication_year":2021,"publication_date":"2021-09-03","ids":{"openalex":"https://openalex.org/W3197954964","doi":"https://doi.org/10.1145/3474832","mag":"3197954964"},"language":"en","primary_location":{"id":"doi:10.1145/3474832","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3474832","pdf_url":null,"source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"},"type":"article","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/A5084665994","display_name":"Radu Mariescu-Istodor","orcid":"https://orcid.org/0000-0002-0721-041X"},"institutions":[{"id":"https://openalex.org/I175532246","display_name":"University of Eastern Finland","ror":"https://ror.org/00cyydd11","country_code":"FI","type":"education","lineage":["https://openalex.org/I175532246"]},{"id":"https://openalex.org/I4210105678","display_name":"Microsoft (Finland)","ror":"https://ror.org/01nehjf29","country_code":"FI","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210105678"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Radu Mariescu-Istodor","raw_affiliation_strings":["Microsoft, Timi\u0219oara, Romania and University of Eastern Finland, Joensuu, Finland"],"affiliations":[{"raw_affiliation_string":"Microsoft, Timi\u0219oara, Romania and University of Eastern Finland, Joensuu, Finland","institution_ids":["https://openalex.org/I175532246","https://openalex.org/I4210105678"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102882630","display_name":"Alexandru Cristian","orcid":"https://orcid.org/0000-0003-3440-9405"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexandru Cristian","raw_affiliation_strings":["Microsoft, Timi\u0219oara, Romania"],"affiliations":[{"raw_affiliation_string":"Microsoft, Timi\u0219oara, Romania","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023952487","display_name":"Mihai Negrea","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mihai Negrea","raw_affiliation_strings":["Microsoft, Timi\u0219oara, Romania"],"affiliations":[{"raw_affiliation_string":"Microsoft, Timi\u0219oara, Romania","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081439572","display_name":"Peiwei Cao","orcid":"https://orcid.org/0009-0003-2418-9397"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peiwei Cao","raw_affiliation_strings":["Microsoft, Seattle, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft, Seattle, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5084665994"],"corresponding_institution_ids":["https://openalex.org/I175532246","https://openalex.org/I4210105678"],"apc_list":null,"apc_paid":null,"fwci":0.2965,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64582353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":"7","issue":"4","first_page":"1","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9957000017166138,"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"}},{"id":"https://openalex.org/T12306","display_name":"Urban and Freight Transport Logistics","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/computer-science","display_name":"Computer science","score":0.7773901224136353},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6890263557434082},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6816193461418152},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.6226197481155396},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5759884119033813},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4434337913990021},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.44320571422576904},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4363762140274048},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.35459086298942566},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26308509707450867},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21992069482803345},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16841357946395874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1557905673980713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12057355046272278}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7773901224136353},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6890263557434082},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6816193461418152},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6226197481155396},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5759884119033813},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4434337913990021},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.44320571422576904},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4363762140274048},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.35459086298942566},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26308509707450867},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21992069482803345},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16841357946395874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1557905673980713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12057355046272278},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3474832","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3474832","pdf_url":null,"source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W307896644","https://openalex.org/W1208385249","https://openalex.org/W1489608363","https://openalex.org/W1585610988","https://openalex.org/W1673310716","https://openalex.org/W1872406954","https://openalex.org/W1995945562","https://openalex.org/W2017708378","https://openalex.org/W2048485254","https://openalex.org/W2057559819","https://openalex.org/W2069850304","https://openalex.org/W2111563176","https://openalex.org/W2113076747","https://openalex.org/W2117226423","https://openalex.org/W2120636855","https://openalex.org/W2126455549","https://openalex.org/W2126782412","https://openalex.org/W2127218421","https://openalex.org/W2133753734","https://openalex.org/W2137920755","https://openalex.org/W2148831787","https://openalex.org/W2150593711","https://openalex.org/W2154648702","https://openalex.org/W2154800965","https://openalex.org/W2157934908","https://openalex.org/W2163428398","https://openalex.org/W2165142526","https://openalex.org/W2167580124","https://openalex.org/W2262276395","https://openalex.org/W2299467264","https://openalex.org/W2476974423","https://openalex.org/W2509755532","https://openalex.org/W2551208445","https://openalex.org/W2553054816","https://openalex.org/W2592933467","https://openalex.org/W2768361919","https://openalex.org/W2795273206","https://openalex.org/W2810479212","https://openalex.org/W2921712036","https://openalex.org/W2975230940","https://openalex.org/W2979531798","https://openalex.org/W3012796613","https://openalex.org/W3145128584","https://openalex.org/W4245067498","https://openalex.org/W4250042253","https://openalex.org/W4295912609"],"related_works":["https://openalex.org/W2383698455","https://openalex.org/W3210743742","https://openalex.org/W2075861114","https://openalex.org/W2348967038","https://openalex.org/W3005128874","https://openalex.org/W3036427638","https://openalex.org/W4312688152","https://openalex.org/W4319455100","https://openalex.org/W2389208788","https://openalex.org/W2994587791"],"abstract_inverted_index":{"The":[0],"Vehicle":[1],"Routing":[2],"Problem":[3],"(VRP)":[4],"is":[5,187],"an":[6,224,246],"NP":[7],"hard":[8],"problem":[9],"where":[10],"we":[11],"need":[12],"to":[13,18,55,62,133,143,173,193],"optimize":[14],"itineraries":[15],"for":[16,245],"agents":[17,101],"visit":[19],"multiple":[20,76,177],"targets.":[21,44],"When":[22],"considering":[23],"real-world":[24,169],"travel":[25,170],"(road-network":[26],"topology,":[27],"speed":[28],"limits":[29],"and":[30,79,106,112,158,180,202,210,222],"traffic),":[31],"modern":[32],"VRP":[33,58,77],"solvers":[34],"can":[35,51],"only":[36],"process":[37],"small":[38],"instances":[39,59,138,167,234],"with":[40,60,139,189,199,219,229,235],"a":[41,47,81,140,160,204,211],"few":[42,141],"hundred":[43,142],"We":[45,115,151,175,197,217],"propose":[46],"framework":[48,118,154],"(VRPDiv)":[49],"that":[50,182],"scale":[52,134],"any":[53],"solver":[54],"support":[56],"larger":[57],"up":[61,135,192],"ten":[63],"thousand":[64],"targets":[65,107,146,239],"(10k)":[66],"by":[67],"dividing":[68],"them":[69],"into":[70,119],"smaller":[71],"clusters.":[72],"VRPDiv":[73,99],"supports":[74],"the":[75,90,97,117,120,184],"scenarios":[78],"contains":[80],"pool":[82],"of":[83,96,191,227],"clustering":[84,178],"algorithms":[85],"from":[86,136],"which":[87,242],"it":[88],"chooses":[89],"ideal":[91],"one":[92,186],"depending":[93],"on":[94,103,155],"properties":[95],"instance.":[98],"assigns":[100],"based":[102],"cluster":[104],"demand":[105],"compatibility":[108],"(i.e.":[109],"realizable":[110],"time-windows":[111],"capacity":[113],"limitations).":[114],"incorporate":[116],"Bing":[121],"Maps":[122],"Multi-Itinerary":[123],"Optimization":[124],"(MIO)":[125],"1":[126],"online":[127,247],"service.":[128,248],"This":[129],"architecture":[130],"allows":[131],"MIO":[132],"solving":[137],"over":[144],"10k":[145],"in":[147,195,207,214,233],"under":[148],"10":[149],"minutes.":[150],"evaluate":[152],"our":[153],"public":[156],"datasets":[157],"publish":[159],"new":[161],"dataset":[162],"ourselves,":[163],"as":[164],"large":[165],"enough":[166],"supporting":[168],"were":[171],"impossible":[172],"find.":[174],"investigate":[176],"methods":[179],"show":[181],"choosing":[183],"correct":[185],"critical":[188],"differences":[190],"60%":[194],"quality.":[196],"compare":[198,218],"relevant":[200],"baselines":[201],"report":[203,223],"40%":[205],"improvement":[206,213],"target":[208],"allocation":[209],"9.8%":[212],"itinerary":[215],"durations.":[216],"existing":[220],"scores":[221],"average":[225],"delta":[226],"10%,":[228],"lower":[230],"values":[231],"(<5%)":[232],"low":[236],"workload":[237],"(few":[238],"per":[240],"agent),":[241],"are":[243],"acceptable":[244]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}