Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment

DOI10.1016/J.COR.2018.05.023zbMath1391.90017OpenAlexW2807481151WikidataQ129759566 ScholiaQ129759566MaRDI QIDQ1651650

Bernard Penz, Wouter Lefever, El-Houssaine Aghezzaf, Khaled Hadj-Hamou

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.05.023

zbMATH Keywords

valid inequalitiesreformulationtransshipmentinventory-routing problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05) Traffic problems in operations research (90B20)

Related Items (9)

The two-echelon inventory-routing problem with fleet management ⋮ A mathematical programming-based heuristic for the production routing problem with transshipments ⋮ A matheuristic for solving inventory sharing problems ⋮ The optimal order decisions of a risk-averse newsvendor under backlogging ⋮ On the zero-inventory-ordering policy in the inventory routing problem ⋮ The inventory routing problem with demand moves ⋮ Spare parts inventory routing problem with transshipment and substitutions under stochastic demands ⋮ The two-echelon production-routing problem ⋮ Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation

Cites Work

• Heuristics for dynamic and stochastic inventory-routing
• The exact solution of several classes of inventory-routing problems
• A general heuristic for vehicle routing problems
• The inventory-routing problem with transshipment
• Industrial aspects and literature survey: Combined inventory management and routing
• Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems
• Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
• Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances

This page was built for publication: Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment