{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T03:38:42Z","timestamp":1772941122931,"version":"3.50.1"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T00:00:00Z","timestamp":1611964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T00:00:00Z","timestamp":1611964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100008332","name":"Graz University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100008332","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Planning of operations, such as routing of vehicles, is often performed repetitively in rea-world settings, either by humans or algorithms solving mathematical problems. While humans build experience over multiple executions of such planning tasks and are able to recognize common patterns in different problem instances, classical optimization algorithms solve every instance independently. Machine learning (ML) can be seen as a computational counterpart to the human ability to recognize patterns based on experience. We consider variants of the classical Vehicle Routing Problem with Time Windows and Capacitated Vehicle Routing Problem, which are based on the assumption that problem instances follow specific common patterns. For this problem, we propose a ML-based branch and price framework which explicitly utilizes those patterns. In this context, the ML models are used in two ways: (a) to predict the value of binary decision variables in the optimal solution and (b) to predict branching scores for fractional variables based on full strong branching. The prediction of decision variables is then integrated in a node selection policy, while a predicted branching score is used within a variable selection policy. These ML-based approaches for node and variable selection are integrated in a reliability-based branching algorithm that assesses their quality and allows for replacing ML approaches by other (classical) better performing approaches at the level of specific variables in each specific instance. Computational results show that our algorithms outperform benchmark branching strategies. Further, we demonstrate that our approach is robust with respect to small changes in instance sizes.<\/jats:p>","DOI":"10.1007\/s00291-020-00615-8","type":"journal-article","created":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T16:03:10Z","timestamp":1612022590000},"page":"693-732","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["A machine learning-based branch and price algorithm for a sampled vehicle routing problem"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2137-1527","authenticated-orcid":false,"given":"Nikolaus","family":"Furian","sequence":"first","affiliation":[]},{"given":"Michael","family":"O\u2019Sullivan","sequence":"additional","affiliation":[]},{"given":"Cameron","family":"Walker","sequence":"additional","affiliation":[]},{"given":"Eranda","family":"\u00c7ela","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,30]]},"reference":[{"issue":"1","key":"615_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg T, Koch T, Martin A (2005) Branching rules revisited. Oper Res Lett 33(1):42\u201354","journal-title":"Oper Res Lett"},{"issue":"4","key":"615_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg T, Koch T, Martin A (2006) Miplib 2003. Oper Res Lett 34(4):361\u2013372","journal-title":"Oper Res Lett"},{"key":"615_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cor.2014.02.010","volume":"48","author":"M Albareda-Sambola","year":"2014","unstructured":"Albareda-Sambola M, Fern\u00e1ndez E, Laporte G (2014) The dynamic multiperiod vehicle routing problem with probabilistic information. Comput Oper Res 48:31\u201339","journal-title":"Comput Oper Res"},{"issue":"1","key":"615_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"AM Alvarez","year":"2017","unstructured":"Alvarez AM, Louveaux Q, Wehenkel L (2017) A machine learning-based approximation of strong branching. Inf J Comput 29(1):185\u2013195","journal-title":"Inf J Comput"},{"key":"615_CR5","unstructured":"Balcan M-F, Dick T, Sandholm T, Vitercik E (2018) Learning to branch. In: Proceedings of the 35th international conference on machine learning, pp 344\u2013353. PMLR"},{"issue":"5","key":"615_CR6","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"},{"key":"615_CR7","unstructured":"Bello I, Pham H, Le QV, Norouzi M, Bengio S (2016) Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940"},{"key":"615_CR8","unstructured":"Bengio Y, Lodi A, Prouvost A (2018) Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. arXiv preprint arXiv:1811.06128. to appear in Eur J Oper Res, 2020"},{"key":"615_CR9","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers K, Ramaekers K, Nieuwenhuyse IV (2016) The vehicle routing problem: state of the art classification and review. Comput Ind Eng 99:300\u2013313","journal-title":"Comput Ind Eng"},{"key":"615_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":"1","key":"615_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1002\/net.21527","volume":"63","author":"AM Campbell","year":"2014","unstructured":"Campbell AM, Wilson JH (2014) Forty years of periodic vehicle routing. Networks 63(1):2\u201315","journal-title":"Networks"},{"key":"615_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim 12:129\u2013146","journal-title":"Discrete Optim"},{"issue":"4","key":"615_CR13","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. Transport Sci 53(4):946\u2013985","journal-title":"Transport Sci"},{"key":"615_CR14","volume-title":"Column generation","author":"G Desaulniers","year":"2006","unstructured":"Desaulniers G, Desrosiers J, Solomon MM (2006) Column generation, vol 5. Springer, Berlin"},{"issue":"2","key":"615_CR15","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/s11750-017-0454-3","volume":"25","author":"B Dilkina","year":"2017","unstructured":"Dilkina B, Khalil EB, Nemhauser GL (2017) On learning and branching: a survey. Top 25(2):242\u2013246","journal-title":"Top"},{"key":"615_CR16","unstructured":"Ding J-Y, Zhang C, Shen L, Li S, Wang B, Xu Y, Song L (2019) Optimal solution predictions for mixed integer programs. arXiv preprint arXiv:1906.09575"},{"issue":"4","key":"615_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1002\/net.20338","volume":"54","author":"AL Erera","year":"2009","unstructured":"Erera AL, Savelsbergh M, Uyar E (2009) Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. Networks 54(4):270\u2013283","journal-title":"Networks"},{"key":"615_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.cor.2018.04.006","volume":"106","author":"M Fischetti","year":"2019","unstructured":"Fischetti M, Fraccaro M (2019) Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks. Comput Oper Res 106:289\u2013297","journal-title":"Comput Oper Res"},{"key":"615_CR19","unstructured":"Fran\u00e7ois A, Cappart Q, Rousseau L-M (2019) How to evaluate machine learning approaches for combinatorial optimization: Application to the travelling salesman problem. arXiv preprint arXiv:1909.13121"},{"issue":"3","key":"615_CR20","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R Fukasawa","year":"2006","unstructured":"Fukasawa R, Longo H, Lysgaard J, De Arag\u00e3o MP, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program 106(3):491\u2013511","journal-title":"Math Program"},{"key":"615_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.orhc.2018.03.008","volume":"19","author":"N Furian","year":"2018","unstructured":"Furian N, O\u2019Sullivan M, Walker C, V\u00f6ssner S (2018) Evaluating the impact of optimization algorithms for patient transits dispatching using discrete event simulation. Oper Res Health Care 19:134\u2013155","journal-title":"Oper Res Health Care"},{"key":"615_CR22","first-page":"15554","volume":"68","author":"M Gasse","year":"2019","unstructured":"Gasse M, Ch\u00e9telat D, Ferroni N, Charlin L, Lodi A (2019) Exact combinatorial optimization with graph convolutional neural networks. Adv Neural Inf Process Syst 68:15554\u201315566","journal-title":"Adv Neural Inf Process Syst"},{"issue":"1","key":"615_CR23","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.ejor.2004.01.027","volume":"162","author":"H Gehring","year":"2005","unstructured":"Gehring H, Homberger J (2005) A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. Eur J Oper Res 162(1):220\u2013238","journal-title":"Eur J Oper Res"},{"issue":"2","key":"615_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1287\/trsc.29.2.143","volume":"29","author":"M Gendreau","year":"1995","unstructured":"Gendreau M, Laporte G, S\u00e9guin R (1995) An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transp Sci 29(2):143\u2013155","journal-title":"Transp Sci"},{"issue":"3","key":"615_CR25","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1287\/opre.44.3.469","volume":"44","author":"M Gendreau","year":"1996","unstructured":"Gendreau M, Laporte G, S\u00e9guin R (1996) A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper Res 44(3):469\u2013477","journal-title":"Oper Res"},{"key":"615_CR26","doi-asserted-by":"crossref","unstructured":"Gutschi C, Furian N, Voessner S, Graefe M, Kolios A (2019) Evaluating the performance of maintenance strategies: a simulation-based approach for wind turbines. In: 2019 winter simulation conference (WSC), pp. 842\u2013853","DOI":"10.1109\/WSC40007.2019.9004681"},{"key":"615_CR27","unstructured":"Hansknecht C, Joormann I, Stiller S (2018) Cuts, primal heuristics, and learning to branch for the time-dependent traveling salesman problem. arXiv preprint arXiv:1805.01415"},{"key":"615_CR28","unstructured":"He H, Daum\u00e9\u00a0III H, Eisner J (2014) Learning to search in branch-and-bound algorithms. In: Proceedings of the 27th international conference on neural information processing systems, Vol 2, pp 3293\u20133301"},{"key":"615_CR29","doi-asserted-by":"publisher","first-page":"104781","DOI":"10.1016\/j.cor.2019.104781","volume":"113","author":"A Hottung","year":"2020","unstructured":"Hottung A, Tanaka S, Tierney K (2020) Deep learning assisted heuristic tree search for the container pre-marshalling problem. Comput Oper Res 113:104781","journal-title":"Comput Oper Res"},{"key":"615_CR30","unstructured":"Hottung A, Tierney K (2019) Neural large neighborhood search for the capacitated vehicle routing problem. arXiv preprint arXiv:1911.09539"},{"issue":"3","key":"615_CR31","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. Inf J Comput 18(3):391\u2013406","journal-title":"Inf J Comput"},{"issue":"2","key":"615_CR32","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"},{"key":"615_CR33","unstructured":"Joshi CK, Laurent T, Bresson X (2019) An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227"},{"key":"615_CR34","unstructured":"Kaempfer Y, Wolf L (2018) Learning the multiple traveling salesmen problem with permutation invariant pooling networks. arXiv preprint arXiv:1803.09621"},{"key":"615_CR35","first-page":"6348","volume":"10","author":"E Khalil","year":"2017","unstructured":"Khalil E, Dai H, Zhang Y, Dilkina B, Song L (2017a) Learning combinatorial optimization algorithms over graphs. Adv Neural Inf Process Syst 10:6348\u20136358","journal-title":"Adv Neural Inf Process Syst"},{"key":"615_CR36","doi-asserted-by":"crossref","unstructured":"Khalil EB, Dilkina B, Nemhauser GL, Ahmed S, Shao Y (2017b) Learning to run heuristics in tree search. In: Proceedings of the 26th international joint conference on artificial intelligence, pp 659\u2013666","DOI":"10.24963\/ijcai.2017\/92"},{"key":"615_CR37","doi-asserted-by":"crossref","unstructured":"Khalil EB, Le\u00a0Bodic P, Song L, Nemhauser G, Dilkina B (2016) Learning to branch in mixed integer programming. In Thirtieth AAAI Conference on Artificial Intelligence, pages 724\u2013731. Association for the Advancement of Artificial Intelligence (AAAI)","DOI":"10.1609\/aaai.v30i1.10080"},{"issue":"2","key":"615_CR38","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch T, Achterberg T, Andersen E, Bastert O, Berthold T, Bixby RE, Danna E, Gamrath G, Gleixner AM, Heinz S et al (2011) Miplib 2010. Math Program Comput 3(2):103","journal-title":"Math Program Comput"},{"key":"615_CR39","first-page":"22","volume":"1050","author":"W Kool","year":"2018","unstructured":"Kool W, Hoof H, Welling M (2018) Attention solves your tsp, approximately. Statistics 1050:22","journal-title":"Statistics"},{"key":"615_CR40","doi-asserted-by":"crossref","unstructured":"Kruber M, L\u00fcbbecke ME, Parmentier A (2017) Learning when to use a decomposition. In: International conference on AI and OR techniques in constraint programming for combinatorial optimization problems, pp 202\u2013210. Springer","DOI":"10.1007\/978-3-319-59776-8_16"},{"key":"615_CR41","unstructured":"Li Z, Chen Q, Koltun V (2018) Combinatorial optimization with graph convolutional networks and guided tree search. In: Proceedings of the 32nd international conference on neural information processing systems, pp 537\u2013546. Curran Associates Inc"},{"issue":"3","key":"615_CR42","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.ejor.2015.08.018","volume":"248","author":"GD Liberto","year":"2016","unstructured":"Liberto GD, Kadioglu S, Leo K, Malitsky Y (2016) Dash: dynamic approach for switching heuristics. Eur J Oper Res 248(3):943\u2013953","journal-title":"Eur J Oper Res"},{"key":"615_CR43","doi-asserted-by":"crossref","unstructured":"Lodi A, Mossina L, Rachelson E (2019) Learning to handle parameter perturbations in combinatorial optimization: an application to facility location. arXiv preprint arXiv:1907.05765","DOI":"10.1016\/j.ejtl.2020.100023"},{"issue":"2","key":"615_CR44","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi A, Zarpellon G (2017) On learning and branching: a survey. Top 25(2):207\u2013236","journal-title":"Top"},{"key":"615_CR45","doi-asserted-by":"crossref","unstructured":"Lombardi M Milano M (2018) Boosting combinatorial problem modeling with machine learning. In: Proceedings of the 27th international joint conference on artificial intelligence, pp 5472\u20135478","DOI":"10.24963\/ijcai.2018\/772"},{"issue":"2","key":"615_CR46","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100(2):423\u2013445","journal-title":"Math Program"},{"key":"615_CR47","unstructured":"Marcos\u00a0Alvarez A, Wehenkel L, Louveaux Q (2016) Online learning for strong branching approximation in branch-and-bound. www.optimization-online.org"},{"issue":"1","key":"615_CR48","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ejor.2014.05.005","volume":"239","author":"R Martinelli","year":"2014","unstructured":"Martinelli R, Pecin D, Poggi M (2014) Efficient elementary and restricted non-elementary route pricing. Eur J Oper Res 239(1):102\u2013111","journal-title":"Eur J Oper Res"},{"key":"615_CR49","doi-asserted-by":"crossref","unstructured":"Matsuoka Y, Nishi T, Tiemey K (2019) Machine learning approach for identification of objective function in production scheduling problems. In: 2019 IEEE 15th international conference on automation science and engineering (CASE), pp 679\u2013684","DOI":"10.1109\/COASE.2019.8843054"},{"key":"615_CR50","doi-asserted-by":"crossref","unstructured":"Miki S, Yamamoto D, Ebara H (2018) Applying deep learning and reinforcement learning to traveling salesman problem. In: 2018 international conference on computing, electronics communications engineering (iCCECE), pp 65\u201370","DOI":"10.1109\/iCCECOME.2018.8659266"},{"key":"615_CR51","volume-title":"Machine learning: a probabilistic perspective","author":"KP Murphy","year":"2012","unstructured":"Murphy KP (2012) Machine learning: a probabilistic perspective. MIT press, London"},{"key":"615_CR52","unstructured":"Nazari M, Oroojlooy A, Snyder LV, Tak\u00e1c M (2018a) Deep reinforcement learning for solving the vehicle routing problem. arXiv preprintarXiv:1802.04240"},{"key":"615_CR53","unstructured":"Nazari M, Oroojlooy A, Tak\u00e1\u010d M, Snyder LV (2018b) Reinforcement learning for solving the vehicle routing problem. In: Proceedings of the 32nd international conference on neural information processing systems, pp 9861\u20139871. Curran Associates Inc"},{"issue":"3","key":"615_CR54","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s13676-016-0100-5","volume":"7","author":"J Oyola","year":"2018","unstructured":"Oyola J, Arntzen H, Woodruff DL (2018) The stochastic vehicle routing problem, a literature review, part I: models. EURO J Transp Logist 7(3):193\u2013221","journal-title":"EURO J Transp Logist"},{"issue":"3","key":"615_CR55","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 (2017a) 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":"1","key":"615_CR56","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 (2017b) Improved branch-cut-and-price for capacitated vehicle routing. Math Program Comput 9(1):61\u2013100","journal-title":"Math Program Comput"},{"issue":"1","key":"615_CR57","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10107-020-01523-z","volume":"183","author":"A Pessoa","year":"2020","unstructured":"Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2020) A generic exact solver for vehicle routing and related problems. Math Program 183(1):483\u2013523","journal-title":"Math Program"},{"issue":"1","key":"615_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac V, Gendreau M, Gu\u00e9ret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1\u201311","journal-title":"Eur J Oper Res"},{"issue":"3","key":"615_CR59","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini G, Salani M (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim 3(3):255\u2013273","journal-title":"Discrete Optim"},{"issue":"3","key":"615_CR60","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/net.20212","volume":"51","author":"G Righini","year":"2008","unstructured":"Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155\u2013170","journal-title":"Networks"},{"issue":"1","key":"615_CR61","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/00207543.2015.1043403","volume":"54","author":"U Ritzinger","year":"2016","unstructured":"Ritzinger U, Puchinger J, Hartl RF (2016) A survey on dynamic and stochastic vehicle routing problems. Int J of Prod Res 54(1):215\u2013231","journal-title":"Int J of Prod Res"},{"key":"615_CR62","doi-asserted-by":"crossref","unstructured":"Sabharwal A, Samulowitz H, Reddy C (2012) Guiding combinatorial optimization with uct. In: International conference on integration of artificial intelligence (AI) and operations research (OR) techniques in constraint programming, pp 356\u2013361. Springer","DOI":"10.1007\/978-3-642-29828-8_23"},{"issue":"2","key":"615_CR63","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/j.ejor.2017.04.059","volume":"263","author":"M Schneider","year":"2017","unstructured":"Schneider M, Schwahn F, Vigo D (2017) Designing granular solution methods for routing problems with time windows. Eur J Oper Res 263(2):493\u2013509","journal-title":"Eur J Oper Res"},{"key":"615_CR64","unstructured":"Shylo OV, Shams H (2018) Boosting binary optimization via binary classification: a case study of job shop scheduling. arXiv preprint arXiv:1808.10813"},{"issue":"2","key":"615_CR65","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":"615_CR66","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10852-009-9113-5","volume":"8","author":"K S\u00f6rensen","year":"2009","unstructured":"S\u00f6rensen K, Sevaux M (2009) A practical approach for robust and flexible vehicle routing using metaheuristics and monte carlo sampling. J Math Model Alg 8(4):387","journal-title":"J Math Model Alg"},{"key":"615_CR67","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2954827","author":"Y Sun","year":"2019","unstructured":"Sun Y, Li X, Ernst A (2019) Using statistical measures and machine learning for graph reduction to solve maximum weight clique problems. IEEE Trans Pattern Anal Mach Intell. https:\/\/doi.org\/10.1109\/TPAMI.2019.2954827","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"615_CR68","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/trsc.1090.0303","volume":"44","author":"I Sungur","year":"2010","unstructured":"Sungur I, Ren Y, Ord\u00f3\u00f1ez F, Dessouky M, Zhong H (2010) A model and algorithm for the courier delivery problem with uncertainty. Transp Sci 44(2):193\u2013205","journal-title":"Transp Sci"},{"key":"615_CR69","unstructured":"Tang Y, Agrawal S, Faenza Y (2019) Reinforcement learning for integer programming: Learning to cut. arXiv preprint arXiv:1906.04859"},{"key":"615_CR70","doi-asserted-by":"crossref","unstructured":"Vera JM, Abad AG (2019) Deep reinforcement learning for routing a heterogeneous fleet of vehicles. arXiv preprint arXiv:1912.03341","DOI":"10.1109\/LA-CCI47412.2019.9037042"},{"issue":"12","key":"615_CR71","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1057\/jors.1989.191","volume":"40","author":"CDJ Waters","year":"1989","unstructured":"Waters CDJ (1989) Vehicle-scheduling problems with uncertainty and omitted customers. J Oper Res Soc 40(12):1099\u20131108","journal-title":"J Oper Res Soc"},{"key":"615_CR72","doi-asserted-by":"crossref","unstructured":"Xavier AS, Qiu F, Ahmed S (2019) Learning to solve large-scale security-constrained unit commitment problems. arXiv preprint arXiv:1902.01697","DOI":"10.1287\/ijoc.2020.0976"},{"issue":"10","key":"615_CR73","doi-asserted-by":"publisher","first-page":"3806","DOI":"10.1109\/TITS.2019.2909109","volume":"20","author":"JJQ Yu","year":"2019","unstructured":"Yu JJQ, Yu W, Gu J (2019) Online vehicle routing with neural combinatorial optimization and deep reinforcement learning. IEEE Trans Intell Transp Syst 20(10):3806\u20133817","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"1","key":"615_CR74","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/trsc.1060.0167","volume":"41","author":"H Zhong","year":"2007","unstructured":"Zhong H, Hall RW, Dessouky M (2007) Territory planning and vehicle dispatching with driver learning. Transp Sci 41(1):74\u201389","journal-title":"Transp Sci"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-020-00615-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-020-00615-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-020-00615-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T02:38:38Z","timestamp":1670985518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-020-00615-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,30]]},"references-count":74,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["615"],"URL":"https:\/\/doi.org\/10.1007\/s00291-020-00615-8","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,30]]},"assertion":[{"value":"31 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All authors have declared that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Custom code for branch and price, Gurobi 9.0 for solving LPs.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}