×

A partition approach to the inventory/routing problem. (English) Zbl 1102.90005

Summary: We focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment of a single item to the retailers with demands occurring at a specific constant (but retailer-dependent) rate, combining deliveries into efficient routes. This research proposes a fixed partition policy for this type of problem, in which the replenishment interval of each of the retailers’ partition region as well as the warehouse is accorded the power of two (POT) principle. A lower bound of the long-run average cost of any feasible strategy for the considered distribution system is drawn. And a tabu search algorithm is designed to find the retailers’ optimal partition regions under the fixed partition policy proposed. Computational results reveal the effectiveness of the policy as well as of the algorithm.

MSC:

90B05 Inventory, storage, reservoirs
90B35 Deterministic scheduling theory in operations research
90B40 Search theory
Full Text: DOI

References:

[1] Achabal, D. D.; Mcintyre, S. H.; Smith, S. A.; Kalyanam, K., A decision support system for vendor managed inventory, Journal of Retailing, 76, 4, 430-454 (2000)
[2] Andel, T., Manage inventory, own information, Transportation and Distribution, 37, 5, 54-58 (1996)
[3] Angulo, A.; Nachtmann, H.; Waller, M. A., Supply chain information sharing in a vendor managed inventory partnership, Journal of Business Logistics, 25, 101-125 (2004)
[4] Anily, S.; Bramel, J., An asymptotic 98.5 · Zbl 1058.90009
[5] Anily, S.; Federgruen, A., One warehouse multiple retailers systems with vehicle routing costs, Management Science, 36, 92-114 (1990) · Zbl 0694.90044
[6] Anily, S.; Federgruen, A., A class of Euclidean routing problems with general route cost functions, Mathematics of Operations Research, 15, 269-285 (1990) · Zbl 0721.90045
[7] Anily, S.; Federgruen, A., Two-echelon distribution systems with vehicle routing costs and central inventories, Operations Research, 41, 37-47 (1993) · Zbl 0771.90032
[8] Anupindi, R.; Akella, R., Diversification under supply uncertainty, Management Sciences, 39, 8, 944-963 (1993) · Zbl 0785.90040
[9] Aviv, Y., Federguen, A., 1998. The operational benefits of information sharing and vendor managed inventory programs. Technical Report, Columbia University, New York.; Aviv, Y., Federguen, A., 1998. The operational benefits of information sharing and vendor managed inventory programs. Technical Report, Columbia University, New York.
[10] Bramel, J.; Simichi-Levi, D., A location based heuristic for general routing problems, Operations Research, 43, 649-660 (1995) · Zbl 0857.90030
[11] Cetinkaya, S.; Lee, C. Y., Stock replenishment and shipment scheduling for vendor-managed inventory systems, Management Science, 46, 2, 217-232 (2000) · Zbl 1231.90016
[12] Chan, L. M.A.; Simchi-Levi, D., Probabilistic analyses and algorithms for three-level distribution systems, Management Science, 44, 1562-1576 (1998) · Zbl 0989.90528
[13] Chan, L. M.A.; Federgruen, A.; Simchi-Levi, D., Probabilistic analyses and practical algorithms for inventory-routing models, Operations Research, 46, 1, 96-106 (1998) · Zbl 0996.90007
[14] Cheung, K. L.; Lee, H. L., The inventory benefit of shipment coordination and stock rebalancing in a supply chain, Management Science, 48, 2, 300-306 (2002) · Zbl 1232.90035
[15] Christofides, N.; Eilon, S., An algorithm for the vehicle dispatching problem, Operational Research Quarterly, 20, 309-318 (1969)
[16] Dong, Y.; Xu, K., A supply chain model of vendor managed inventory, Transportation Research, Part E, 38, 75-95 (2002)
[17] Dror, M.; Ball, M. O., Inventory/routing: Reduction from an annual to a short-period problem, Naval Research of Logistics Quarterly, 34, 891-908 (1987) · Zbl 0647.90028
[18] Dror, M.; Levy, L., A vehicle routing improvement algorithm comparison of a “greedy” and a matching implementation for inventory routing, Computation and Operations Research, 13, 33-45 (1986) · Zbl 0614.90061
[19] Federgruen, A.; Zipkin, P., A combined vehicle routing and inventory allocation problem, Operation Research, 32, 297-373 (1984)
[20] Fumero, F.; Vercellis, C., Synchronized development of production, inventory and distribution schedules, Transportation Science, 33, 330-350 (1999) · Zbl 1002.90001
[21] Gendreau, M.; Hertz, A.; Laporte, G., New insertion and post-optimization procedures for the traveling salesman problem, Operations Research, 40, 6, 1086-1094 (1992) · Zbl 0767.90087
[22] Kohli, R.; Park, H., Coordinating buyer-seller transactions across multiple products, Management Science, 40, 9, 45-50 (1994) · Zbl 0818.90033
[23] Lee, H.; Rosenblatt, M. J., A general quantity discount pricing model to increase supplier profits, Management Science, 32, 9, 1177-1185 (1986) · Zbl 0605.90022
[24] Parker, K., Demand management and beyond, Manufacturing Systems, 6, 2A-14A (1996)
[25] Roundy, R., 98 · Zbl 0593.90020
[26] Schenck, J.; McInerney, J., Applying vendor-management inventory to the apparel industry, Automation, I.D. News, 14, 6, 36-38 (1998)
[27] Thomas, D. J.; Griffin, P. M., Coordinated supply chain management, European Journal of Operational Research, 94, 1-15 (1996) · Zbl 0929.90004
[28] Viswanathan, S.; Mathur, K., Integrating routing and inventory decisions in one-warehouse multi-retailer multi-product distribution systems, Management Science, 43, 294-312 (1997) · Zbl 0888.90055
[29] Weng, Z. K., Channel coordination and quantity discount, Management Science, 41, 9, 1509-1522 (1995) · Zbl 0861.90067
[30] Yang, K. K.; Ruben, R. A.; Webster, C., Managing vendor inventory in a dual level distribution system, Journal of Business Logistics, 24, 91-108 (2003)
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.