A machine learning-based branch and price algorithm for a sampled vehicle routing problem

[1]  Athanasios Kolios,et al.  Evaluating the Performance of Maintenance Strategies: A Simulation-based Approach for Wind Turbines , 2019, 2019 Winter Simulation Conference (WSC).

[2]  Andreas T. Ernst,et al.  Using Statistical Measures and Machine Learning for Graph Reduction to Solve Maximum Weight Clique Problems , 2019, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  André Hottung,et al.  Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem , 2019, ECAI.

[4]  Andres G. Abad,et al.  Deep Reinforcement Learning for Routing a Heterogeneous Fleet of Vehicles , 2019, 2019 IEEE Latin American Conference on Computational Intelligence (LA-CCI).

[5]  Louis-Martin Rousseau,et al.  How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman Problem , 2019, ArXiv.

[6]  Tatsushi Nishi,et al.  Machine Learning Approach for Identification of Objective Function in Production Scheduling Problems , 2019, 2019 IEEE 15th International Conference on Automation Science and Engineering (CASE).

[7]  Andrea Lodi,et al.  Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location , 2019, EURO J. Transp. Logist..

[8]  Le Song,et al.  Optimal Solution Predictions for Mixed Integer Programs , 2019, ArXiv.

[9]  Yunhao Tang,et al.  Reinforcement Learning for Integer Programming: Learning to Cut , 2019, ICML.

[10]  Andrea Lodi,et al.  Exact Combinatorial Optimization with Graph Convolutional Neural Networks , 2019, NeurIPS.

[11]  Xavier Bresson,et al.  An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem , 2019, ArXiv.

[12]  Ruslan Sadykov,et al.  A generic exact solver for vehicle routing and related problems , 2019, Mathematical Programming.

[13]  James J. Q. Yu,et al.  Online Vehicle Routing With Neural Combinatorial Optimization and Deep Reinforcement Learning , 2019, IEEE Transactions on Intelligent Transportation Systems.

[14]  Feng Qiu,et al.  Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems , 2019, INFORMS J. Comput..

[15]  Siegfried Vössner,et al.  Evaluating the impact of optimization algorithms for patient transits dispatching using discrete event simulation , 2018, Operations Research for Health Care.

[16]  Yoshua Bengio,et al.  Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon , 2018, Eur. J. Oper. Res..

[17]  Zhuwen Li,et al.  Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search , 2018, NeurIPS.

[18]  Oleg V. Shylo,et al.  Boosting Binary Optimization via Binary Classification: A Case Study of Job Shop Scheduling , 2018, ArXiv.

[19]  Daisuke Yamamoto,et al.  Applying Deep Learning and Reinforcement Learning to Traveling Salesman Problem , 2018, 2018 International Conference on Computing, Electronics & Communications Engineering (iCCECE).

[20]  Michele Lombardi,et al.  Boosting Combinatorial Problem Modeling with Machine Learning , 2018, IJCAI.

[21]  Guy Desaulniers,et al.  Exact Branch-Price-and-Cut Algorithms for Vehicle Routing , 2018, Transp. Sci..

[22]  Ruslan Sadykov,et al.  A branch-and-price algorithm for the Minimum Latency Problem , 2018, Comput. Oper. Res..

[23]  Marco Fraccaro,et al.  Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks , 2018, Comput. Oper. Res..

[24]  Maria-Florina Balcan,et al.  Learning to Branch , 2018, ICML.

[25]  Lior Wolf,et al.  Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks , 2018, ArXiv.

[26]  Wouter Kool,et al.  Attention Solves Your TSP, Approximately , 2018 .

[27]  Lawrence V. Snyder,et al.  Reinforcement Learning for Solving the Vehicle Routing Problem , 2018, NeurIPS.

[28]  Daniele Vigo,et al.  Designing granular solution methods for routing problems with time windows , 2017, Eur. J. Oper. Res..

[29]  Damithabandara.  An Application to the Travelling Salesman Problem , 2017 .

[30]  Kevin Tierney,et al.  Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem , 2017, Comput. Oper. Res..

[31]  George L. Nemhauser,et al.  Learning to Run Heuristics in Tree Search , 2017, IJCAI.

