The vehicle routing problem
The Period Vehicle Routing Problem with Service Choice
Transportation Science
Performance Measurement for Inventory Routing
Transportation Science
A reactive GRASP and path relinking for a combined production-distribution problem
Computers and Operations Research
Routing for a Just-in-Time Supply Pickup and Delivery System
Transportation Science
The Period Vehicle Routing Problem with Service Choice
Transportation Science
An optimization algorithm for the inventory routing problem with continuous moves
Computers and Operations Research
Optimization of vendor-managed inventory systems in a rolling horizon framework
Computers and Industrial Engineering
Heuristic approaches for the inventory-routing problem with backlogging
Computers and Industrial Engineering
The integrated production---inventory---distribution---routing problem
Journal of Scheduling
Heuristics for a multiperiod inventory routing problem with production decisions
Computers and Industrial Engineering
Fuel-cache site-selection for polar research: a summary of results
Proceedings of the Second International Workshop on Computational Transportation Science
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing
Computers and Operations Research
A branch-and-price algorithm for an integrated production and inventory routing problem
Computers and Operations Research
Combining DC-programming and steepest-descent to solve the single-vehicle inventory routing problem
Computers and Industrial Engineering
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
This paper presents a comprehensive decomposition scheme for solving the inventory routing problem in which a central supplier must restock a subset of customers on an intermittent basis. In this setting, the customer demand is not known with certainty and routing decisions taken over the short run might conflict with the long-run goal of minimizing annual operating costs. A unique aspect of the short-run subproblem is the presence of satellite facilities where vehicles can be reloaded and customer deliveries continued until the closing time is reached. Three heuristics have been developed to solve the vehicle routing problem with satellite facilities (randomized Clarke-Wright, GRASP, modified sweep). After the daily tours are derived, a parametric analysis is conducted to investigate the tradeoff between distance and annual costs. This leads to the development of the efficient frontier from which the decision maker is free to choose the most attractive alternative. The proposed procedures are tested on data sets generated from field experience with a national liquid propane distributor.