The berth allocation problem: Optimizing vessel arrival time

Maritime Economics and Logistics

Volumn 11, Issue 4, 2009, Pages 358-377

  Golias, Mihalis M ^a   Saharidis, Georgios K ^b   Boile, Maria ^b   Theofanis, Sotirios ^b   Ierapetritou, Marianthi G ^b  

^a UNIVERSITY OF MEMPHIS   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Berth scheduling; Container terminals; Emissions; Optimization; Planning and scheduling; Resource allocation

Indexed keywords

EID: 70450230571     PISSN: 14792931     EISSN: 1479294X     Source Type: Journal    
DOI: 10.1057/mel.2009.12     Document Type: Article

References (21)

1. Fossey, J. (2008) In the bunker. CI-Online, http://www.ci-online.co.uk/, accessed 19 September 2008.
2. Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimization, and Machine-Learning. Reading, MA: Addison-Wesley.
3. Golias, M. (2007) The discrete and dynamic berth allocation problem: Models and algorithms. PhD Dissertation, Rutgers University, NJ.
4. Guan, Y. and Cheung, R.K. (2004) The berth allocation problem: Models and solution methods. OR Spectrum 26: 75-92.
5. Hansen, P., Oguz, C. and Mladenovic, N. (2008) Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research 131: 636-649.
6. Hooker, N.J. (1998) Constraint satisfaction methods for generating valid cuts, *http://Citeseer.Ist .Psu.Edu/163317.html, accessed 19 September 2008.
7. Imai, A., Chen, H.C., Nishimura, E. and Papadimitriou, S. (2008) The simultaneous berth and quay crane allocation problem. Transportation Research Part E 44(5): 900-920.
8. Imai, A., Nagaiwa, K. and Tat, C.-W. (1997) Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 31: 75-94.
9. Imai, A., Nishimura, E. and Papadimitriou, S. (2001) The dynamic berth allocation problem for a container port. Transportation Research Part B 35: 401-417.
10. Imai, A., Nishimura, E. and Papadimitriou, S. (2003) Berth allocation with service priority. Transportation Research Part B 37: 437-457.
11. Imai, A., Sun, X., Nishimura, E. and Papadimitriou, S. (2005) Berth allocation in a container port: Using continuous location space approach. Transportation Research Part B 39: 199-221.
12. Imai, A., Zhang, J.-T., Nishimura, E. and Papadimitriou, S. (2007) The berth allocation problem with service time and delay time objectives. Maritime Economics & Logistics 9(4): 269-290.
13. Kim, K.H. and Moon, K.C. (2003) Berth scheduling by simulated annealing. Transportation Research Part B 37: 541-560.
14. Lazic, B.M. (2004) Container terminal operation emissions. West Coast Region Conference on Marine Port Air Quality Impacts. Seattle Tacoma.
15. Moorthy, R. and Teo, C.-P. (2006) Berth management in container terminal: The template design problem. OR Spectrum 28: 495-518.
16. Park, M.Y. and Kim, H.K.A. (2003) A scheduling method for berth and quay cranes. OR Spectrum 25: 1-23.
17. Pinedo, M. (2008) Scheduling: Theory, Algorithms, and Systems. Englewood Cliffs, NJ: Prentice Hall.
18. Steenken, D., Voss, S. and Stahlbock, R. (2004) Container terminal operation and operations research - A classification and literature review. OR Spectrum 26: 3-49.
19. Taboada, H. (2007) Multi-objective optimization algorithms considering objective preferences and solution clusters. PhD Dissertation, Rutgers University, NJ.
20. Theofanis, S., Boile, M. and Golias, M.M. (2009) Container Terminal Berth Planning: Critical Review of Research Approaches and Practical Challenges. Marine Transportation and Port Operations 2009: Transportation Research Board 2100, pp. 22-28.
21. Wacket, M. (2007) A rollercoaster year in 2007: A white-knuckle ride in 2008? CI-Online, http://www.ci-online.co.uk/, accessed 19 September 2008