An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity

Journal of Global Optimization

Volumn 32, Issue 1, 2005, Pages 93-118

  Sindhuchao, Sombat ^a   Romeijn, H Edwin ^b   Akçali, Elif ^b   Boondiskulchok, Rein ^a  

^a CHULALONGKORN UNIVERSITY   (Thailand)

^b J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

Column generation; Economic order quantity; Inventory routing; Multi item inventory replenishment; Transportation; Very large scale neighborhood search

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; DECISION THEORY; HEURISTIC METHODS; INVENTORY CONTROL; LOGISTICS; MATHEMATICAL PROGRAMMING; OPTIMAL SYSTEMS; PROBLEM SOLVING; TRANSPORTATION;

COLUMN GENERATION; ECONOMIC ORDER QUANTITY; INVENTORY-ROUTING; MULTI-ITEM INVENTORY REPLENISHMENT; VERY LARGE-SCALE NEIGHBORHOOD SEARCH;

TRANSPORTATION ROUTES;

EID: 21844457118     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10898-004-5908-0     Document Type: Article

References (46)

1. Adelman, D. (2003), Price-directed replenishment of subsets: methodology and its application to inventory routing, Manufacturing and Service Operations Management 5, 348-371.
2. Ahuja, R.K., Boland, N. and Dumitrescu, I. (2001), Exact and heuristic algorithms for the subset disjoint minimum cost cycle problem. Working paper, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida.
3. Ahuja, R.K., Ergun, O., Orlin, J.B. and Punnen, A. (2002), A survey of very large scale neighborhood search techniques, Discrete Applied Mathematics 123, 75-102.
4. Ahuja, R.K., Huang, W., Romeijn, H.E. and Romero Morales, D. (2002), A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints. Research Report 2002-2, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida.
5. Ahuja, R.K., Orlin, J.B. and Sharma, D. (2001), A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem, Operations Research Letters 31, 185-194.
6. Ahuja, R.K., Orlin, J.B. and Sharma, D. (2001), Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem, Mathematical Programming 91(1), 71-97.
7. Ahuja, R.K., Orlin, J.B. and Sharma, D. (2000), Very large scale neighborhood search, International Transactions in Operations Research 7, 301-317.
8. Anily, S. and Federgruen, A. (1990), One warehouse multiple retailer systems with vehicle routing costs, Management Science 36(1), 92-114.
9. Anily, S. and Federgruen, A. (1993), Two-echelon distribution systems with vehicle routing costs and central inventories, Operations Research 41(1), 37-47.
10. Anily, S. (1994), The general multi-retailer EOQ problem with vehicle routing costs, European Journal of Operational Research 79, 451-473.
11. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P. and Vance, P. (1998), Branch-and-Price: column generation for solving huge integer programs. Operations Research 46(3), 316-329.
12. Ben-Khedher, N. and Yano, C.A. (1994), The multi-item joint replenishment problem with transportation and container effects, Transportation Science 28(1), 37-54.
13. Bertazzi, L. and Speranza, M.G. (1999), Minimizing logistic costs in multistage supply chains, Naval Research Logistics 46, 399-417.
14. Bramel, J. and Simchi-Levi, D. (1997), The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management. Springer-Verlag, New York.
15. Buffa, F.P. and Munn, J.R. (1990), Multi-item grouping algorithm yielding near-optimal logistics cost, Decision Sciences 21(1), 14-34.
16. Burns, L.D., Hall, R.W., Blumenfeld, D.E. and Daganzo, C.F. (1985), Distribution strategies that minimize transportation and inventory costs, Operations Research 33(3), 469-490.
17. Çetinkaya, S. and Lee, C.-Y. (2000), Stock replenishment and shipment scheduling for vendor managed inventory systems, Management Science 46(2), 217-232.
18. Chan, L.M.A., Federgruen, A. and Simchi-Levi, D. (1998), Probabilistic analyses and practical algorithms for inventory-routing models, Operations Research 46(1), 96-106.
19. Chan, L.M.A. and Simchi-Levi, D. (1998), Probabilistic analyses and algorithms for three-level distribution systems, Management Science 44(11), 1562-1576.
20. Chaovalitwongse, P., Romeijn, H.E. and Pardalos, P.M. (2002), A scenario-based heuristic for a capacitated transportation-inventory problem with stochastic demands. In: Kontoghiorghes, E., B. Rustem and S. Siokos (eds.), Computational Methods in Decision-Making, Economics and Finance. Kluwer Academic Publishers, Dordrecht, The Netherlands.
21. Chien, T.W., Balakrishnan, A. and Wong, R.T. (1989), An integrated inventory allocation and vehicle routing problem, Transportation Science 23(2), 67-76.
22. Croes, G.A. (1958), A method for solving traveling-salesman problems, Operations Research 6, 791-812.
23. Dror, M., Ball, M. and Golden, B. (1985/1986), A computational comparison of algorithms for the inventory routing problem, Annals of Operations Research 4, 3-23.
24. Dror, M. and Ball, M. (1987), Inventory/routing: reduction from an annual to a shortperiod problem, Naval Research Logistics 34, 891-905.
25. Fahrion, R. and Wrede, M. (1990), On a principle of chain exchange for vehicle routing problems (I-VRP), Journal of the Operational Research Society 41, 821-827.
26. Federgruen, A. and Zipkin, P. (1984), A combined vehicle routing and inventory allocation problem, Operations Research 32(5), 1019-1037.
27. Frangioni, A., Necciari, E. and Scutella, M.G. (2000), Multi-exchange algorithms for the minimum makespan machine scheduling problem. Technical report, Dipartimento di Informatica, University of Pisa, Pisa, Italy.
28. Freling, R., Romeijn, H.E., Morales, D. and Wagelmans, A.P.M. (2003), A branch-and-price algorithm for the multi-period single-sourcing problem, Operations Research 51, 922-939.
29. Gallego, G. and Simchi-Levi, D. (1990), On the effectiveness of direct shipping strategy forthe one-warehouse multi-retailer R-systems, Management Science 36(2), 240-243.
30. Gendreau, M., Guertin, F., Potvin, J.-Y. and Seguin, R. (1998), Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. CRT Research Report No. CRT-98-10, Centre for Research on Transportation, University of Montréal, Montréal, Canada.
31. Huang, W., Romeijn, H.E. and Geunes, J. (2004), The continuous-time single-sourcing problem with capacity expansion opportunities. Technical Report, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida.
32. Lin, S. (1965), Computer solutions of the traveling salesman problem, Bell Systems Technical Journal 44, 2245-2269.
33. Lin, S. and Kernighan, B.W. (1973), An efficient heuristic algorithm for the traveling-salesman problem, Operations Research 21, 498-516.
34. Martello, S. and Toth, P. (1990), Knapsack Problems, Algorithms and Computer Implementations. John Wiley & Sons, New York.
35. Qu, W.W., Bookbinder, J.H. and Iyogun, P. (1999), An integrated inventory-transportation system with modified periodic policy for multiple products, European Journal of Operational Research 115, 254-269.
36. Rosenkrantz, D.J., Stearns, R.E. and Lewis, P.M. (1977), An analysis of several heuristics of traveling salesman problem, SIAM Journal of Computing 6, 563-581.
37. Savelsbergh, M.W.P. (1997), A branch-and-price algorithm for the generalized assignment problem. Operations Research 6, 831-841.
38. Shen, Z.J., Coullard, C. and Daskin, M.S. (2003), A joint location-inventory model, Transportation Science 37(1), 40-55.
39. Silver, E.A., Pyke, D.F. and Peterson, R. (1998), Inventory Management and Production Planning and Scheduling. John Wiley & Sons, New York.
40. Thompson, P.M. (1988), Local Search Algorithms for Vehicle Routing and Other Combinatorial Problems. Ph.D. Thesis, Operations Research Center, MIT, Cambridge, Massachusetts.
41. Thompson, P.M. and Orlin, J.B. (1989), The Theory of Cyclic Transfers. Working Paper No. OR 200-89, MIT, Cambridge, Massachusetts.
42. Thompson, P.M. and Psaraftis, H.N. (1993), Cyclic transfer algorithms for multi-vehicle routing and scheduling problems, Operations Research 41, 935-946.
43. Toptal, A., Çetinkaya, S. and Lee, C.-Y. (2003), The buyer-vendor coordination problem: modeling inbound and outbound cargo capacity and costs, IIE Transactions on Logistics and Scheduling 35(11), 987-1002.
44. Toth, P. and Vigo, D. (2002), The Vehicle Routing Problem, Society for Industrial and Applied Mathemtics, Philadelphia, USA.
45. Viswanathan, S. and Mathur, K. (1997), Integrating routing and inventory decisions in one-warehouse multi-retailer multi-product distribution systems, Management Science 43(3), 294-312.
46. Yano, C. and Gerchak, Y. (1989), Transportation contracts and safety stocks for just-in-time deliveries, Manufacturing and Service Operations Management 2, 314-330.