Advertisement

Maritime Economics & Logistics

, Volume 13, Issue 1, pp 61–77 | Cite as

Flow balancing-based empty container repositioning in typical shipping service routes

  • Dong-ping SongEmail author
  • Jing-xin DongEmail author
Original Article

Abstract

This article formulates the empty container repositioning problem for general shipping service routes based on container flow balancing. Two types of flow balancing mechanisms are analysed. The first is based on point-to-point balancing, which leads to a point-to-point repositioning policy. The second is based on coordinated balancing in the whole service, which leads to a coordinated repositioning policy. A simple heuristic algorithm is presented to solve the coordinated balancing problem which aims to minimize total empty container repositioning costs. The above two repositioning policies are then applied to a range of shipping services, representing typical route structures in existing shipping networks. The relative performances of these two policies and their sensitivity to route structure and trade demand are examined in both deterministic and stochastic situations. Managerial insights are subsequently derived.

Keywords

container shipping empty container repositioning flow balancing liner shipping route structure 

Notes

Acknowledgements

This work is supported by the Engineering and Physical Sciences Research Council (EPSRC) (grant number EP/E000398/1).

References

  1. Bourbeau, B., Crainic, T.G. and Gendron, B. (2000) Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. Parallel Computing 26: 27–46.CrossRefGoogle Scholar
  2. Cheang, B. and Lim, A. (2005) A network flow based method for the distribution of empty containers. International Journal of Computer Applications in Technology 22 (4): 198–204.CrossRefGoogle Scholar
  3. 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 (2): 142–162.CrossRefGoogle Scholar
  4. Choong, S.T., Cole, M.H. and Kutanoglu, E. (2002) Empty container management for intermodal transportation networks. Transportation Research Part E 38 (6): 423–438.CrossRefGoogle Scholar
  5. Crainic, T.G., Gendreau, M. and Dejax, P. (1993a) Dynamic and stochastic-models for the allocation of empty containers. Operations Research 41 (1): 102–126.CrossRefGoogle Scholar
  6. Crainic, T.G., Gendreau, M., Soriano, P. and Toulouse, M. (1993b) A tabu search procedure for multicommodity location-allocation with balancing requirements. Annals of Operations Research 41: 359–384.CrossRefGoogle Scholar
  7. Dong, J.X. and Song, D.P. (2009) Container fleet sizing and empty repositioning in liner shipping systems. Transport Research Part E 45 (6): 860–877.CrossRefGoogle Scholar
  8. Drewry. (2006) Annual Container Market Review & Forecast 2006/07. London: Drewry Shipping Consultants Ltd.Google Scholar
  9. Erera, A.L., Morales, J.C. and Savelsbergh, M. (2005) Global intermodal tank container management for the chemical industry. Transportation Research Part E 41 (6): 551–566.CrossRefGoogle Scholar
  10. Feng, C.M. and Chang, C.H. (2008) Empty container reposition planning for intra-Asia liner shipping. Maritime Policy & Management 35 (5): 469–490.CrossRefGoogle Scholar
  11. Imai, A. and Rivera, F. (2001) Strategic fleet size planning for maritime refrigerated containers. Maritime Policy and Management 28 (4): 361–374.CrossRefGoogle Scholar
  12. Kim, H.J., Chang, Y.T., Lee, P.T.W., Shin, S.H. and Kim, M.J. (2008) Optimizing the transportation of international container cargoes. Maritime Policy & Management 35 (1): 103–122.CrossRefGoogle Scholar
  13. Lai, K.K., Lam, K. and Chan, W.K. (1995) Shipping container logistics and allocation. Journal of the Operational Research Society 46: 687–697.CrossRefGoogle Scholar
  14. 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.CrossRefGoogle Scholar
  15. Li, J.A., Leung, S.C.H., Wu, Y. and Liu, K. (2007) Allocation of empty containers between multi-ports. European Journal of Operational Research 182: 400–412.CrossRefGoogle Scholar
  16. 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 Modelling 40 (1–2): 85–100.CrossRefGoogle Scholar
  17. Olivo, A., Zuddas, P., Francesco, M.D. and Manca, A. (2005) An operational model for empty container management. Maritime Economics & Logistics 7: 199–222.CrossRefGoogle Scholar
  18. Shen, W.S. and Khoong, C.M. (1995) A DSS for empty container distribution planning. Decision Support System 15 (1): 75–82.CrossRefGoogle Scholar
  19. Song, D.P. (2007) Characterizing optimal empty container reposition policy in periodic-review shuttle service systems. Journal of the Operational Research Society 58 (1): 122–133.CrossRefGoogle Scholar
  20. Song, D.P. and Carter, J. (2009) Empty container repositioning in shipping industry. Maritime Policy & Management 36 (4): 291–307.CrossRefGoogle Scholar
  21. Song, D.P. and Dong, J.X. (2008) Empty container management in cyclic shipping routes. Maritime Economics & Logistics 10: 335–361.CrossRefGoogle Scholar
  22. Song, D.P. et al (2005) On cost-efficiency of the global container shipping network. Maritime Policy & Management 32: 15–30.CrossRefGoogle Scholar
  23. White, W.W. (1972) Dynamic transhipment network: An algorithm and its application to the distribution of empty containers. Networks 2: 211–236.CrossRefGoogle Scholar

Copyright information

© Palgrave Macmillan, a division of Macmillan Publishers Ltd 2011

Authors and Affiliations

  1. 1.International Shipping & Logistics Group, Business School, University of Plymouth, Cookworthy Building, Drake CircusPlymouthUK

Personalised recommendations