A lagrangian relaxation approach to multi-period inventory/distribution planning

Journal of the Operational Research Society

Volumn 51, Issue 3, 2000, Pages 364-370

  Kim, J U ^a   Kim, Y D ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Distribution; Heuristics; Integer programming; Inventory; Logistics; Road transport

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COSTS; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; STRATEGIC PLANNING; WAREHOUSES;

LAGRANGIAN RELAXATION; MULTIPERIOD INVENTORY/DISTRIBUTION PLANNING PROBLEMS (MPIDP);

INVENTORY CONTROL;

EID: 0033881910     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600904     Document Type: Article

References (34)

1. Buffa FP and Munn JR (1989). A recursive algorithm for order cycle-time that minimises logistics cost. J Opl Res Soc 40: 367-377.
2. Anily S and Federgruen A (1990). One warehouse multiretailer systems with vehicle routing costs. Mgmt Sci 36: 92-114.
3. Anily S and Federgruen A (1993). Two-echelon distribution systems with vehicle routing costs and central inventories. Opns Res 41: 37-47.
4. Anily S (1994). The general multi-retailer EOQ problem with vehicle routing costs. Eur J Opl Res 79: 451-473.
5. Viswanathan S and Mathur K (1997). Integrating routing and inventory decisions in one-warehouse multiretailer multipro¬duct distribution systems. Mgmt Sci 43: 294-312.
6. Herer Y and Roundy R (1997). Heuristics for one-warehouse multiretailer distribution problem with performance bounds. Opns Res 45: 102-115.
7. Burns LD et al (1985). Distribution strategies that minimise transportation and inventory costs. Opns Res 33: 469-490.
8. Federgruen A and Zipkin P (1984). A combined vehicle routing and inventory allocation problem. Opns Res 32: 1019-1037.
9. Dror M and Ball M (1987). Inventory/routing: reduction from an annual to a short-period problem. Naval Res Logist 34: 891-905.
10. Miller DM (1987). An interactive, computer-aided ship scheduling system. Eur J Opl Res 32: 363-379.
11. Chien TW, Balakrishnan A and Wong RT (1989). An integrated inventory allocation and vehicle routing problem. Transport Sci 23: 67-76.
12. Equi L et al (1997). A combined transportation and scheduling problem. Eur J Opl Res 97: 94-104.
13. Trudeau P and Dror M (1992). Stochastic inventory routing: route design with stockouts and route failures. Transport Sci 26: 171-184.
14. Speranza MG and Ukovich W (1994). Minimising transporta¬tion and inventory costs for several products on a single link. Opns Res 42: 879-894.
15. Speranza MG and Ukovich W (1996). An algorithm for optimal shipments with given frequencies. Naval Res Logist 43: 655-671.
16. Bertazzi L, Speranza MG and Ukovich W (1997). Minimisation of logistic costs with given frequencies. Transport Res B 31: 327-340.
17. Brown GG and Graves GW (1981). Real-time dispatching petroleum tank trucks. Mgmt Sci 27: 19-32.
18. Bell WJ et al (1983). Improving the distribution of industrial gases with an on-line computerised routing and scheduling optimiser. Interfaces 13: 4-23.
19. Brown JJ, Ellis CG, Graves GW and Ronen D (1987). Real¬time, wide area dispatch of mobil tank trucks. Interfaces 17: 107-120.
20. Ronen D (1992). Allocation of trips to trucks operating from a single terminal. Comput and Opns Res 19: 445-451.
21. Bausch DO, Brown GG and Ronen D (1995). Consolidating and dispatching truck shipments of Mobil heavy petroleum products. Interfaces 25: 1-17.
22. Kim J-U and Kim Y-D (1999). A decomposition approach to a multi-period vehicle scheduling problem. Omega, 27: 421-430.
23. Geoffrion AM (1974). Lagrangian relaxation for integer programming. Math Program Study 2: 82-114.
24. Fisher ML (1981). The Lagrangian relaxation method for solving integer programming problems. Mgmt Sci 27: 1-18.
25. Fisher ML (1985). An application oriented guide to Lagrangian relaxation. Interfaces 15: 10-21.
26. Christofides N and Beasley JE (1983). Extensions to a Lagran- gian relaxation approach for the capacitated warehouse location problem. Eur J Opl Res 12: 19-28.
27. Barcelo J and Casanovas J (1984). A Lagrangian algorithm for the capacitated plant location problem. Eur J Opl Res 15: 212-226.
28. Klincewicz JG and Luss H (1986). A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints. J Opl Res Soc 37: 495-500.
29. Cornuejols G, Sridharan R and Thizy JM (1991). A comparison of heuristics and relaxations for the capacitated plant location problem. Eur J Opl Res 50: 280-297.
30. Beasley JE (1993). Lagrangian heuristics for location problems. Eur J Opl Res 65: 383-399.
31. Nemhauser GL and Wolsey LA (1988). Integer and Combinatorial Optimisation. John Wiley and Sons: New York.
32. Jacobsen SK (1983). Heuristics for the capacitated plant loca¬tion model. Eur J Opl Res 12: 253-261.
33. Domschke W and Drexl A (1985). ADD-heuristic’s starting procedures for capacitated plant location models. Eur J Opl Res 21: 47-53.
34. Ronen D (1995). Dispatching petroleum products. Opns Res 43: 379-387.