Artificial Intelligence Techniques for the Berth Allocation and Container Stacking Problems in Container Terminals
The Container Stacking Problem and the Berth Allocation Problem are two important problems in maritime container terminal’s management which are clearly related. Terminal operators normally demand all containers to be loaded into an incoming vessel should be ready and easily accessible in the terminal before vessel’s arrival. Similarly, customers (i.e., vessel owners) expect prompt berthing of their vessels upon arrival. In this paper, we present an artificial intelligence based-integrated system to relate these problems. Firstly, we develop a metaheuristic algorithm for berth allocation which generates an optimized order of vessel to be served according to existing berth constraints. Secondly, we develop a domain-oriented heuristic planner for calculating the number of reshuffles needed to allocate containers in the appropriate place for a given berth ordering of vessels. By combining these optimized solutions, terminal operators can be assisted to decide the most appropriated solution in each particular case.
KeywordsGreedy Randomize Adaptive Search Procedure Container Terminal Quay Crane Terminal Operator Complete Search
Unable to display preview. Download preview PDF.
This work has been partially supported by the research projects TIN2007-67943-C02-01 (MEC, Spain-FEDER), and P19/08 (M. Fomento, Spain-FEDER).
- 1.Henesey, L. (2006). Overview of Transshipment Operations and Simulation. In: MedTrade conference, Malta, April. pp. 6–7.Google Scholar
- 5.Park, K., T. Park and K.R. Ryu (2009). Planning for remarshaling in an automated container terminal using cooperative coevolutionary algorithms. In: ACM symposium on Applied Computing. ACM. pp. 1098–1105.Google Scholar
- 7.Winograd T. (1971). Procedures as a representation for data in a computer program for understanding natural language. MIT. Cent. Space Res.Google Scholar
- 8.Salido, M., Sapena, O and Barber F. (2009). The Container Stacking Problem: an Artificial Intelligence Planning-Based Approach. In Proc. of The Int. Workshop on Harbour, Maritime and Multimodal Logistics Modelling and Simulation HMS’2009. pp:127-131.Google Scholar
- 9.Ghallab, M., Howe, A., Knoblock, C., McDermott, D., Ram, A., Veloso, M., Weld, D., and Wilkins, D. (1998). PDDL - the planning domain definition language. AIPS-98 Planning Committee.Google Scholar
- 11.Rodriguez, M, Salido, M., Barber F. (2009a). Domain-Dependent Planning Heuristics for Locating Containers in Maritime Terminals. Trends in Applied Intelligent Systems. IEA/AIE 2010, LNAI 6096, pp. 742–751.Google Scholar
- 16.Cheong, C.Y., Tan, K.C. and Liu, D.K. (2009). Solving the berth allocation problem with service priority via multi- objective optimization. In: Computational Intell. in Scheduling, 2009. CI-Sched ’09. IEEE Symposium on. pp. 95 –102.Google Scholar