An optimization algorithm for the inventory routing problem with continuous moves

Authors:
Martin Savelsbergh;Jin-Hwa Song
Affiliations:
The Logistics Institute, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA;The Logistics Institute, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA
Venue:
Computers and Operations Research
Year:
2008

Citing 14
Cited 13

One warehouse multiple retailer systems with vehicle routing costs

Management Science
On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems

Management Science
Rejoinder to “Comments on one-warehouse multiple retailer systems with vehicle routing costs”

Management Science
A Markov decision model and decomposition heuristic for dynamic vehicle dispatching

Operations Research
A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities

Transportation Science
Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models

Operations Research
The Stochastic Inventory Routing Problem with Direct Deliveries

Transportation Science
Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing

Manufacturing & Service Operations Management
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem

Transportation Science
A new branch-and-cut algorithm for the capacitated vehicle routing problem

Mathematical Programming: Series A and B
A Periodic Inventory Routing Problem at a Supermarket Chain

Operations Research
Performance Measurement for Inventory Routing

Transportation Science
A Price-Directed Approach to Stochastic Inventory/Routing

Operations Research
A Decomposition Approach for the Inventory-Routing Problem

Transportation Science

High-Performance Local Search for Solving Real-Life Inventory Routing Problems

SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing

Computers and Operations Research
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem

INFORMS Journal on Computing
A branch-and-price algorithm for an integrated production and inventory routing problem

Computers and Operations Research
Randomized Local Search for Real-Life Inventory Routing

Transportation Science
A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing

Operations Research
Branch-and-Price guided search

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Co-evolutionary immuno-particle swarm optimization with penetrated hyper-mutation for distributed inventory replenishment

Engineering Applications of Artificial Intelligence
A maritime inventory routing problem: Practical approach

Computers and Operations Research
Large neighborhood search for LNG inventory routing

Journal of Heuristics
A branch-and-price guided search approach to maritime inventory routing

Computers and Operations Research
Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem

INFORMS Journal on Computing
Improved Load Plan Design Through Integer Programming Based Local Search

Transportation Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all be reached with out-and-back trips. Unfortunately, this is not always the reality. We focus on the inventory routing problem with continuous moves, which incorporates two important real-life complexities: limited product availabilities at facilities and customers that cannot be served using out-and-back tours. We need to design delivery tours spanning several days, covering huge geographic areas, and involving product pickups at different facilities. We develop an integer programming based optimization algorithm capable of solving small to medium size instances. This optimization algorithm is embedded in local search procedure to improve solutions produced by a randomized greedy heuristic. We demonstrate the effectiveness of this approach in an extensive computational study.