DOI QR코드

DOI QR Code

Optimizing Empty Container Repositioning at a Global Maritime Company

글로벌 해운회사의 공컨테이너 재배치 최적화

  • Choi, Seong-Hoon (Department of Management Engineering, Sangmyung University) ;
  • Kim, Hwa-Joong (Graduate School of Logistics, Inha University) ;
  • Kim, Gwang-Tae (Transport and Logistics Research Division, Korea Railroad Research Institute)
  • 최성훈 (상명대학교 경영공학과) ;
  • 김화중 (인하대학교 물류전문대학원) ;
  • 김광태 (한국철도기술연구원 교통물류연구실)
  • Received : 2010.11.07
  • Accepted : 2011.03.01
  • Published : 2011.06.01

Abstract

H maritime company in Korea had a long history of difficulty in obtaining enough empty containers to transport its commodities. Despite efforts to resolve the problem, the repositioning of empty containers between depots was still planned manually, which consumed much worker time. To automate the generation of reposition plans, we developed a planning system to optimize the company's reposition of empty containers between global depots with a linear programming model functioning as a key decision engine in the system. The model determines the route, volume and mode of transportation for repositioning empty containers from depots with surplus containers to those requiring containers, as well as the empty space of ships generated from the unloading or loading of full and empty containers. The system has been in operation in the company's global network since March 2008.

Keywords

References

  1. Chang, H., Jula, H., Chassiakos, A., and Ioannou, P. (2008), A heuristic solution for the empty container substitution problem, Transportation Research Part E, 44, 203-216. https://doi.org/10.1016/j.tre.2007.07.001
  2. Cheung, R. K. and Chen, C. Y. (1998), A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem, Transportation Science, 32, 142-162. https://doi.org/10.1287/trsc.32.2.142
  3. Choong, S. T. and Cole, M. H. (2002), Kutanoglu E, Empty container management for intermodal transport networks, Transportation Research Part E, 38, 423-438. https://doi.org/10.1016/S1366-5545(02)00018-2
  4. Crainic, T. G., Gendreau, M., and Dejax, P. (1993), Dynamic and stochastic models for the allocation of empty containers, Operations Research, 41, 102-126. https://doi.org/10.1287/opre.41.1.102
  5. Gao, Q. (1994), An operational approach for container control in linear shipping, Logistics and Transportation Review, 30, 267-282.
  6. Jula, H., Chassiakos, A., and Ioannou, P. (2006), Port dynamic empty container reuse. Transportation Research Part E, 42, 43-60. https://doi.org/10.1016/j.tre.2004.08.007
  7. Lai, K. K., Lam, K., and Chan, W. K. (1995), Shipping container logistics and allocation, Journal of the Operational Research Society, 46, 687-697. https://doi.org/10.1057/jors.1995.98
  8. Lam, S. W., Lee, L. H., and Tang, L. C. (2007), An approximate dynamic programming approach for the empty container allocation problem. Transportation Research Part C, 15, 265-277. https://doi.org/10.1016/j.trc.2007.04.005
  9. Li, J.-A., Leung, S. C. H., Wu, Y., and Liu, K. (2007), Allocation of empty container between multi-ports, European Journal of Operational Research, 182, 400-412. https://doi.org/10.1016/j.ejor.2006.09.003
  10. Li, J.-A., Liu, K., Leung, S. C. H., and Lai, K. K. (2004), Empty container management in a port with long-run average criterion, Mathematical and Computer Modeling, 40, 85-100. https://doi.org/10.1016/j.mcm.2003.12.005
  11. Olivo, A., Zuddas, P., and Francesco, M. D. (2005), Manca A, An operational model for empty container management, Maritime Economics and Logistics, 7, 199-222. https://doi.org/10.1057/palgrave.mel.9100136
  12. Shen, W. S. and Khoong, C. M. (1995), A DSS for empty container distribution planning, Decision Support Systems, 15, 75-82. https://doi.org/10.1016/0167-9236(94)00037-S
  13. Shintani, K., Imai, A., Nishmura, E., and Papadimitriou, S. (2007), The container shipping network with empty container repositioning, Transportation Research Part E, 43, 39-59. https://doi.org/10.1016/j.tre.2005.05.003
  14. Wolsey, L. A. (1998), Integer Programming, Wiley-Interscience, New York.