Terminal allocation problem in a transshipment hub considering bunker consumption

Naval Research Logistics

Volumn 63, Issue 7, 2016, Pages 529-548

  Zhen, Lu ^a   Wang, Shuaian ^b   Wang, Kai ^b  

^a SHANGHAI UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

bunker consumption; port operations; shipping alliances; shipping lines; terminal allocation; transshipment

Indexed keywords

COSTS; PARTICLE SWARM OPTIMIZATION (PSO); PORT TERMINALS; SHIPS;

BUNKER CONSUMPTION; PORT OPERATIONS; SHIPPING LINES; TERMINAL ALLOCATION; TRANSSHIPMENT;

TRANSPORTATION;

EID: 85003874485     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.21717     Document Type: Article

References (31)

1. C. Bierwirth and F. Meisel, A follow-up survey of berth allocation and quay crane scheduling problems in container terminals, Eur J Oper Res 244 (2015), 675–689.
2. B.S. Boardman, E.M. Malstrom, and K. Trusty, Intermodal transporation cost analysis tables, National Technical Information Service, 1999. Avaialble at http://ntl.bts.gov/lib/15000/15600/15669/PB2000100244.pdf (accessed 15 Aug 2015).
3. B.D. Brouer, J.F. Alvarez, C.E. Plum, D. Pisinger, and M.M. Sigurd, A base integer programming model and benchmark suite for liner-shipping network design, Transp Sci 48 (2013), 281–312.
4. G. Chen, K. Govindan, and M.M. Golias, Reducing truck emissions at container terminals in a low carbon economy: Proposal of a queueing-based bi-objective model for optimizing truck arrival pattern, Transp Res Part E 55 (2013), 3–22.
5. J.F. Cordeau, M. Gaudioso, G. Laporte, and L. Moccia, The service allocation problem at the Gioia Tauro Maritime Terminal, Eur J Oper Res 176 (2007), 1167–1184.
6. J.F. Cordeau, G. Laporte, P. Legato, and L. Moccia, Models and tabu search heuristics for the berth allocation problem, Transp Sci 39 (2005), 526–538.
7. Y. Du, Q. Chen, X. Quan, L. Long, and R.Y.K. Fung, Berth allocation considering fuel consumption and vessel emissions, Transp Res Part E 47 (2011), 1021–1037.
8. Y. Du, Q. Chen, J.S.L. Lam, Y. Xu, and J.X. Cao, Modeling the impacts of tides and the virtual arrival policy in berth allocation, Transp Sci 49 (2015), 939–956.
9. K. Fagerholt, N.T. Gausel, J.G. Rakke, and H.N. Psaraftis, Maritime routing and speed optimization with emission control areas, Transp Res Part C 52 (2015), 57–73.
10. M. Fischetti and A. Lodi, Local branching, Math Program Ser B 98 (2003), 23–47.
11. J.C. Fransoo and C.-Y. Lee, The critical role of ocean container transport in global supply chain performance, Prod Oper Manage 22 (2013), 253–268.
12. G. Giallombardo, L. Moccia, M. Salani, and I. Vacca, Modeling and solving the tactical berth allocation problem, Transp Res Part B 44 (2010), 232–245.
13. Q.-M. Hu, Z.-H. Hu, and Y. Du, Berth and quay-crane allocation problem considering fuel consumption and emissions from vessels, Comput Ind Eng 70 (2014), 1–10.
14. A. Imai, H. Chen, E. Nishimura, and S. Papadimitriou, The simultaneous berth and quay crane allocation problem, Transp Res Part E 44 (2008), 900–920.
15. A. Imai, E. Nishimura, and S. Papadimitriou, The dynamic berth allocation problem for a container port, Transp Res Part B 35 (2001), 401–417.
16. K.H. Kim and K.C. Moon, Berth scheduling by simulated annealing, Transp Res Part B 37 (2003), 541–560.
17. D.-H. Lee, J.G. Jin, and J.H. Chen, Terminal and yard allocation problem for a container transshipment hub with multiple terminals, Transp Res Part E 48 (2012), 516–528.
18. P. Legato, R.M. Mazza, and D. Gullì, Integrating tactical and operational berth allocation decisions via simulation–optimization, Comput Ind Eng 78 (2014), 84–94.
19. J. Liu, Y.W. Wan, and L. Wang, Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures, Nav Res Log 53 (2006), 60–74.
20. F. Meisel and C. Bierwirth, Heuristics for the integration of crane productivity in berth allocation problem, Transp Res Part E 45 (2009), 196–209.
21. F. Meisel and C. Bierwirth, A framework for integrated berth allocation and crane operations planning in seaport container terminals, Transp Sci 47 (2013), 131–147.
22. L. Moccia, J.F. Cordeau, M. Gaudioso, and G. Laporte, A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal, Nav Res Log 53 (2006), 45–59.
23. R. Moorthy and C.P. Teo, Berth management in container terminal: The template design problem, OR Spectr 28 (2006), 495–518.
24. Y.M. Park and K.H. Kim, A scheduling method for berth and quay cranes, OR Spectr 25 (2003), 1–23.
25. J. Peng, Z. Zhou, and R. Li, A collaborative berth allocation problem with multiple ports based on genetic algorithm, J Coast Res 73 (2015), 290–297.
26. Port of Djibouti, Port tariff in USD, 2012. Available at http://www.portdedjibouti.com/paid-prices.pdf (accessed 15 Aug 2015).
27. L. Tang, J. Zhao, and J. Liu, Modeling and solution of the joint quay crane and truck scheduling problem, Eur J Oper Res 236 (2014), 978–990.
28. C.-J. Ting, K.-C. Wu, and H. Chou, Particle swarm optimization algorithm for the berth allocation problem, Expert Syst Appl 41 (2014), 1543–1550.
29. Y.W. Wan, J. Liu, and P.C. Tsai, The assignment of storage locations to containers for a container stack, Nav Res Log 56 (2009), 699–713.
30. L. Zhen, Tactical berth allocation under uncertainty, Eur J Oper Res 247 (2015), 928–944.
31. L. Zhen, E.P. Chew, and L.H. Lee, An integrated model for berth template and yard template planning in transshipment hubs, Transp Sci 45 (2011), 483–504.