A survey on matheuristics for routing problems

In this paper, we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework. Matheuristics have been applied to several different routing problems and include a number of different approaches. We propose a classification in three classes of matheuristics: decomposition approaches, improvement heuristics and branch-and-price/column generation-based approaches. The contribution of this paper is to offer to researchers interested in routing problems a structured overview of the most successful ideas to combine heuristic schemes and mathematical programming models to obtain high quality solutions. Moreover, we analyze the state of the art and provide insights and hints for future research.

[1]  Claude Le Pape,et al.  Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows , 2005 .

[2]  William J. Guerrero,et al.  Hybrid heuristic for the inventory location-routing problem with deterministic demand , 2013 .

[3]  Frits C. R. Spieksma,et al.  A metaheuristic for the school bus routing problem with bus stop selection , 2013, Eur. J. Oper. Res..

[4]  Juan José Salazar González,et al.  Hybridization of very large neighborhood search for ready-mixed concrete delivery problems , 2010, Comput. Oper. Res..

[5]  Mikael Rönnqvist,et al.  A hybrid method based on linear programming and tabu search for routing of logging trucks , 2009, Comput. Oper. Res..

[6]  Maria Grazia Speranza,et al.  The Split Delivery Vehicle Routing Problem: A Survey , 2008 .

[7]  Martin W. P. Savelsbergh,et al.  An optimization algorithm for the inventory routing problem with continuous moves , 2008, Comput. Oper. Res..

[8]  Gilbert Laporte,et al.  The inventory-routing problem with transshipment , 2012, Comput. Oper. Res..

[9]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[10]  Maria Grazia Speranza,et al.  Optimal solutions for routing problems with profits , 2013, Discret. Appl. Math..

[11]  Hanane Allaoua,et al.  A matheuristic approach for solving a home health care problem , 2013, Electron. Notes Discret. Math..

[12]  David M. Ryan,et al.  An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .

[13]  Martin W. P. Savelsbergh,et al.  An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem , 2008, Transp. Sci..

[14]  Maria Grazia Speranza,et al.  The capacitated team orienteering problem with incomplete service , 2013, Optim. Lett..

[15]  Jean-François Cordeau,et al.  Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints , 2012, OR Spectr..

[16]  Christian Prins,et al.  A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem , 2010, Matheuristics.

[17]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[18]  Bruce L. Golden,et al.  The split delivery vehicle routing problem with minimum delivery amounts , 2010 .

[19]  Arturo Hernández Aguirre,et al.  AN ESTIMATION OF DISTRIBUTION ALGORITHM FOR THE SCHOOL BUS ROUTING PROBLEM WITH BUS STOP SELECTION , 2016 .

[20]  Daniele Vigo,et al.  Vehicle Routing Problems with Profits , 2014, Vehicle Routing.

[21]  Hokey Min,et al.  Combined location-routing problems: A synthesis and future research directions , 1998, Eur. J. Oper. Res..

[22]  Nenad Mladenovic,et al.  Routing of barge container ships by mixed-integer programming heuristics , 2013, Appl. Soft Comput..

[23]  Anand Subramanian,et al.  A hybrid algorithm for a class of vehicle routing problems , 2013, Comput. Oper. Res..

[24]  H. D. Ratliff,et al.  Set partitioning based heuristics for interactive routing , 1981, Networks.

[25]  Stéphane Dauzère-Pérès,et al.  A Two-Phase Iterative Heuristic Approach for the Production Routing Problem , 2015, Transp. Sci..

[26]  Verena Schmid,et al.  Hybrid column generation and large neighborhood search for the dial-a-ride problem , 2013, Comput. Oper. Res..

[27]  David Simchi-Levi,et al.  Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows , 1996, Oper. Res..

[28]  M. Ball Heuristics based on mathematical programming , 2011 .

[29]  Kjetil Fagerholt,et al.  Routing and scheduling in a liquefied natural gas shipping problem with inventory and berth constraints , 2010, Annals of Operations Research.

