An improved formulation for the inventory routing problem with time-varying demands

DOI10.1016/j.ejor.2022.02.011OpenAlexW4293255437MaRDI QIDQ2672144

Magnus Stålhane, Guy Desaulniers, Jørgen Skålnes, Henrik Andersson

Publication date: 8 June 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.02.011

zbMATH Keywords

valid inequalitiesbranch-and-cutroutingDantzig-Wolfe reformulationinventory routing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Related Items

A branch-and-cut embedded matheuristic for the inventory routing problem, On the zero-inventory-ordering policy in the inventory routing problem

Uses Software

• CVRPSP

Cites Work

• A branch and bound algorithm for the capacitated vehicle routing problem
• The two-echelon multi-depot inventory-routing problem
• Inventory routing with pickups and deliveries
• The inventory-routing problem with transshipment
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
• The inventory routing problem with demand moves
• Industrial aspects and literature survey: Combined inventory management and routing
• A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
• A note on the separation of subtour elimination constraints in elementary shortest path problems
• The two-echelon inventory-routing problem with fleet management
• An iterative matheuristic for the inventory routing problem
• A Hybrid Heuristic for an Inventory Routing Problem
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Decomposition Principle for Linear Programs
• A Matheuristic for the Multivehicle Inventory Routing Problem
• Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
• A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
• A Graph-Theoretic Equivalence for Integer Programs
• Linear programming. Foundations and extensions