An allocation and distribution model for perishable products
Operations Research
Computers and Operations Research
Operations research: an introduction, 4th ed.
Operations research: an introduction, 4th ed.
The break-bulk role of terminals in many-to-many logistic networks
Operations Research
One warehouse multiple retailer systems with vehicle routing costs
Management Science
A note on bounds for direct shipping cost
Management Science
Probabilistic Analyses and Algorithms for Three-Level Distribution Systems
Management Science
A food distribution model for famine relief
Computers and Industrial Engineering
The vehicle routing problem
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities
Transportation Science
Synchronized Development of Production, Inventory, and Distribution Schedules
Transportation Science
Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
Transportation Science
Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing
Manufacturing & Service Operations Management
The biobjective inventory routing problem: problem solution and decision support
INOC'11 Proceedings of the 5th international conference on Network optimization
Robust Inventory Routing Under Demand Uncertainty
Transportation Science
Hi-index | 0.00 |
We study an inventory-routing problem in which multiperiod inventory holding, backlogging, and vehicle routing decisions are to be taken for a set of customers who receive units of a single item from a depot with infinite supply. We consider a case in which the demand at each customer is deterministic and relatively small compared to the vehicle capacity, and the customers are located closely such that a consolidated shipping strategy is appropriate. We develop constructive and improvement heuristics to obtain an approximate solution for this NP-hard problem and demonstrate their effectiveness through computational experiments.