[30]  El Houssaine Aghezzaf,et al.  Production , Manufacturing and Logistics A practical solution approach for the cyclic inventory routing problem , 2008 .

[31]  Jean-François Cordeau,et al.  Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem , 2011, Transp. Sci..

[32]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[33]  Günther R. Raidl,et al.  Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.

[34]  Inmaculada Rodríguez-Martín,et al.  A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem , 2012 .

[35]  B. Golden,et al.  Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .

[36]  Matteo Fischetti,et al.  A new ILP-based refinement heuristic for Vehicle Routing Problems , 2006, Math. Program..

[37]  Gilbert Laporte,et al.  An Improved Petal Heuristic for the Vehicle Routeing Problem , 1996 .

[38]  Gilbert Laporte,et al.  Consistency in multi-vehicle inventory-routing , 2012 .

[39]  Gilbert Laporte,et al.  An adaptive large neighborhood search heuristic for the Pollution-Routing Problem , 2012, Eur. J. Oper. Res..

[40]  David Simchi-Levi,et al.  Analysis of vehicle routing and inventory-routing problems , 1995 .

[41]  Martin W. P. Savelsbergh,et al.  A Decomposition Approach for the Inventory-Routing Problem , 2004, Transp. Sci..

[42]  Bruce L. Golden,et al.  Very large-scale vehicle routing: new test problems, algorithms, and results , 2005, Comput. Oper. Res..

[43]  Marshall L. Fisher,et al.  Coordination of production and distribution planning , 1994 .

[44]  Luca Bertazzi,et al.  Analysis of the maximum level policy in a production-distribution system , 2011, Comput. Oper. Res..

[45]  Nubia Velasco,et al.  A matheuristic for the truck and trailer routing problem , 2013, Eur. J. Oper. Res..

[46]  Christelle Guéret,et al.  A parallel matheuristic for the technician routing and scheduling problem , 2013, Optim. Lett..

[47]  Karl F. Doerner,et al.  A heuristic algorithm for the free newspaper delivery problem , 2013, Eur. J. Oper. Res..

[48]  Linet Özdamar,et al.  A dynamic logistics coordination model for evacuation and support in disaster response activities , 2007, Eur. J. Oper. Res..

[49]  Andrés L. Medaglia,et al.  Hybrid Algorithm for Route Design on Bus Rapid Transit Systems , 2015, Transp. Sci..

[50]  Kjetil Fagerholt,et al.  A construction and improvement heuristic for a liquefied natural gas inventory routing problem , 2012, Comput. Ind. Eng..

[51]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[52]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[53]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[54]  Bülent Çatay,et al.  A Parallel Matheuristic for Solving the Vehicle Routing Problems , 2014 .

[55]  Guy Desaulniers,et al.  A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows , 2009 .

[56]  Stochastic Demand,et al.  Inventory Routing with , 2012 .

[57]  Daniele Vigo,et al.  Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management , 2014, Transp. Sci..

[58]  Michel Gendreau,et al.  A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[59]  Inmaculada Rodríguez Martín,et al.  The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic , 2011, INOC.

[60]  Jen-Shiang Chen,et al.  Mixed binary integer programming formulations for the reentrant job shop scheduling problem , 2005, Comput. Oper. Res..

[61]  Antonio Bolufé Röhler,et al.  Matheuristics: Optimization, Simulation and Control , 2009, Hybrid Metaheuristics.

[62]  Jorge E. Mendoza,et al.  A multi-space sampling heuristic for the vehicle routing problem with stochastic demands , 2013, Optim. Lett..

[63]  James P. Kelly,et al.  A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem , 1996, Transp. Sci..

[64]  Inge Norstad,et al.  A rolling horizon heuristic for creating a liquefied natural gas annual delivery program , 2011 .

[65]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[66]  Frank Meisel,et al.  Workforce routing and scheduling for electricity network maintenance with downtime minimization , 2013, Eur. J. Oper. Res..

