{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:38:03Z","timestamp":1740109083432,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T00:00:00Z","timestamp":1719360000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T00:00:00Z","timestamp":1719360000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["418727865"],"award-info":[{"award-number":["418727865"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["418727865"],"award-info":[{"award-number":["418727865"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Rheinland-Pf\u00e4lzische Technische Universit\u00e4t Kaiserslautern-Landau"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>For many variants of vehicle routing and scheduling problems solved by a branch-price-and-cut (BPC) algorithm, the pricing subproblem is an elementary shortest-path problem with resource constraints (SPPRC) typically solved by a dynamic-programming labeling algorithm. Solving the SPPRC subproblems consumes most of the total BPC computation time. Critical to the performance of the labeling algorithms and thus the BPC algorithm as a whole is the use of effective dominance rules. Classical dominance rules rely on a pairwise comparison of labels and have been used in many labeling algorithms. In contrast, partial dominance describes situations where several labels together are needed to dominate another label, which can then be safely discarded. In this work, we consider SPPRCs, where a linear tradeoff describes the relationship between two resources. We derive a unified partial dominance rule to be used in ad hoc labeling algorithms for solving such SPPRCs as well as insights into its practical implementation. We introduce partial dominance for two important variants of the vehicle routing problem, namely the electric vehicle routing problem with time windows with a partial recharge policy and the split-delivery vehicle routing problem with time windows (SDVRPTW). Computational experiments show the effectiveness of the approach, in particular for the SDVRPTW, leading to an average reduction of 20% of the total BPC computation time, with savings of 30% for the more difficult instances requiring more than 600\u00a0s of computation time.<\/jats:p>","DOI":"10.1007\/s00291-024-00766-y","type":"journal-article","created":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T16:01:37Z","timestamp":1719417697000},"page":"1063-1097","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["\ufeffPartial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-6789-5940","authenticated-orcid":false,"given":"Stefan","family":"Faldum","sequence":"first","affiliation":[]},{"given":"Sarah","family":"Machate","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7715-4994","authenticated-orcid":false,"given":"Timo","family":"Gschwind","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9383-4546","authenticated-orcid":false,"given":"Stefan","family":"Irnich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,26]]},"reference":[{"key":"766_CR1","unstructured":"Achterberg T (2007) Constraint integer programming. Ph.D. thesis, Technische Universit\u00e4t Berlin, Fakult\u00e4t II\u2014Mathematik und Naturwissenschaften, Berlin, Germany"},{"key":"766_CR2","unstructured":"Aerts-Veenstra M, Cherkesly M, Gschwind T (2023) A unified branch-price-and-cut algorithm for multi-compartment pickup and delivery problems. Les Cahiers du GERAD G-2023-26, Groupe d\u2019\u00e9tudes et de recherche en analyse des d\u00e9cisions, GERAD, Montr\u00e9al QC H3T 2A7, Canada"},{"issue":"1","key":"766_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1040.0103","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti C, Speranza MG, Hertz A (2006) A tabu search algorithm for the split delivery vehicle routing problem. Transp Sci 40(1):64\u201373","journal-title":"Transp Sci"},{"issue":"3","key":"766_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1287\/trsc.1100.0363","volume":"45","author":"C Archetti","year":"2011","unstructured":"Archetti C, Bouchard M, Desaulniers G (2011) Enhanced branch and price and cut for vehicle routing with split deliveries and time windows. Transp Sci 45(3):285\u2013298","journal-title":"Transp Sci"},{"issue":"5","key":"766_CR5","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59(5):1269\u20131283","journal-title":"Oper Res"},{"issue":"4","key":"766_CR6","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1287\/trsc.2019.0940","volume":"54","author":"AC Baller","year":"2020","unstructured":"Baller AC, Dabia S, Dullaert WEH, Vigo D (2020) The vehicle routing problem with partial outsourcing. Transp Sci 54(4):1034\u20131052","journal-title":"Transp Sci"},{"issue":"3","key":"766_CR7","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart C, Johnson E, Nemhauser G, Savelsbergh M, Vance P (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46(3):316\u2013329","journal-title":"Oper Res"},{"issue":"2","key":"766_CR8","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1287\/trsc.2018.0825","volume":"53","author":"N Bianchessi","year":"2019","unstructured":"Bianchessi N, Irnich S (2019) Branch-and-cut for the split delivery vehicle routing problem with time windows. Transp Sci 53(2):442\u2013462","journal-title":"Transp Sci"},{"issue":"2","key":"766_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.ejor.2014.04.004","volume":"238","author":"C Bode","year":"2014","unstructured":"Bode C, Irnich S (2014) The shortest-path problem with resource constraints with $$(k,2)$$-loop elimination and its application to the capacitated arc-routing problem. Eur J Oper Res 238(2):415\u2013426","journal-title":"Eur J Oper Res"},{"key":"766_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.cor.2018.01.016","volume":"93","author":"T Bulh\u00f5es","year":"2018","unstructured":"Bulh\u00f5es T, Sadykov R, Uchoa E (2018) A branch-and-price algorithm for the minimum latency problem. Comput Oper Res 93:66\u201378","journal-title":"Comput Oper Res"},{"issue":"2","key":"766_CR11","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.ejor.2021.11.021","volume":"301","author":"M Cherkesly","year":"2022","unstructured":"Cherkesly M, Gschwind T (2022) The pickup and delivery problem with time windows, multiple stacks, and handling operations. Eur J Oper Res 301(2):647\u2013666","journal-title":"Eur J Oper Res"},{"issue":"4","key":"766_CR12","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1287\/trsc.2018.0878","volume":"53","author":"L Costa","year":"2019","unstructured":"Costa L, Contardo C, Desaulniers G (2019) Exact branch-price-and-cut algorithms for vehicle routing. Transp Sci 53(4):946\u2013985","journal-title":"Transp Sci"},{"issue":"5","key":"766_CR13","doi-asserted-by":"publisher","first-page":"2633","DOI":"10.1111\/itor.12911","volume":"28","author":"L Costa","year":"2021","unstructured":"Costa L, Contardo C, Desaulniers G, Pecin D (2021) Selective arc-ng pricing for vehicle routing. Int Trans Oper Res 28(5):2633\u20132690","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"766_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1287\/opre.1090.0713","volume":"58","author":"G Desaulniers","year":"2010","unstructured":"Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper Res 58(1):179\u2013192","journal-title":"Oper Res"},{"issue":"3","key":"766_CR15","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1287\/trsc.34.3.312.12298","volume":"34","author":"G Desaulniers","year":"2000","unstructured":"Desaulniers G, Villeneuve D (2000) The shortest path problem with time windows and linear waiting costs. Transp Sci 34(3):312\u2013319","journal-title":"Transp Sci"},{"key":"766_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-1-4615-5755-5_3","volume-title":"Fleet management and logistics","author":"G Desaulniers","year":"1998","unstructured":"Desaulniers G, Desrosiers J, Loachim I, Solomon MM, Soumis F, Villeneuve D (1998) A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In: Crainic TG, Laporte G (eds) Fleet management and logistics. Springer, Cham, pp 57\u201393"},{"volume-title":"Column generation","year":"2005","key":"766_CR17","unstructured":"Desaulniers G, Desrosiers J, Solomon M (eds) (2005) Column generation. Springer, New York"},{"issue":"3","key":"766_CR18","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/trsc.1070.0223","volume":"42","author":"G Desaulniers","year":"2008","unstructured":"Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized $$k$$-path inequalities for the vehicle routing problem with time windows. Transp Sci 42(3):387\u2013404","journal-title":"Transp Sci"},{"issue":"3","key":"766_CR19","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1287\/trsc.2015.0635","volume":"50","author":"G Desaulniers","year":"2016","unstructured":"Desaulniers G, Rakke JG, Coelho LC (2016) A branch-price-and-cut algorithm for the inventory-routing problem. Transp Sci 50(3):1060\u20131076","journal-title":"Transp Sci"},{"issue":"6","key":"766_CR20","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1287\/opre.2016.1535","volume":"64","author":"G Desaulniers","year":"2016","unstructured":"Desaulniers G, Errico F, Irnich S, Schneider M (2016) Exact algorithms for electric vehicle-routing problems with time windows. Oper Res 64(6):1388\u20131405","journal-title":"Oper Res"},{"key":"766_CR21","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s13676-017-0112-9","volume":"8","author":"G Desaulniers","year":"2019","unstructured":"Desaulniers G, Pecin D, Contardo C (2019) Selective pricing in branch-price-and-cut algorithms for vehicle routing. EURO J Transp Logist 8:147\u2013168","journal-title":"EURO J Transp Logist"},{"issue":"5","key":"766_CR22","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1287\/trsc.2020.0988","volume":"54","author":"G Desaulniers","year":"2020","unstructured":"Desaulniers G, Gschwind T, Irnich S (2020) Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models. Transp Sci 54(5):1170\u20131188","journal-title":"Transp Sci"},{"issue":"2","key":"766_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91(2):201\u2013213","journal-title":"Math Program"},{"issue":"17","key":"766_CR24","doi-asserted-by":"publisher","first-page":"5332","DOI":"10.1080\/00207543.2021.1955995","volume":"60","author":"EN Duman","year":"2021","unstructured":"Duman EN, Ta\u015f D, \u00c7atay B (2021) Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows. Int J Prod Res 60(17):5332\u20135353","journal-title":"Int J Prod Res"},{"issue":"3","key":"766_CR25","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M, Gu\u00e9guen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3):216\u2013229","journal-title":"Networks"},{"issue":"1","key":"766_CR26","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ejor.2015.06.017","volume":"247","author":"T Gschwind","year":"2015","unstructured":"Gschwind T (2015) A comparison of column-generation approaches to the synchronized pickup and delivery problem. Eur J Oper Res 247(1):60\u201371","journal-title":"Eur J Oper Res"},{"issue":"2","key":"766_CR27","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1287\/trsc.2014.0531","volume":"49","author":"T Gschwind","year":"2015","unstructured":"Gschwind T, Irnich S (2015) Effective handling of dynamic time windows and its application to solving the dial-a-ride problem. Transp Sci 49(2):335\u2013354","journal-title":"Transp Sci"},{"issue":"5","key":"766_CR28","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1287\/trsc.2019.0891","volume":"53","author":"Q He","year":"2019","unstructured":"He Q, Irnich S, Song Y (2019) Branch-and-cut-and-price for the vehicle routing problem with time windows and convex node costs. Transp Sci 53(5):1409\u20131426","journal-title":"Transp Sci"},{"issue":"1","key":"766_CR29","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1287\/ijoc.2022.1255","volume":"35","author":"K He\u00dfler","year":"2023","unstructured":"He\u00dfler K, Irnich S (2023) Partial dominance in branch-price-and-cut for the basic multi-compartment vehicle routing problem. INFORMS J Comput 35(1):50\u201365","journal-title":"INFORMS J Comput"},{"key":"766_CR30","first-page":"93","volume":"17","author":"D Houck","year":"1980","unstructured":"Houck D, Picard J, Queyranne M, Vemuganti R (1980) The travelling salesman problem as a constrained shortest path problem: theory and computational experience. Opsearch 17:93\u2013109","journal-title":"Opsearch"},{"key":"766_CR31","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A","volume":"31","author":"I Ioachim","year":"1998","unstructured":"Ioachim I, G\u00e9linas S, Desrosiers J, Soumis F (1998) A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks 31:193\u2013204","journal-title":"Networks"},{"issue":"1","key":"766_CR32","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0377-2217(98)00343-9","volume":"119","author":"I Ioachim","year":"1999","unstructured":"Ioachim I, Desrosiers J, Soumis F, B\u00e9langer N (1999) Fleet assignment and routing with schedule synchronization constraints. Eur J Oper Res 119(1):75\u201390","journal-title":"Eur J Oper Res"},{"issue":"1","key":"766_CR33","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00291-007-0083-6","volume":"30","author":"S Irnich","year":"2008","unstructured":"Irnich S (2008) Resource extension functions: properties, inversion, and generalization to segments. OR Spectrum 30(1):113\u2013148","journal-title":"OR Spectrum"},{"key":"766_CR34","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","volume-title":"Column generation","author":"S Irnich","year":"2005","unstructured":"Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. In: Desaulniers G, Desrosiers J, Solomon M (eds) Column generation. Springer, New York, pp 33\u201365"},{"issue":"3","key":"766_CR35","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/ijoc.1040.0117","volume":"18","author":"S Irnich","year":"2006","unstructured":"Irnich S, Villeneuve D (2006) The shortest path problem with resource constraints and $$k$$-cycle elimination for $$k\\ge 3$$. INFORMS J Comput 18(3):391\u2013406","journal-title":"INFORMS J Comput"},{"issue":"2","key":"766_CR36","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M Jepsen","year":"2008","unstructured":"Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper Res 56(2):497\u2013511","journal-title":"Oper Res"},{"issue":"1","key":"766_CR37","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/trsc.33.1.101","volume":"33","author":"N Kohl","year":"1999","unstructured":"Kohl N, Desrosiers J, Madsen O, Solomon M, Soumis F (1999) $$2$$-path cuts for the vehicle routing problem with time windows. Transp Sci 33(1):101\u2013116","journal-title":"Transp Sci"},{"issue":"1","key":"766_CR38","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1002\/net.21937","volume":"76","author":"G Lera-Romero","year":"2020","unstructured":"Lera-Romero G, Miranda Bront JJ, Soulignac FJ (2020) Linear edge costs and labeling algorithms: the case of the time-dependent vehicle routing problem with time windows. Networks 76(1):24\u201353","journal-title":"Networks"},{"issue":"1","key":"766_CR39","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10288-010-0136-6","volume":"9","author":"F Liberatore","year":"2010","unstructured":"Liberatore F, Righini G, Salani M (2010) A column generation algorithm for the vehicle routing problem with soft time windows. 4OR 9(1):49\u201382","journal-title":"4OR"},{"issue":"2","key":"766_CR40","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1287\/trsc.2015.0666","volume":"51","author":"Z Luo","year":"2017","unstructured":"Luo Z, Qin H, Zhu W, Lim A (2017) Branch and price and cut for the split-delivery vehicle routing problem with time windows and linear weight-related cost. Transp Sci 51(2):668\u2013687","journal-title":"Transp Sci"},{"issue":"6","key":"766_CR41","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"M L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke M, Desrosiers J (2005) Selected topics in column generation. Oper Res 53(6):1007\u20131023","journal-title":"Oper Res"},{"issue":"8","key":"766_CR42","doi-asserted-by":"publisher","first-page":"2145","DOI":"10.1016\/j.cor.2013.02.013","volume":"40","author":"R Martinelli","year":"2013","unstructured":"Martinelli R, Poggi M, Subramanian A (2013) Improved bounds for large scale capacitated arc routing problem. Comput Oper Res 40(8):2145\u20132160","journal-title":"Comput Oper Res"},{"key":"766_CR43","first-page":"29","volume-title":"The traveling salesman problem and its variations, volume\u00a012 of combinatorial optimization, chapter\u00a02","author":"D Naddef","year":"2002","unstructured":"Naddef D (2002) Polyhedral theory. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations, volume\u00a012 of combinatorial optimization, chapter\u00a02. Kluwer, Dordrecht, pp 29\u2013116"},{"issue":"1","key":"766_CR44","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s12532-016-0108-8","volume":"9","author":"D Pecin","year":"2017","unstructured":"Pecin D, Pessoa A, Poggi M, Uchoa E (2017) Improved branch-cut-and-price for capacitated vehicle routing. Math Program Comput 9(1):61\u2013100","journal-title":"Math Program Comput"},{"issue":"3","key":"766_CR45","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1287\/ijoc.2016.0744","volume":"29","author":"D Pecin","year":"2017","unstructured":"Pecin D, Contardo C, Desaulniers G, Uchoa E (2017) New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS J Comput 29(3):489\u2013502","journal-title":"INFORMS J Comput"},{"issue":"2\u20133","key":"766_CR46","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"T Ralphs","year":"2003","unstructured":"Ralphs T, Kopman L, Pulleyblank W, Trotter L (2003) On the capacitated vehicle routing problem. Math Program 94(2\u20133):343\u2013359","journal-title":"Math Program"},{"issue":"5","key":"766_CR47","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1287\/trsc.2017.0765","volume":"52","author":"A-K Rothenb\u00e4cher","year":"2018","unstructured":"Rothenb\u00e4cher A-K, Drexl M, Irnich S (2018) Branch-and-price-and-cut for the truck-and-trailer routing problem with time windows. Transp Sci 52(5):1174\u20131190","journal-title":"Transp Sci"},{"issue":"1","key":"766_CR48","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/trsc.2020.0985","volume":"55","author":"R Sadykov","year":"2021","unstructured":"Sadykov R, Uchoa E, Pessoa A (2021) A bucket graph\u2013based labeling algorithm with application to vehicle routing. Transp Sci 55(1):4\u201328","journal-title":"Transp Sci"},{"issue":"4","key":"766_CR49","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/trsc.2013.0490","volume":"48","author":"M Schneider","year":"2014","unstructured":"Schneider M, Stenger A, Goeke D (2014) The electric vehicle-routing problem with time windows and recharging stations. Transp Sci 48(4):500\u2013520","journal-title":"Transp Sci"},{"issue":"2","key":"766_CR50","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"issue":"4","key":"766_CR51","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1287\/trsc.2013.0510","volume":"49","author":"R Spliet","year":"2015","unstructured":"Spliet R, Gabor AF (2015) The time window assignment vehicle routing problem. Transp Sci 49(4):721\u2013731","journal-title":"Transp Sci"},{"issue":"2","key":"766_CR52","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1287\/trsc.2016.0705","volume":"52","author":"R Spliet","year":"2018","unstructured":"Spliet R, Dabia S, Van Woensel T (2018) The time window assignment vehicle routing problem with time-dependent travel times. Transp Sci 52(2):261\u2013276","journal-title":"Transp Sci"},{"issue":"2","key":"766_CR53","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.ejor.2017.03.017","volume":"261","author":"C Tilk","year":"2017","unstructured":"Tilk C, Rothenb\u00e4cher A-K, Gschwind T, Irnich S (2017) Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. Eur J Oper Res 261(2):530\u2013539","journal-title":"Eur J Oper Res"},{"issue":"2","key":"766_CR54","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1287\/trsc.2016.0730","volume":"52","author":"C Tilk","year":"2018","unstructured":"Tilk C, Bianchessi N, Drexl M, Irnich S, Meisel F (2018) Branch-and-price-and-cut for the active-passive vehicle-routing problem. Transp Sci 52(2):300\u2013319","journal-title":"Transp Sci"},{"key":"766_CR55","series-title":"MOS-SIAM Series on Optimization","volume-title":"Vehicle routing: problems, methods, and applications","year":"2014","unstructured":"Toth P, Vigo D (eds) (2014) Vehicle routing: problems, methods, and applications. MOS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics, Philadelphia"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00766-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-024-00766-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00766-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T07:17:21Z","timestamp":1729754241000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-024-00766-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,26]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["766"],"URL":"https:\/\/doi.org\/10.1007\/s00291-024-00766-y","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"type":"print","value":"0171-6468"},{"type":"electronic","value":"1436-6304"}],"subject":[],"published":{"date-parts":[[2024,6,26]]},"assertion":[{"value":"5 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}