{"id":"https://openalex.org/W4292292969","doi":"https://doi.org/10.1007/s10479-022-04891-1","title":"Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition","display_name":"Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition","publication_year":2022,"publication_date":"2022-08-08","ids":{"openalex":"https://openalex.org/W4292292969","doi":"https://doi.org/10.1007/s10479-022-04891-1"},"language":"en","primary_location":{"id":"doi:10.1007/s10479-022-04891-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-022-04891-1","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://pure.au.dk/portal/files/422117171/Emde_et_al._2022_-_Point-to-point_and_milk_run_delivery_scheduling_models_complexity_results_and_algorithms_based_on_Benders_decomposition-combined.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028450940","display_name":"Simon Emde","orcid":"https://orcid.org/0000-0001-6932-0166"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Simon Emde","raw_affiliation_strings":["CORAL\u2014Cluster for Operations Research, Analytics, and Logistics, Department of Economics and Business Economics, Aarhus University, Fuglesangs All\u00e9 4, 8210, \u00c5rhus V, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-6932-0166","affiliations":[{"raw_affiliation_string":"CORAL\u2014Cluster for Operations Research, Analytics, and Logistics, Department of Economics and Business Economics, Aarhus University, Fuglesangs All\u00e9 4, 8210, \u00c5rhus V, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077362501","display_name":"Shohre Zehtabian","orcid":"https://orcid.org/0000-0003-2106-0478"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Shohre Zehtabian","raw_affiliation_strings":["CORAL\u2014Cluster for Operations Research, Analytics, and Logistics, Department of Economics and Business Economics, Aarhus University, Fuglesangs All\u00e9 4, 8210, \u00c5rhus V, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CORAL\u2014Cluster for Operations Research, Analytics, and Logistics, Department of Economics and Business Economics, Aarhus University, Fuglesangs All\u00e9 4, 8210, \u00c5rhus V, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021248592","display_name":"Yann Disser","orcid":"https://orcid.org/0000-0002-2085-0454"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Yann Disser","raw_affiliation_strings":["Institut f\u00fcr Mathematik and Graduate School CE, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik and Graduate School CE, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028450940"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.9488,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78776953,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"322","issue":"1","first_page":"467","last_page":"496"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9984999895095825,"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.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.6230722665786743},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6208304166793823},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5744961500167847},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5550588965415955},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5479339361190796},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5195379853248596},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5169693827629089},{"id":"https://openalex.org/keywords/benders-decomposition","display_name":"Benders' decomposition","score":0.5093792676925659},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.46723467111587524},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4552537202835083},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.37589573860168457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29579296708106995},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25343063473701477},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.21511316299438477},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.08401066064834595}],"concepts":[{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.6230722665786743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6208304166793823},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5744961500167847},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5550588965415955},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5479339361190796},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5195379853248596},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5169693827629089},{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.5093792676925659},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.46723467111587524},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4552537202835083},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.37589573860168457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29579296708106995},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25343063473701477},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.21511316299438477},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.08401066064834595}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10479-022-04891-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-022-04891-1","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/402c3764-246d-4d53-8f97-383a4bfea2dc","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/402c3764-246d-4d53-8f97-383a4bfea2dc","pdf_url":"https://pure.au.dk/portal/files/422117171/Emde_et_al._2022_-_Point-to-point_and_milk_run_delivery_scheduling_models_complexity_results_and_algorithms_based_on_Benders_decomposition-combined.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Emde, S, Zehtabian, S & Disser, Y 2023, 'Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition', Annals of Operations Research, vol. 322, no. 1, pp. 467-496. https://doi.org/10.1007/s10479-022-04891-1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:RePEc:spr:annopr:v:322:y:2023:i:1:d:10.1007_s10479-022-04891-1","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10479-022-04891-1","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"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/402c3764-246d-4d53-8f97-383a4bfea2dc","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/402c3764-246d-4d53-8f97-383a4bfea2dc","pdf_url":"https://pure.au.dk/portal/files/422117171/Emde_et_al._2022_-_Point-to-point_and_milk_run_delivery_scheduling_models_complexity_results_and_algorithms_based_on_Benders_decomposition-combined.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Emde, S, Zehtabian, S & Disser, Y 2023, 'Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition', Annals of Operations Research, vol. 322, no. 1, pp. 467-496. https://doi.org/10.1007/s10479-022-04891-1","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4292292969.pdf"},"referenced_works_count":56,"referenced_works":["https://openalex.org/W125184511","https://openalex.org/W337710314","https://openalex.org/W1483563708","https://openalex.org/W1488422606","https://openalex.org/W1508945008","https://openalex.org/W1563600186","https://openalex.org/W1924535508","https://openalex.org/W1966523365","https://openalex.org/W1969186119","https://openalex.org/W1985424519","https://openalex.org/W1990822088","https://openalex.org/W1994805899","https://openalex.org/W1996665895","https://openalex.org/W2001914546","https://openalex.org/W2003284066","https://openalex.org/W2011039300","https://openalex.org/W2011209204","https://openalex.org/W2038784300","https://openalex.org/W2044121814","https://openalex.org/W2054429783","https://openalex.org/W2058901378","https://openalex.org/W2058960752","https://openalex.org/W2063961786","https://openalex.org/W2066306775","https://openalex.org/W2070037973","https://openalex.org/W2071904794","https://openalex.org/W2078533235","https://openalex.org/W2085797830","https://openalex.org/W2093017852","https://openalex.org/W2094252279","https://openalex.org/W2096305430","https://openalex.org/W2110157293","https://openalex.org/W2110456395","https://openalex.org/W2114208669","https://openalex.org/W2115299891","https://openalex.org/W2120346173","https://openalex.org/W2124106382","https://openalex.org/W2124947072","https://openalex.org/W2157541676","https://openalex.org/W2169427658","https://openalex.org/W2190420042","https://openalex.org/W2272903275","https://openalex.org/W2546595392","https://openalex.org/W2560324934","https://openalex.org/W2741446315","https://openalex.org/W2743045177","https://openalex.org/W2755881520","https://openalex.org/W2804837923","https://openalex.org/W2905740732","https://openalex.org/W2940687081","https://openalex.org/W2969606928","https://openalex.org/W3085049663","https://openalex.org/W3097643400","https://openalex.org/W4242959047","https://openalex.org/W4252801674","https://openalex.org/W4255730472"],"related_works":["https://openalex.org/W2807758032","https://openalex.org/W4224254130","https://openalex.org/W2152103536","https://openalex.org/W413879896","https://openalex.org/W1983530038","https://openalex.org/W3024185138","https://openalex.org/W1993356786","https://openalex.org/W4408707197","https://openalex.org/W2089185195","https://openalex.org/W4402156642"],"abstract_inverted_index":{"We":[0,99,139,185],"consider":[1],"the":[2,69,79,106,119,174,188,191,197,205],"problem":[3,89,110],"of":[4,8,42,68,190,199,207],"scheduling":[5,133],"a":[6,12,18,101,146,152],"set":[7],"direct":[9,71],"deliveries":[10],"between":[11],"depot":[13],"and":[14,28,30,96,111,132,151],"multiple":[15],"customers":[16],"using":[17,181],"given":[19],"heterogeneous":[20],"truck":[21],"fleet.":[22],"The":[23],"trips":[24,49,126,134,169],"have":[25],"time":[26,194],"windows":[27],"weights,":[29],"they":[31],"should":[32],"be":[33,52,65,84],"completed":[34],"as":[35,39,202,204],"soon":[36],"after":[37],"release":[38],"possible":[40],"(minimization":[41],"maximum":[43,192],"weighted":[44],"flow":[45,193],"time).":[46],"Moreover,":[47],"some":[48],"can":[50,160],"optionally":[51],"combined":[53],"in":[54,93,118,170,196],"predefined":[55],"milk":[56,130,208],"runs":[57],"(i.e.,":[58],"round":[59],"trip":[60],"tours),":[61],"which":[62],"need":[63],"not":[64],"linear":[66],"combinations":[67],"constituent":[70],"trips,":[72],"accounting,":[73],"e.g.,":[74,92],"for":[75],"consolidation":[76],"effects":[77],"because":[78],"loading":[80],"dock":[81],"needs":[82],"to":[83,108,127,167],"approached":[85],"only":[86],"once.":[87],"This":[88],"has":[90],"applications,":[91],"just-in-time,":[94],"humanitarian,":[95],"military":[97],"logistics.":[98],"adapt":[100],"mixed-integer":[102,175],"programming":[103,149,176],"model":[104,177],"from":[105],"literature":[107],"this":[109,144],"show":[112,141],"that":[113],"deciding":[114],"feasibility":[115],"is":[116,178],"NP-complete":[117],"strong":[120],"sense":[121],"on":[122,135,156],"three":[123],"levels:":[124],"assigning":[125],"trucks,":[128],"selecting":[129],"runs,":[131],"each":[136],"individual":[137],"truck.":[138],"also":[140,186],"that,":[142],"despite":[143],"complexity,":[145],"state-of-the-art":[147],"constraint":[148],"solver":[150],"problem-specific":[153],"approach":[154],"based":[155],"logic-based":[157],"Benders":[158],"decomposition":[159],"solve":[161],"even":[162],"large":[163],"instances":[164],"with":[165],"up":[166],"175":[168],"many":[171],"cases,":[172],"while":[173],"essentially":[179],"unsolvable":[180],"commercial":[182],"optimization":[183],"software.":[184],"investigate":[187],"robustness":[189],"objective":[195],"face":[198],"unforeseen":[200],"delays":[201],"well":[203],"influence":[206],"runs.":[209]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}