Integrated Inventory-Distribution Planning in a (1 : N) Supply Chain System with Heterogeneous Vehicles Incorporated

  • Received : 2010.09.16
  • Accepted : 2011.09.06
  • Published : 2011.11.30

Abstract

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands. The problem is to determine order planning at the warehouse, and also vehicle schedules and delivery quantities for the retailers with the objective of minimizing the sum of ordering cost at the warehouse, inventory holding cost at both the warehouse and retailers, and transportation cost. For the problem, we give a Mixed Integer Programming formulation and develop a Lagrangean heuristic procedure for computing lower and upper bounds on the optimal solution value. The Lagrangean dual problem of finding the best Lagrangrean lower bound is solved by subgradient optimization. Computational experiments on randomly generated test problems showed that the suggested algorithm gives relatively good solutions in a reasonable amount of computation time.

Keywords

References

  1. Bertazzi, L., G. Paletta, and M. G. Speranza, "Deterministic order-up-to level strategies for the minimization of the logistic costs in distribution systems," In : Speranza, M. G., Stahly, P. (Eds.), New Trends in Distribution Logistics, Springer, 1999.
  2. Bertazzi, L. and M. G. Speranza, "Models and algorithms for the minimization of inventory and transportation costs: A survey," In: Speranza, M. G., Stahly, P. (Eds.), New Trends in Distribution Logistics, Springer, 1999.
  3. Bertazzi, L., M. G. Speranza, and W. Ukovich, "Exact and heuristic solutions for a shipment problem with given frequencies," Management Science 46 (2000), 973-988. https://doi.org/10.1287/mnsc.46.7.973.12032
  4. Cetinkaya, S. and C. Y. Lee, "Stock replenishment and shipment scheduling for vendor-managed inventory systems," Management Science 46 (2000), 217-232. https://doi.org/10.1287/mnsc.46.2.217.11923
  5. Fisher, M. L., "The Lagrangean relaxation method for solving integer programming problems," Management Science 27 (1981), 1-18. https://doi.org/10.1287/mnsc.27.1.1
  6. Geoffrion, A. M., "Lagrangean relaxation method for integer programming," Mathematical Programming Study 2 (1974), 82-114.
  7. Kim, J. U. and Y. D. Kim, "A decomposition approach to a multi-period vehicle scheduling problem," OMEGA‐International Journal of Management Science 27 (1999), 421-430. https://doi.org/10.1016/S0305-0483(98)00067-X
  8. Kim, J. U. and Y. D. Kim, "A Lagrangean relaxation approach to multi-period inventory/distribution planning," Journal of the Operational Research Society 51 (2000), 364-370. https://doi.org/10.1057/palgrave.jors.2600904
  9. Nemhauser, G. L. and L. A. Wolsey, "Integer and Combinatorial Optimization," John Wiley and Sons: New York.
  10. Qu, W. W., J. H. Bookbinder, and P. Iyogun, An integrated inventorytransportation system with modified periodic policy for multiple products. European Journal of Operational Research 115 (1999), 254-269. https://doi.org/10.1016/S0377-2217(98)00301-4
  11. Van Norden, L. and S. van de Velde, "Multi-product lot-sizing with a transportation capacity reservation contract," European Journal of Operational Research 165 (2005), 127-138. https://doi.org/10.1016/j.ejor.2003.04.008
  12. Vroblefski, M., R. Ramesh, and S. Zionts, "Efficient lot-sizing under a differential transportation cost structure for serially distributed ware-houses," European Journal of Operational Research 127 (2000), 574-593. https://doi.org/10.1016/S0377-2217(99)00342-2