{"id":"https://openalex.org/W4306168826","doi":"https://doi.org/10.1287/trsc.2022.1179","title":"Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm","display_name":"Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm","publication_year":2022,"publication_date":"2022-10-14","ids":{"openalex":"https://openalex.org/W4306168826","doi":"https://doi.org/10.1287/trsc.2022.1179"},"language":"en","primary_location":{"id":"doi:10.1287/trsc.2022.1179","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.2022.1179","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.vu.nl/en/publications/4a7131b4-934b-4113-82e3-08b56e19f85c","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017238021","display_name":"Lu\u0131\u0301s Gouveia","orcid":"https://orcid.org/0000-0003-4393-1617"},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]},{"id":"https://openalex.org/I7883018","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e Tecnologia","ror":"https://ror.org/00snfqn58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210146676","https://openalex.org/I7883018"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Luis Gouveia","raw_affiliation_strings":["Centro de Matem\u00e1tica, Aplica\u00e7\u00e3es Fundamentais e Investiga\u00e7\u00e3o Operacional, Departamento de Estat\u00edstica e Investiga\u00e7\u00e3o Operacional, Faculdade de Ci\u00eancias, Universidade de Lisboa, 1749-016 Lisboa, Portugal;"],"raw_orcid":"https://orcid.org/0000-0003-4393-1617","affiliations":[{"raw_affiliation_string":"Centro de Matem\u00e1tica, Aplica\u00e7\u00e3es Fundamentais e Investiga\u00e7\u00e3o Operacional, Departamento de Estat\u00edstica e Investiga\u00e7\u00e3o Operacional, Faculdade de Ci\u00eancias, Universidade de Lisboa, 1749-016 Lisboa, Portugal;","institution_ids":["https://openalex.org/I141596103","https://openalex.org/I7883018"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024184384","display_name":"Markus Leitner","orcid":"https://orcid.org/0000-0002-3313-9610"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Markus Leitner","raw_affiliation_strings":["Department of Operations Analytics, Vrije Universiteit, 1081 HV Amsterdam, Netherlands;"],"raw_orcid":"https://orcid.org/0000-0002-3313-9610","affiliations":[{"raw_affiliation_string":"Department of Operations Analytics, Vrije Universiteit, 1081 HV Amsterdam, Netherlands;","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044901813","display_name":"Mario Ruthmair","orcid":"https://orcid.org/0000-0002-2318-6667"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]},{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["AT","NL"],"is_corresponding":false,"raw_author_name":"Mario Ruthmair","raw_affiliation_strings":["Department of Mathematics, University of Klagenfurt, 9020 Klagenfurt, Austria","Department of Operations Analytics, Vrije Universiteit, 1081 HV Amsterdam, Netherlands;","Department of Statistics and Operations Research, University of Vienna, 1090 Vienna, Austria;"],"raw_orcid":"https://orcid.org/0000-0002-2318-6667","affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Klagenfurt, 9020 Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]},{"raw_affiliation_string":"Department of Operations Analytics, Vrije Universiteit, 1081 HV Amsterdam, Netherlands;","institution_ids":["https://openalex.org/I865915315"]},{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Vienna, 1090 Vienna, Austria;","institution_ids":["https://openalex.org/I129774422"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2382,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.80980025,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"57","issue":"2","first_page":"512","last_page":"530"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9954000115394592,"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"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9908999800682068,"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/branch-and-cut","display_name":"Branch and cut","score":0.7939882278442383},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7072116136550903},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6812664270401001},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.597958505153656},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5961757898330688},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5925118923187256},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5858806371688843},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.564862072467804},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5576008558273315},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5513347387313843},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5185030698776245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4366138279438019},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42536723613739014},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.41663622856140137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3263121247291565},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.17799970507621765}],"concepts":[{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.7939882278442383},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7072116136550903},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6812664270401001},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.597958505153656},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5961757898330688},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5925118923187256},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5858806371688843},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.564862072467804},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5576008558273315},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5513347387313843},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5185030698776245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4366138279438019},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42536723613739014},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.41663622856140137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3263121247291565},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.17799970507621765},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1287/trsc.2022.1179","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.2022.1179","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/4a7131b4-934b-4113-82e3-08b56e19f85c","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/4a7131b4-934b-4113-82e3-08b56e19f85c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gouveia, L, Leitner, M & Ruthmair, M 2023, 'Multi-Depot Routing with Split Deliveries : Models and a Branch-and-Cut Algorithm', Transportation Science, vol. 57, no. 2, pp. 512-530. https://doi.org/10.1287/trsc.2022.1179","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:inm:ortrsc:v:57:y:2023:i:2:p:512-530","is_oa":false,"landing_page_url":"http://doi.org/10.1287/trsc.2022.1179","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"},{"id":"pmh:oai:research.vu.nl:publications/4a7131b4-934b-4113-82e3-08b56e19f85c","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/4a7131b4-934b-4113-82e3-08b56e19f85c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gouveia, L, Leitner, M & Ruthmair, M 2023, 'Multi-Depot Routing with Split Deliveries : Models and a Branch-and-Cut Algorithm', Transportation Science, vol. 57, no. 2, pp. 512-530. https://doi.org/10.1287/trsc.2022.1179","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/4a7131b4-934b-4113-82e3-08b56e19f85c","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/4a7131b4-934b-4113-82e3-08b56e19f85c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gouveia, L, Leitner, M & Ruthmair, M 2023, 'Multi-Depot Routing with Split Deliveries : Models and a Branch-and-Cut Algorithm', Transportation Science, vol. 57, no. 2, pp. 512-530. https://doi.org/10.1287/trsc.2022.1179","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W249091067","https://openalex.org/W1786863823","https://openalex.org/W1988345713","https://openalex.org/W1994935216","https://openalex.org/W1995719137","https://openalex.org/W2017070898","https://openalex.org/W2032004016","https://openalex.org/W2054496926","https://openalex.org/W2055539533","https://openalex.org/W2057532434","https://openalex.org/W2060846245","https://openalex.org/W2065962145","https://openalex.org/W2078227935","https://openalex.org/W2098090443","https://openalex.org/W2105002757","https://openalex.org/W2107646419","https://openalex.org/W2109075243","https://openalex.org/W2111388156","https://openalex.org/W2111581650","https://openalex.org/W2119235896","https://openalex.org/W2121541283","https://openalex.org/W2123213336","https://openalex.org/W2131338629","https://openalex.org/W2136284166","https://openalex.org/W2155597893","https://openalex.org/W2309764699","https://openalex.org/W2600233134","https://openalex.org/W2620314292","https://openalex.org/W2743398117","https://openalex.org/W2752225574","https://openalex.org/W2756316790","https://openalex.org/W3020867067","https://openalex.org/W3037819751","https://openalex.org/W3056354848"],"related_works":["https://openalex.org/W2011762930","https://openalex.org/W4376138746","https://openalex.org/W1212691569","https://openalex.org/W2125126715","https://openalex.org/W2044119054","https://openalex.org/W4365506312","https://openalex.org/W3144226417","https://openalex.org/W2018269848","https://openalex.org/W4306168826","https://openalex.org/W2105006450"],"abstract_inverted_index":{"We":[0,32,162],"study":[1],"the":[2,11,25,56,72,115,122,129,139,143,148,151,156,164,170,179,182,188,191,198,218],"multi-depot":[3,130],"split-delivery":[4,123],"vehicle":[5,124],"routing":[6,125],"problem":[7,126,133],"(MDSDVRP)":[8],"that":[9,61,71,98,138,174],"combines":[10],"advantages":[12],"and":[13,20,23,45,60,92,117,128,154,172,201,205],"potential":[14],"cost":[15],"savings":[16],"of":[17,42,48,150,158],"multiple":[18],"depots":[19],"split":[21],"deliveries":[22],"develop":[24],"first":[26,165,199],"exact":[27],"algorithm":[28,97,176],"for":[29,89,169,181,197,210],"this":[30],"problem.":[31],"propose":[33],"an":[34,85],"integer":[35],"programming":[36,145],"formulation":[37],"using":[38],"a":[39,101,221,224],"small":[40],"number":[41,157],"decision":[43],"variables":[44],"several":[46],"sets":[47],"valid":[49],"inequalities.":[50],"These":[51],"inequalities":[52,141],"focus":[53],"on":[54,114,187],"ensuring":[55],"vehicles\u2019":[57],"capacity":[58],"limits":[59],"vehicles":[62],"return":[63],"to":[64,107],"their":[65],"initial":[66,110],"depot.":[67],"As":[68],"we":[69],"show":[70,137,173],"new":[73,140,202],"constraints":[74],"do":[75],"not":[76],"guarantee":[77],"these":[78],"aspects,":[79],"our":[80,175],"branch-and-cut":[81,152],"framework":[82],"also":[83,99],"includes":[84],"efficient":[86],"feasibility":[87,94,160],"check":[88],"candidate":[90],"solutions":[91,111],"explicit":[93],"cuts.":[95,161],"The":[96,135,230],"uses":[100],"comparably":[102],"simple,":[103],"yet":[104],"effective":[105],"heuristic":[106],"compute":[108],"high-quality":[109],"is":[112,233],"tested":[113],"MDSDVRP":[116,171],"two":[118],"well-known":[119],"special":[120],"cases,":[121],"(SDVRP)":[127],"traveling":[131],"salesman":[132],"(MDTSP).":[134],"results":[136,168],"tighten":[142],"linear":[144],"relaxation,":[146],"increase":[147],"performance":[149],"algorithm,":[153],"reduce":[155],"required":[159],"report":[163],"proven":[166],"optimal":[167],"significantly":[177],"outperforms":[178],"state-of-the-art":[180],"MDTSP":[183],"while":[184],"being":[185],"competitive":[186],"SDVRP.":[189],"For":[190],"latter,":[192],"20":[193],"instances":[194],"are":[195,208],"solved":[196],"time,":[200],"best":[203],"primal":[204],"dual":[206],"bounds":[207],"found":[209],"others.":[211],"Funding:":[212],"This":[213],"work":[214],"was":[215],"supported":[216],"by":[217],"Funda\u00e7\u00e3o":[219],"para":[220],"Ci\u00eancia":[222],"e":[223],"Tecnologia":[225],"[Project":[226],"UIDB/04561/2020].":[227],"Supplemental":[228],"Material:":[229],"online":[231],"appendix":[232],"available":[234],"at":[235],"https://doi.org/10.1287/trsc.2022.1179":[236],".":[237]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}