Combinatorial Heuristics for Inventory Routing Problems

DOI10.1287/ijoc.2021.1064zbMath1492.90022OpenAlexW3195186175MaRDI QIDQ5084657

R. Ravi, Yang Jiao, Ziye Tang

Publication date: 28 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2021.1064

zbMATH Keywords

heuristicslarge neighborhood searchinventory routing problemprize-collecting Steiner tree

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (1)

Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
• Approximation algorithms for inventory problems with submodular or routing costs
• A note on the prize collecting traveling salesman problem
• Incorporating inventory and routing costs in strategic location models
• Computational complexity of uncapacitated multi-echelon production planning problems
• Thinning out Steiner trees: a node-based model for uniform edge costs
• The inventory-routing problem with transshipment
• A new model and hybrid approach for large scale inventory routing problems
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
• A Hybrid Heuristic for an Inventory Routing Problem
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem
• A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
• APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
• Distribution Strategies that Minimize Transportation and Inventory Costs
• An Integrated Inventory Allocation and Vehicle Routing Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Survey of Lagrangean Techniques for Discrete Optimization
• A Matheuristic for the Multivehicle Inventory Routing Problem
• Validation of subgradient optimization
• A General Approximation Technique for Constrained Forest Problems
• Formulations for an inventory routing problem
• A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
• Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
• Better Approximation Bounds for the Joint Replenishment Problem
• Primal-Dual Algorithms for Deterministic Inventory Problems

This page was built for publication: Combinatorial Heuristics for Inventory Routing Problems