Marine container terminal configurations for efficient handling of mega-containerships

Transportation Research Part E: Logistics and Transportation Review

Volumn 49, Issue 1, 2013, Pages 141-158

  Imai, Akio ^a   Nishimura, Etsuko ^a   Papadimitriou, Stratos ^b  

^a KOBE UNIVERSITY   (Japan)

^b UNIVERSITY OF PIRAEUS   (Greece)

Author keywords

Berth allocation problem; Genetic algorithm; Mathematical programming; Mega containership

Indexed keywords

GENETIC ALGORITHMS; PORT TERMINALS; RAILROAD YARDS AND TERMINALS; SHIPS; TRANSFER CASES (VEHICLES);

BERTH ALLOCATION; BERTH ALLOCATION PROBLEM; CONTAINER SHIPS; DESIGN ALTERNATIVES; HIGH UTILIZATIONS; INNOVATIVE DESIGN; KEY ISSUES; MARINE CONTAINER TERMINALS; MEGA-CONTAINERSHIP; SHIP HANDLING;

MATHEMATICAL PROGRAMMING;

CARGO HANDLING; CONTAINER TERMINAL; GENETIC ALGORITHM; HEURISTICS; LOCATION-ALLOCATION MODEL; NUMERICAL MODEL; SHIPPING; CONTAINER SHIP; SHIP HANDLING; SOFTWARE;

EID: 84865526148     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2012.07.006     Document Type: Article

References (23)

1. Ahuja, R.K., Orlin, J.B., Tiwari, A., 2000. A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research 27, 917-934.
2. Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., Lusby, R., 2011. Models for the discrete berth allocation problem: a computational comparison. Transportation Research Part E 47, 461-473.
3. Cheong, C.Y., Tan, K.C., Liu, D.K., Lin, C.J., 2010. Multi-objective and prioritized berth allocation in container ports. Annals of Operations Research 180, 63-103.
4. Cordeau, J.-F., Laporte, G., Legato, P., Moccia, L., 2005. Models and tabu search heuristics for the berth-allocation problem. Transportation Science 39, 526-538.
5. Goldberg, D.E., Lingle, R., 1985. Alleles, loci, and the traveling salesman problem. Proceedings of the First International Conference on Genetic Algorithms, pp. 154-159.
6. Golias, M.M., Boile, M., Theofanis, S., 2009. Berth scheduling by customer service differentiation: a multi-objective approach. Transportation Research Part E 45, 878-892.
7. Golias, M.M., Boile, M., Theofanis, S., 2010. A lamda-optimal based heuristic for the berth scheduling problem. Transportation Research Part C 18, 794-806.
8. Guan, Y., Xiao, W.-Q., Chueng, R.K., Li, C.-L., 2002. A multiprocessor task scheduling model for berth allocation: heuristic and worst case analysis. Operations Research Letters 30, 343-350.
9. Imai, A., Nagaiwa, K., Chan, W.T., 1997. Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 31, 75-94.
10. Imai, A., Nishimura, E., Papadimitriou, S., 2001. The dynamic berth allocation problem for a container port. Transportation Research Part B 35, 401-417.
11. Imai, A., Nishimura, E., Papadimitriou, S., 2003. Berth allocation with service priority. Transportation Research Part B 37, 437-457.
12. Imai, A., Nishimura, E., Papadimitriou, S., 2005a. Corrigendum to "The dynamic berth allocation problem for a container port"[Transportation Research Part B 35 (2001) 401-417]. Transportation Research Part B 39, 197.
13. Imai, A., Nishimura, E., Papadimitriou, S., 2005b. Berth allocation in a container port: using a continuous location space approach. Transportation Research Part B 39, 199-221.
14. Imai, A., Nishimura, E., Papadimitriou, S., 2006. Effect of terminal layouts on the performance of marine terminals for mega-containerships. The Proceedings of the 12th IAIN, available on CD-ROM.
15. Imai, A., Nishimura, E., Hattori, M., Papadimitriou, S., 2007. Berth allocation at indented berths for mega-containerships. European Journal of Operational Research 179, 579-593.
16. Kim, K.H., Moon, K.C., 2003. Berth scheduling by simulated annealing. Transportation Research Part B 37, 541-560.
17. Lee, Y., Chen, C.-Y., 2009. An optimization heuristic for the berth scheduling problem. European Journal of Operational Research 196, 500-508.
18. Lee, D.-H., Chen, J.H., Cao, J.X., 2010. The continuous berth allocation problem: a greedy randomized adaptive search solution. Transportation Research Part E 46, 1017-1029.
19. Li, C.-L., Cai, X., Lee, C.-Y., 1998. Scheduling with multiple-job-on-one-processor pattern. IIE Transactions 30, 433-445.
20. Lim, A., 1998. The berth planning problem. Operations Research Letters 22, 105-110.
21. Monaco, M.F., Sammarra, M., 2007. The berth allocation problem: a strong formulation solved by a Lagrangean approach. Transportation Science 41, 265-280.
22. Nishimura, E., Imai, A., Papadimitriou, S., 2001. Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research 131, 282-292.
23. Park, K.T., Kim, K.H., 2002. Berth scheduling for container terminals by using a sub-gradient optimization technique. Journal of the Operational Research Society 53, 1054-1062.