[67]  Jean-Yves Potvin,et al.  Vehicle Routing , 2009, Encyclopedia of Optimization.

[68]  Nora Touati Moungla,et al.  A Matheuristic for the Dial-a-Ride Problem , 2011, INOC.

[69]  Marielle Christiansen,et al.  Hybrid heuristics for a short sea inventory routing problem , 2014, Eur. J. Oper. Res..

[70]  Karl F. Doerner,et al.  Survey: Matheuristics for Rich Vehicle Routing Problems , 2010, Hybrid Metaheuristics.

[71]  Valentina Cacchiani,et al.  A set-covering based heuristic algorithm for the periodic vehicle routing problem , 2014, Discret. Appl. Math..

[72]  Alain Hertz,et al.  The split delivery capacitated team orienteering problem , 2010, Networks.

[73]  Maria Grazia Speranza,et al.  Vehicle routing problems with split deliveries , 2012, Int. Trans. Oper. Res..

[74]  Fred Glover,et al.  Extensions of the Petal Method for Vehicle Routeing , 1993 .

[75]  Maria Grazia Speranza,et al.  A column generation approach for the split delivery vehicle routing problem , 2011, Networks.

[76]  Paolo Toth,et al.  An ILP improvement procedure for the Open Vehicle Routing Problem , 2008, Comput. Oper. Res..

[77]  Maria Grazia Speranza,et al.  An ILP-refined tabu search for the Directed Profitable Rural Postman Problem , 2014, Discret. Appl. Math..

[78]  El-Houssaine Aghezzaf,et al.  Designing distribution patterns for long-term inventory routing with constant demand rates , 2008 .

[79]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[80]  Luca Bertazzi,et al.  A Hybrid Heuristic for an Inventory Routing Problem , 2012, INFORMS J. Comput..

[81]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[82]  Luca Bertazzi,et al.  Matheuristics for Inventory Routing Problems , 2012 .

[83]  Alain Hertz,et al.  Incomplete service and split deliveries in a routing problem with profits , 2014, Networks.

[84]  M. Savelsbergh,et al.  The Inventory Routing Problem , 1998 .

[85]  Hendrik Van Landeghem,et al.  Modeling inventory routing problems in supply chains of high consumption products , 2006, Eur. J. Oper. Res..

[86]  Guy Desaulniers,et al.  A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows , 2009, Networks.

[87]  James P. Kelly,et al.  A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem , 1999, INFORMS J. Comput..

[88]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[89]  Awi Federgruen,et al.  A Combined Vehicle Routing and Inventory Allocation Problem , 1984, Oper. Res..

[90]  Gerard Sierksma,et al.  Routing helicopters for crew exchanges on off-shore locations , 1998, Ann. Oper. Res..

[91]  Kevin C. Furman,et al.  A maritime inventory routing problem: Practical approach , 2013, Comput. Oper. Res..

[92]  Ángel Corberán,et al.  A matheuristic for the Team Orienteering Arc Routing Problem , 2015, Eur. J. Oper. Res..

[93]  Martin W. P. Savelsbergh,et al.  A Hybrid Solution Approach for Ready-Mixed Concrete Delivery , 2009, Transp. Sci..

[94]  Angel B. Ruiz,et al.  Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic , 2007, Transp. Sci..

[95]  Feng Chu,et al.  A new model and hybrid approach for large scale inventory routing problems , 2008, Eur. J. Oper. Res..

[96]  Christian Blum,et al.  Hybrid Metaheuristics , 2010, Artificial Intelligence: Foundations, Theory, and Algorithms.

[97]  Jean-François Cordeau,et al.  Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling , 2000, Transp. Sci..

[98]  Cynthia Barnhart,et al.  Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions , 2003 .

[99]  Warren B. Powell,et al.  An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..

[100]  Hanif D. Sherali,et al.  Fleet management models and algorithms for an oil-tanker routing and scheduling problem , 1999 .