This paper extends the study of the inventory routing problem with slack maximization (IRPSM), which addresses the distribution of relief supplies in response to a sudden emergency. Compared with the classical routing problem, the objective of IRPSM is to maximize the slack in inventory, defined as the difference between the arrival time of new deliveries and the estimated time that the inventory will run out, rather than to minimize the total cost of delivery. Previous researchers have proposed a two-stage (scheduling and routing) solution framework, which was proved to be efficient to solve this problem. On the basis of this two-stage framework, this study developed an initial heuristic at the routing stage. With full realization of the limitations of the initial heuristic, an improved heuristic was proposed to prevent trapping of the solution at a local optimal condition. Compared with several existing solution algorithms, the results of a case study showed the effectiveness of the proposed heuristics.
Inventory Routing Problem
Routing and Scheduling Approach with the Objective of Slack Maximization
Transportation Research Record: Journal of the Transportation Research Board
Transportation Research Record: Journal of the Transportation Research Board ; 2378 , 1 ; 32-42
2013-01-01
Article (Journal)
Electronic Resource
English
The Inventory Routing Problem: A Review
TIBKAT | 2020
|Pollution-Inventory Routing Problem with Perishable Goods
Springer Verlag | 2014
|A stochastic inventory routing problem with stock-out
Online Contents | 2013
|Hybrid metaheuristic solutions to inventory location routing problem
Online Contents | 2014
|