Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem
Transportation Science
An optimization algorithm for the inventory routing problem with continuous moves
Computers and Operations Research
An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
INFORMS Journal on Computing
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing
Computers and Operations Research
The Traveling Salesman Problem with Draft Limits
Computers and Operations Research
A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing
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
Hi-index | 0.01 |
Despite of the practicality of the motivation of the inventory routing problem (IRP), there are few successful implementation stories of IRP based decision support systems which utilize optimization algorithms. Besides the fact that the IRP is an extremely challenging optimization problem, simplifications and assumptions made in the definition of typical IRP in the literature make it even more difficult to take advantage of the developed technologies for IRP in practice. This paper introduces a flexible modeling framework for IRP, which can accommodate various practical features. A simple algorithmic framework of an optimization based heuristic method is also proposed. A case study on a practical maritime inventory routing problem (MIRP) shows that the proposed modeling and algorithmic framework is flexible and effective enough to be a choice of model and solution method for practical inventory routing problems.