Inventory routing with continuous moves. (English) Zbl 1159.90304
Summary: The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all be reached with out-and-back trips. Unfortunately, this is not always the reality. We introduce the inventory routing problem with continuous moves to study two important real-life complexities: limited product availabilities at facilities and customers that cannot be served using out-and-back tours. We need to design delivery tours spanning several days, covering huge geographic areas, and involving product pickups at different facilities. We develop an innovative randomized greedy algorithm, which includes linear programming based postprocessing technology, and we demonstrate its effectiveness in an extensive computational study.
References:
| [1] | Nannery, M., AAMA promotes vendor-managed inventory; manufacturers say they can replenish better than stores, Daily News Record, 24, 8 (1994) |
| [2] | Purpura, L., Vendor-run inventory: are its benefits exaggerated?, Supermarket News, 47, 59-60 (1997) |
| [3] | Ross, J., Heb project leads expansion of vendor managed inventory programs, Stores, 80, 46-47 (1998) |
| [4] | Mongelluzzo, B., Shippers let vendors manage the stock: Wal-mart’s suppliers share in databases, Journal of Commerce and Commercial, 417, 12A (1998) |
| [5] | Waller, M.; Johnson, M. E.; Davis, T., Vendor-managed inventory in the retail supply chain, Journal of Business Logistics, 20, 183-203 (1999) |
| [6] | Hannon D. Best practices: five key initiatives, Purchasing, 2005.; Hannon D. Best practices: five key initiatives, Purchasing, 2005. |
| [7] | Bell, W.; Dalberto, L.; Fisher, M.; Greenfield, A.; Jaikumar, R.; Kedia, P.; Mack, R.; Prutzman, P., Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer, Interfaces, 13, 6, 4-23 (1983) |
| [8] | Federgruen, A.; Zipkin, P., A combined vehicle routing and inventory allocation problem, Operations Research, 32, 5, 1019-1036 (1984) · Zbl 0552.90026 |
| [9] | Golden, B.; Assad, A.; Dahl, R., Analysis of a large scale vehicle routing problem with an inventory component, Large Scale Systems, 7, 2-3, 181-190 (1984) · Zbl 0551.90018 |
| [10] | Dror, M.; Ball, M.; Golden, B., A computational comparison of algorithms for the inventory routing problem, Annals of Operations Research, 4, 1-4, 3-23 (1985) |
| [11] | Dror, M.; Levy, L., Vehicle routing improvement algorithms: comparison of a ‘greedy’ and a matching implementation for inventory routing, Computers and Operations Research, 13, 1, 33-45 (1986) · Zbl 0614.90061 |
| [12] | Dror, M.; Ball, M., Inventory/routing: reduction from an annual to a short period problem, Naval Research Logistics Quarterly, 34, 6, 891-905 (1987) · Zbl 0647.90028 |
| [13] | Chien, T.; Balakrishnan, A.; Wong, R., An integrated inventory allocation and vehicle routing problem, Transportation Science, 23, 2, 67-76 (1989) · Zbl 0668.90019 |
| [14] | Trudeau, P.; Dror, M., Stochastic inventory routing: route design with stockouts and route failures, Transportation Science, 26, 3, 171-184 (1992) · Zbl 0825.90370 |
| [15] | Bassok, Y.; Ernst, R., Dynamic allocations for multi-product distribution, Transportation Science, 29, 256-266 (1995) · Zbl 0857.90029 |
| [16] | Webb, R.; Larson, R., Period and phase of customer replenishment: a new approach to the strategic inventory/routing problem, European Journal of Operational Research, 85, 1, 132-148 (1995) · Zbl 0912.90124 |
| [17] | Barnes-Schuster, D.; Bassok, Y., Direct shipping and the dynamic single-depot/multi-retailer inventory system, European Journal of Operational Research, 101, 509-518 (1997) · Zbl 0916.90083 |
| [18] | Viswanathan, S.; Mathur, K., Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems, Management Science, 43, 294-312 (1997) · Zbl 0888.90055 |
| [19] | Bard, J.; Huang, L.; Jaillet, P.; Dror, M., A decomposition approach to the inventory routing problem with satellite facilities, Transportation Science, 32, 189-203 (1998) · Zbl 0987.90502 |
| [20] | Larson, R., Transporting sludge to the 106 mile site: an inventory/ routing model for fleet sizing and logistics system design, Transportation Science, 22, 3, 186-198 (1988) |
| [21] | Chan, L. M.; Federgruen, A.; Simchi-Levi, D., Probabilistic analyses and practical algorithms for inventory-routing models, Operations Research, 46, 1, 96-106 (1998) · Zbl 0996.90007 |
| [22] | Campbell, A. M.; Clarke, L.; Kleywegt, A.; Savelsbergh, M. W.P., Inventory routing, (Crainic, T.; Laporte, G., Fleet management and logistics (1998), Kluwer Academic Publishers: Kluwer Academic Publishers Dordrecht) · Zbl 0933.00021 |
| [23] | Fumero, F.; Vercellis, C., Synchronized development of production, inventory, and distribution schedules, Transportation Science, 33, 330-340 (1999) · Zbl 1002.90001 |
| [24] | Berman, O.; Larson, R. C., Deliveries in an inventory/routing problem using stochastic dynamic programming, Transportation Science, 35, 192-213 (2001) · Zbl 1069.90500 |
| [25] | Jaillet, P.; Bard, J.; Huang, L.; Dror, M., Delivery cost approximations for inventory routing problems in a rolling horizon framework, Transportation Science, 3, 292-300 (2002) · Zbl 1134.90307 |
| [26] | Kleywegt, A.; Nori, V.; Savelsbergh, M., The stochastic inventory routing problem with direct deliveries, Transportation Science, 36, 94-118 (2002) · Zbl 1065.90508 |
| [27] | Lau, H. C.; Liu, Q.; Ono, H., Integrating local search and network flow to solve the inventory routing problem, American Association for Artificial Intelligence, 2, 9-14 (2002) |
| [28] | Adelman, D., A price-directed approach to stochastic inventory/routing, Operations Research, 52, 499-514 (2004) · Zbl 1165.90302 |
| [29] | Kleywegt, A.; Nori, V.; Savelsbergh, M., Dynamic programming approximations for a stochastic inventory routing problem, Transportation Science, 38, 42-70 (2004) |
| [30] | Gaur, V.; Fisher, M. L., A periodic inventory routing problem at a supermarket chain, Operations Research, 52, 813-822 (2004) · Zbl 1165.90315 |
| [31] | Renaud, J.; Laporte, G.; Boctor, F. F., A tabu search heuristic for the multi-depot vehicle routing problem, Computers and Operations Research, 23, 229-235 (1996) · Zbl 0855.90055 |
| [32] | Nagy, G.; Salhi, S., Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, European Journal of Operational Research, 162 (2005) · Zbl 1132.90380 |
| [33] | Taillard, E. D.; Laporte, G.; Gendreau, M., Vehicle routing with multiple use of vehicles, Journal of the Operational Research Society, 47, 1065-1070 (1996) · Zbl 0864.90045 |
| [34] | Brandao, J. C.S.; Mercer, A., Tabu search algorithm for the multi-trip vehicle routing and scheduling problem, European Journal of Operational Research, 100, 180-191 (1997) · Zbl 0947.90578 |
| [35] | Brandao, J. C.S.; Mercer, A., Multi-trip vehicle routing problem, Journal of the Operational Research Society, 49, 799-805 (1998) · Zbl 1140.90329 |
| [36] | Feo, T. A.; Resende, M. G.C., Greedy randomized adaptive search procedures, Journal of Global Optimization, 6, 109-133 (1995) · Zbl 0822.90110 |
| [37] | Pitsoulis, L. S.; Resende, M. G.C., Greedy randomized adaptive search procedures, (Pardalos, P. M.; Resende, M. G.C., Handbook of applied optimization (2002), Oxford University Press: Oxford University Press Oxford), 168-183 · Zbl 0996.90001 |
| [38] | Savelsbergh MWP, Song J-H. An optimization algorithm for the inventory routing problem with continuous moves. Naval Research Logistics 2004, submitted for publication.; Savelsbergh MWP, Song J-H. An optimization algorithm for the inventory routing problem with continuous moves. Naval Research Logistics 2004, submitted for publication. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