[32]  Andrea Lodi,et al.  On learning and branching: a survey , 2017 .

[33]  Marco E. Lübbecke,et al.  Learning When to Use a Decomposition , 2017, CPAIOR.

[34]  Elias Boutros Khalil,et al.  Learning Combinatorial Optimization Algorithms over Graphs , 2017, NIPS.

[35]  Louis Wehenkel,et al.  A Machine Learning-Based Approximation of Strong Branching , 2017, INFORMS J. Comput..

[36]  David L. Woodruff,et al.  The stochastic vehicle routing problem, a literature review, part I: models , 2016, EURO J. Transp. Logist..

[37]  Kris Braekers,et al.  The vehicle routing problem: State of the art classification and review , 2016, Comput. Ind. Eng..

[38]  Le Song,et al.  Learning to Branch in Mixed Integer Programming , 2016, AAAI.

[39]  Guy Desaulniers,et al.  New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows , 2016, INFORMS J. Comput..

[40]  Richard F. Hartl,et al.  A survey on dynamic and stochastic vehicle routing problems , 2016 .

[41]  He He,et al.  Learning to Search in Branch and Bound Algorithms , 2014, NIPS.

[42]  Marcus Poggi de Aragão,et al.  Efficient elementary and restricted non-elementary route pricing , 2014, Eur. J. Oper. Res..

[43]  Gilbert Laporte,et al.  The dynamic multiperiod vehicle routing problem with probabilistic information , 2014, Comput. Oper. Res..

[44]  M. P. Aragão,et al.  Improved branch-cut-and-price for capacitated vehicle routing , 2014, Math. Program. Comput..

[45]  Rafael Martinelli,et al.  A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints , 2014, Discret. Optim..

[46]  Ann Melissa Campbell,et al.  Forty years of periodic vehicle routing , 2014, Networks.

[47]  T. Range.  Exploiting Set-Based Structures to Accelerate Dynamic Programming Algorithms for the Elementary Shortest Path Problem with Resource Constraints , 2013 .

[48]  Yuri Malitsky,et al.  DASH: Dynamic Approach for Switching Heuristics , 2013, Eur. J. Oper. Res..

[49]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[50]  Kevin P. Murphy,et al.  Machine learning - a probabilistic perspective , 2012, Adaptive computation and machine learning series.

[51]  Ashish Sabharwal,et al.  Guiding Combinatorial Optimization with UCT , 2012, CPAIOR.

[52]  Roberto Roberti,et al.  New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..

[53]  Andrea Lodi,et al.  MIPLIB 2010 , 2011, Math. Program. Comput..

[54]  Maged M. Dessouky,et al.  A Model and Algorithm for the Courier Delivery Problem with Uncertainty , 2010, Transp. Sci..

[55]  Martin W. P. Savelsbergh,et al.  Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints , 2009, Networks.

[56]  Kenneth Sörensen,et al.  A Practical Approach for Robust and Flexible Vehicle Routing Using Metaheuristics and Monte Carlo Sampling , 2009, J. Math. Model. Algorithms.

[57]  William Emrouznejad,et al.  Traveling Salesman Problem , 2008 .

[58]  Giovanni Righini,et al.  New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.

[59]  David Pisinger,et al.  Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..

[60]  Randolph W. Hall,et al.  Territory Planning and Vehicle Dispatching with Driver Learning , 2007, Transp. Sci..

[61]  Giovanni Righini,et al.  Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..

[62]  Stefan Irnich,et al.  The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..

[63]  Thorsten Koch,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

[64]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2004, Math. Program..

[65]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[66]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

[67]  Gilbert Laporte,et al.  An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers , 1995, Transp. Sci..

[68]  G. Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[69]  C. Waters.  Vehicle-scheduling Problems with Uncertainty and Omitted Customers , 1989 .

[70]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[71]  2021 International Conference on Computing, Electronics & Communications Engineering (iCCECE) , 2021 .

[72]  Louis Wehenkel,et al.  Online Learning for Strong Branching Approximation in Branch-and-Bound , 2016 .

[73]  Thorsten Koch,et al.  Branching rules revisited , 2005, Oper. Res. Lett..