A kernel search heuristic for the multivehicle inventory routing problem

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

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

[3]  Wilco van den Heuvel,et al.  Worst case analysis of Relax and Fix heuristics for lot-sizing problems , 2019, Eur. J. Oper. Res..

[4]  Leandro C. Coelho,et al.  A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem , 2014, Transp. Sci..

[5]  Reinaldo Morabito,et al.  Iterated local search and simulated annealing algorithms for the inventory routing problem , 2018, Int. Trans. Oper. Res..

[6]  Gilbert Laporte,et al.  Thirty Years of Inventory Routing , 2014, Transp. Sci..

[7]  Maria Grazia Speranza,et al.  A Matheuristic for the Multivehicle Inventory Routing Problem , 2017, INFORMS J. Comput..

[8]  Leandro C. Coelho,et al.  The exact solution of several classes of inventory-routing problems , 2013, Comput. Oper. Res..

[9]  John L. Mann,et al.  Flowsheet decomposition heuristic for scheduling: a relax-and-fix method , 2004, Comput. Chem. Eng..

[10]  Reinaldo Morabito,et al.  Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants , 2010, Comput. Oper. Res..

[11]  Stefan Irnich,et al.  Formulations for an inventory routing problem , 2014, Int. Trans. Oper. Res..

[12]  Rosa Basagoiti,et al.  A survey on the inventory-routing problem with stochastic lead times and demands , 2017, J. Appl. Log..

[13]  Maria Grazia Speranza,et al.  The inventory routing problem: the value of integration , 2016, Int. Trans. Oper. Res..

[14]  Mariá Cristina Vasconcelos Nascimento,et al.  A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over , 2018, Comput. Oper. Res..

[15]  Louis M. Dalberto,et al.  Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .

[16]  José A. Moreno-Pérez,et al.  A Kernel Search Matheuristic to Solve The Discrete Leader-Follower Location Problem , 2019, Networks and Spatial Economics.

[17]  Celso C. Ribeiro,et al.  Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax-and-fix heuristic , 2018, Int. Trans. Oper. Res..

[18]  Luca Bertazzi,et al.  Inventory routing problems with multiple customers , 2013, EURO J. Transp. Logist..

[19]  Maria Grazia Speranza,et al.  A heuristic framework for the bi-objective enhanced index tracking problem , 2016 .

[20]  Claudio Fabiano Motta Toledo,et al.  A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems , 2015, Journal of Heuristics.

[21]  Cid C. de Souza,et al.  Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic , 2014, Eur. J. Oper. Res..

[22]  Leandro C. Coelho,et al.  Improved solutions for inventory-routing problems through valid inequalities and input ordering , 2014 .

[23]  Luca Bertazzi,et al.  Inventory routing problems: an introduction , 2012, EURO J. Transp. Logist..

[24]  Yossiri Adulyasak,et al.  Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems , 2012, INFORMS J. Comput..

[25]  Martin W. P. Savelsbergh,et al.  Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs , 2017, Eur. J. Oper. Res..

[26]  Gilbert Laporte,et al.  A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem , 2013 .

[27]  Luidi Simonetti,et al.  A Hybrid Heuristic based on Iterated Local Search for Multivehicle Inventory Routing Problem , 2016, Electron. Notes Discret. Math..

[28]  Jean-François Cordeau,et al.  A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing , 2019, INFORMS J. Comput..

[29]  Martine Labbé,et al.  Mixed Integer Linear Programming for Feature Selection in Support Vector Machine , 2018, Discret. Appl. Math..

[30]  Luca Bertazzi,et al.  A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem , 2007, Transp. Sci..

[31]  Maria Grazia Speranza,et al.  Kernel search: A general heuristic for the multi-dimensional knapsack problem , 2010, Comput. Oper. Res..