Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations
This paper considers the integrated problem of quay crane assignment, quay crane scheduling, yard location assignment, and vehicle dispatching operations at a container terminal. The main objective is to minimize vessel turnover times and maximize the terminal throughput, which are key economic drivers in terminal operations. Due to their computational complexities, these problems are not optimized jointly in existing work. This paper revisits this limitation and proposes Mixed Integer Programming (MIP) and Constraint Programming (CP) models for the integrated problem, under some realistic assumptions. Experimental results show that the MIP formulation can only solve small instances, while the CP model finds optimal solutions in reasonable times for realistic instances derived from actual container terminal operations.
KeywordsContainer terminal operations MIP Constraint programming
- 5.Homayouni, S.M., Vasili, M.R., Kazemi, S.M., Tang, S.H.: Integrated scheduling of SP-AS/RS and handling equipment in automated container terminals. In: Proceedings of International Conference on Computers and Industrial Engineering, CIE, vol. 2 (2012)Google Scholar
- 10.Liang, L., Lu, Z.Q., Zhou, B.H.: A heuristic algorithm for integrated scheduling problem of container handling system. In: 2009 International Conference on Computers Industrial Engineering, pp. 40–45. IEEE (2009)Google Scholar
- 21.Zheng, K., Lu, Z., Sun, X.: An effective heuristic for the integrated scheduling problem of automated container handling system using twin 40’ cranes. In: 2010 Second International Conference on Computer Modeling and Simulation, pp. 406–410. IEEE (2010)Google Scholar