A convex optimization approach for solving the single-vehicle cyclic inventory routing problem
From MaRDI portal
Publication:342382
DOI10.1016/j.cor.2016.02.010zbMath1349.90096OpenAlexW2285550679MaRDI QIDQ342382
Khaled Hadj-Hamou, El-Houssaine Aghezzaf, Wouter Lefever
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.02.010
Convex programming (90C25) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items (3)
Team Orienteering with Time-Varying Profit ⋮ Long‐term effects of short planning horizons for inventory routing problems ⋮ Stochastic inventory routing with time-based shipment consolidation
Cites Work
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
- The production routing problem: a review of formulations and solution algorithms
- A decomposition-based heuristic for the multiple-product inventory-routing problem
- The exact solution of several classes of inventory-routing problems
- A practical solution approach for the cyclic inventory routing problem
- Industrial aspects and literature survey: Combined inventory management and routing
- Modeling inventory routing problems in supply chains of high consumption products
- Probabilistic Analyses and Algorithms for Three-Level Distribution Systems
- Analysis of the single-vehicle cyclic inventory routing problem
- One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
- Analysis and Solution Developement of the Single-Vehicle Inventory Routing Problem
- Distribution Strategies that Minimize Transportation and Inventory Costs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Integrating Routing and Inventory Decisions in One-Warehouse Multiretailer Multiproduct Distribution Systems
- Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds
- A Location Based Heuristic for General Routing Problems
- Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories
- A Price-Directed Approach to Stochastic Inventory/Routing
This page was built for publication: A convex optimization approach for solving the single-vehicle cyclic inventory routing problem