Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.cie.2008.09.032 | Computers & Industrial Engineering |
Keywords | Field | DocType |
infinite supply,heuristics,inventory-routing problem,approximate solution,multiperiod inventory holding,inventory management,single item,consolidated shipping strategy,inventory routing,heuristic approach,np-hard problem,improvement heuristics,computational experiment,vehicle routing,vehicle capacity,computer experiment,np hard problem | Mathematical optimization,Economics,Vehicle routing problem,Heuristic,Inventory routing problem,Constructive,Heuristics,Approximate solution,Operations management | Journal |
Volume | Issue | ISSN |
56 | 4 | Computers & Industrial Engineering |
Citations | PageRank | References |
14 | 0.65 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tamer Abdelmaguid | 1 | 27 | 4.53 |
| Maged Dessouky | 2 | 479 | 39.53 |
| Fernando Ordóñez | 3 | 86 | 6.97 |