Browse > Article
http://dx.doi.org/10.7232/IEIF.2011.24.2.164

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)
Publication Information
IE interfaces / v.24, no.2, 2011 , pp. 164-172 More about this Journal
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
container transportation; empty container; optimization;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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.   DOI   ScienceOn
2 Shen, W. S. and Khoong, C. M. (1995), A DSS for empty container distribution planning, Decision Support Systems, 15, 75-82.   DOI   ScienceOn
3 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.   DOI   ScienceOn
4 Wolsey, L. A. (1998), Integer Programming, Wiley-Interscience, New York.
5 Lai, K. K., Lam, K., and Chan, W. K. (1995), Shipping container logistics and allocation, Journal of the Operational Research Society, 46, 687-697.   DOI
6 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.   DOI   ScienceOn
7 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.   DOI   ScienceOn
8 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.   DOI   ScienceOn
9 Crainic, T. G., Gendreau, M., and Dejax, P. (1993), Dynamic and stochastic models for the allocation of empty containers, Operations Research, 41, 102-126.   DOI   ScienceOn
10 Choong, S. T. and Cole, M. H. (2002), Kutanoglu E, Empty container management for intermodal transport networks, Transportation Research Part E, 38, 423-438.   DOI   ScienceOn
11 Gao, Q. (1994), An operational approach for container control in linear shipping, Logistics and Transportation Review, 30, 267-282.
12 Jula, H., Chassiakos, A., and Ioannou, P. (2006), Port dynamic empty container reuse. Transportation Research Part E, 42, 43-60.   DOI   ScienceOn
13 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.   DOI   ScienceOn
14 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.   DOI   ScienceOn