Multi-objective inventory routing with uncertain demand using population-based metaheuristics

This article studies a tri-objective formulation of the inventory routing problem, extending the recently studied bi-objective formulation. As compared to distance cost and inventory cost, which were discussed in previous work, it also considers stockout cost as a third objective. Demand is modeled as a Poisson random variable. State-of-the-art evolutionary multi-objective optimization algorithms and a new method based on swarm intelligence are used to compute approximation of the 3-D Pareto front. A benchmark previously used in bi-objective inventory routing is extended by incorporating a stochastic demand model with an expected value that equals the average demand of the original benchmark. The results provide insights into the shape of the optimal trade-off surface. Based on this the dependences between different objectives are clarified and discussed. Moreover, the performances of the four different algorithmic methods are compared and due to the consistency in the results, it can be concluded that a near optimal approximation to the Pareto front can be found for problems of practically relevant size.

[1]  Michael Emmerich,et al.  Logarithmic-Time Updates in SMS-EMOA and Hypervolume-Based Archiving , 2013 .

[2]  Shuang Chen,et al.  Model and algorithm for inventory/routing decision in a three-echelon logistics system , 2008, Eur. J. Oper. Res..

[3]  Helena Ramalhinho Dias Lourenço,et al.  Inventory-Routing Model, for a Multi-Period Problem with Stochastic and Deterministic Demand , 2003 .

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

[5]  Nazmul Siddique,et al.  Computational Intelligence: Synergies of Fuzzy Logic, Neural Networks and Evolutionary Computing , 2013 .

[6]  James A. Reggia,et al.  A distributed learning algorithm for particle systems , 2009, Integr. Comput. Aided Eng..

[7]  Yehuda Bassok,et al.  Direct shipping and the dynamic single-depot/multi-retailer inventory system , 1997 .

[8]  Guillermo Gallego,et al.  On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R -systems , 1990 .

[9]  Nicola Beume,et al.  An EMO Algorithm Using the Hypervolume Measure as Selection Criterion , 2005, EMO.

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

[11]  Jürgen Teich,et al.  Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO) , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[12]  Martin W. P. Savelsbergh,et al.  The Stochastic Inventory Routing Problem with Direct Deliveries , 2002, Transp. Sci..

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

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

[15]  Michael T. M. Emmerich,et al.  Mixed-integer optimization of coronary vessel image analysis using evolution strategies , 2006, GECCO '06.

[16]  Moshe Dror,et al.  Inventory/routing: Reduction from an annual to a short-period problem , 1987 .

[17]  Marc Sevaux,et al.  The Biobjective Inventory Routing Problem - Problem Solution and Decision Support , 2011, INOC.

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

[19]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[20]  Yuping Wang,et al.  Multiobjective bilevel optimization for production-distribution planning problems using hybrid genetic algorithm , 2014, Integr. Comput. Aided Eng..

[21]  Nicola Beume,et al.  SMS-EMOA: Multiobjective selection based on dominated hypervolume , 2007, Eur. J. Oper. Res..

[22]  Francisco Orozco,et al.  Ant Colony Optimization Model for Tsunamis Evacuation Routes , 2014, Comput. Aided Civ. Infrastructure Eng..

[23]  Randolph W. Hall,et al.  Distribution Strategies that Minimize Transportation and Inventory Costs , 1985, Oper. Res..

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

[25]  Awi Federgruen,et al.  One warehouse multiple retailer systems with vehicle routing costs , 1990 .

[26]  Tshilidzi Marwala,et al.  Finite element model updating using fish school search and volitive particle swarm optimization , 2015, Integr. Comput. Aided Eng..

[27]  Sandra Huber,et al.  Interactive Reference Point-Based Guided Local Search for the Bi-objective Inventory Routing Problem , 2013, ArXiv.

[28]  Pei Chun Lin,et al.  A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty , 2010 .

[29]  C.A. Coello Coello,et al.  MOPSO: a proposal for multiple objective particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[30]  Qingfu Zhang,et al.  Global path planning of wheeled robots using multi-objective memetic algorithms , 2015, Integr. Comput. Aided Eng..

[31]  Tobias Friedrich,et al.  Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice , 2009, EMO.

[32]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[33]  Kalyanmoy Deb,et al.  U-NSGA-III: A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives: Proof-of-Principle Results , 2015, EMO.

[34]  Tohru Ikeguchi,et al.  An optimum strategy for dynamic and stochastic packet routing problems by chaotic neurodynamics , 2007, Integr. Comput. Aided Eng..

[35]  Jiefeng Xu,et al.  Solving An Integrated Logistics Problem Arising In Grocery Distribution , 1996 .

[36]  Fazhi He,et al.  A hybrid optimization approach for sustainable process planning and scheduling , 2018, Integr. Comput. Aided Eng..

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

[38]  Said Salhi,et al.  An Efficient Hybrid Genetic Algorithm for the MultiProduct Multi Period Inventory Routing Problem , 2011 .

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

[40]  Oscar Cordón,et al.  Evolutionary multi-objective optimization for mesh simplification of 3D open models , 2013, Integr. Comput. Aided Eng..

[41]  Jürgen Branke,et al.  Multi-objective particle swarm optimization on computer grids , 2007, GECCO '07.

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

[43]  Carlos M. Fonseca,et al.  A Fast Dimension-Sweep Algorithm for the Hypervolume Indicator in Four Dimensions , 2012, CCCG.

[44]  Mauro Birattari,et al.  Dm63 Heuristics for Combinatorial Optimization Ant Colony Optimization Exercises Outline Ant Colony Optimization: the Metaheuristic Application Examples Generalized Assignment Problem (gap) Connection between Aco and Other Metaheuristics Encodings Capacited Vehicle Routing Linear Ordering Ant Colony , 2022 .

[45]  Haldun Süral,et al.  A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem , 2011, Transp. Sci..

[46]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[47]  Thomas Bäck,et al.  Multicriteria Inventory Routing by Cooperative Swarms and Evolutionary Algorithms , 2015, IWINAC.

[48]  Aminah Robinson Fayek,et al.  A multi-criteria optimization framework for industrial shop scheduling using fuzzy set theory , 2010, Integr. Comput. Aided Eng..

[49]  Thomas Bäck,et al.  Ant based solver for dynamic vehicle routing problem with time windows and multiple priorities , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[50]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

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

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

[53]  Carlos M. Fonseca,et al.  Computing Hypervolume Contributions in Low Dimensions: Asymptotically Optimal Algorithm and Complexity Results , 2011, EMO.

[54]  Luca Bertazzi,et al.  Deterministic Order-Up-To Level Policies in an Inventory Routing Problem , 2002, Transp. Sci..

[55]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[56]  Thomas Bäck,et al.  Ant Colony Algorithms for the Dynamic Vehicle Routing Problem with Time Windows , 2013, IWINAC.

[57]  Richard T. Wong,et al.  An Integrated Inventory Allocation and Vehicle Routing Problem , 1989, Transp. Sci..

[58]  Gexiang Zhang,et al.  Multicriteria adaptive differential evolution for global numerical optimization , 2015, Integr. Comput. Aided Eng..