Berth allocation planning optimization in container terminals

International Series in Operations Research and Management Science

Volumn 119, Issue , 2008, Pages 69-104

  Dai, Jam ^a,b   Lin, Wuqin ^a,b   Moorthy, Rajeeva ^a,b   Teo, Chung Piaw ^a,b  

^a Georgia Institute of Technology   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84954508726     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Chapter

References (24)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin (1993). Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.
2. F. Barahona and R. Anbil (2000). The volume algorithm: producing primal solutions using a subgradient method, Mathematical Programming, 87, 385–399.
3. G.G. Brown, S. Lawphongpanich, and K.P. Thurman (1994). Optimizing ship berthing, Naval Research Logistics, 41, 1–15.
4. C.Y. Chen and T.W. Hsieh (1999). A time–space network model for the berth allocation problem, Presented at the 19th IFIP TC7 Conference on System Modelling and Optimization.
5. L.W. Chen (1998). Optimisation problem in a container port, M.Sc. Research Report, SoC, NUS.
6. J.T. Chia, H.C. Lau, and A. Lim (1999). Ant colony optimization for the ship berthing problem, in P.S. Thiagarajan, R. Yap (Eds.): ASIAN’99, LNCS 1742, pp. 359–370.
7. J.G. Dai and W. Lin (2005). Maximum pressure policies in stochastic processing networks, Operations Research, 53, 197–218.
8. A.V. Fishkin, K. Jansen and L. Porkolab (2001). On minimizing average weighted completion time: A PTAS for scheduling general multiprocessor tasks, in Proceedings 13th International Symposium on Fundamentals of Computation Theory (FCT’01), Rusins Freivalds (Ed.), Riga, LNCS 2138, Springer Verlag, pp. 495–507.
9. Y.P. Guan and R.K. Cheung (2004). The berth allocation problem: models and solution methods, OR Spectrum, 26, 75–92.
10. Y.P. Guan, W.Q. Xiao, R.K. Cheung, and C.-L. Li (2002). A multiprocessor task scheduling model for berth allocation: heuristic and worst case analysis, Operations Research Letters, 30, 343–350.
11. S. Imahori, M. Yagiura, and T. Ibaraki (2003). Local search algorithms for the rectangle packing problem with general spatial costs, Mathematical Programming Series B, 97, 543–569.
12. A. Imai, E. Nishimura, and S. Papadimitriou (2001). The dynamic berth allocation problem for a container port, Transportation Research Part B, 35, 401–417.
13. A. Imai, E. Nishimura, and S. Papadimitriou (2003). Berth allocation with service priority, Transportation Research Part B, 37, 437–457.
14. K.H. Kim and K.C. Moon (2003). Berth scheduling by simulated annealing, Transportation Research Part B, 37, 541–560.
15. C.L. Li, X. Cai, and C.Y. Lee (1998). Scheduling with multiple-job-on-one-processor pattern, IIE Transactions, 30, 433–446.
16. S.N. Loh (1996), The Quadratic Assignment Problem and its Generalization to the Berth Allocation Problem, Honours Years Project Report, DISCS, NUS.
17. A. Lim (1998). On the ship berthing problem, Operations Research Letters, 22(2–3), 105–110.
18. K.C. Moon (2000). A Mathematical Model and a Heuristic Algorithm for Berth Planning, Unpublished Thesis. Pusan National University.
19. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani (1996). VLSI module placement based on rectangle packing by the sequence pair, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 15–12, 1518–1524.
20. H. Murata, K. Fujiyoshi, and M. Kaneko (1998). VLSI/PCB placement with obstacles based on sequence pair, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 17, 60–68.
21. Y.M. Park and K.H. Kim (2003). A scheduling method for Berth and Quay cranes, OR Spectrum, 25, 1–23.
22. D. Steenken, S. Voss, and R. Stahlbock (2004). Container terminal operation and operations research a classification and literature review, OR Spectrum, 26, 3–49.
23. X. Tang, R. Tian, and D.F. Wong (2000). Fast evaluation of sequence pair in block placement by longest common subsequence computation, in Proceedings of the Conference on Design, Automation and Test in Europe, pp. 106–111.
24. C.J. Tong, H.C. Lau, A. Lim (1999). Ant Colony Optimization for the ship Berthing problem, Asian Computing Science Conference (ASIAN), pp. 359–370.