Name
Title | ||
|---|---|---|
An Integrated Inventory-Routing System for Multi-item Joint Replenishment with Limited Vehicle Capacity |
Abstract | ||
|---|---|---|
In this paper, we develop a mathematical programming approach for coordinating inventory and transportation decisions in an inbound commodity collection system. In particular, we consider a system that consists of a set of geographically dispersed suppliers that manufacture one or more non-identical items, and a central warehouse that stocks these items. The warehouse faces a constant and deterministic demand for the items from outside retailers. The items are collected by a fleet of vehicles that are dispatched from the central warehouse. The vehicles are capacitated, and must also satisfy a frequency constraint. Adopting a policy in which each vehicle always collects the same set of items, we formulate the inventory-routing problem of minimizing the long-run average inventory and transportation costs as a set partitioning problem. We employ a column generation approach to determine a lower bound on the total costs, and develop a branch-and-price algorithm that finds the optimal assignment of items to vehicles. We also propose greedy constructive heuristics, and develop a very large-scale neighborhood (VLSN) search algorithm to find near-optimal solutions for the problem. Computational tests are performed on a set of randomly generated problem instances. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10898-004-5908-0 | J. Global Optimization |
Keywords | Field | DocType |
long-run average inventory,central warehouse,inventory-routing problem,mathematical programming approach,integrated inventory-routing system,very large-scale neighborhood search,column generation approach,search algorithm,partitioning problem,transportation,inventory-routing,branch-and-price algorithm,column generation,limited vehicle capacity,problem instance,multi-item joint replenishment,eco- nomic order quantity,multi-item inventory replenishment,inbound commodity collection system,mathematical programming,branch and price,satisfiability,lower bound,economic order quantity | Very large-scale neighborhood search,Mathematical optimization,Column generation,Search algorithm,Upper and lower bounds,Commodity,Economic order quantity,Constructive heuristic,Total cost,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 1 | 0925-5001 |
Citations | PageRank | References |
24 | 1.43 | 17 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sombat Sindhuchao | 1 | 24 | 1.43 |
| H. Edwin Romeijn | 2 | 769 | 83.88 |
| Elif Akçali | 3 | 56 | 4.46 |
| Rein Boondiskulchok | 4 | 24 | 1.43 |