Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem
- 96 Downloads
The berth allocation problem is an optimization problem concerning seaside operations at container terminals. This study investigates the dynamic and continuous berth allocation problem (BAP), whose objective is to minimize the total weighted service time and the deviation cost from vessels’ preferred position. The problem is formulated as a mixed integer programming model. Due to that the BAP is NP-hard, two efficient and effective simulated annealing (SA) algorithms are proposed to locate vessels along the quay. The first SA assigns vessels to available positions along the quay from the left to the right, while the second assigns vessels from both sides. Both small and large-scale instances in the literature are tested to evaluate the effectiveness of the proposed SA algorithms using the optimization software Gurobi and heuristic algorithms from the literature. The results indicate that the proposed SAs can provide optimal solutions in small-scale instances and updates the best solutions in large-scale instances. The improvement over other comparing heuristics is statistically significant.
KeywordsBerth allocation problem Continuous Simulated annealing Container terminal
The authors are grateful to the Ministry of Science and Technology of the Republic of China (Taiwan) and the Linkou Chang Gung Memorial Hospital for financially supporting this research Grants MOST 105-2410-H-182-009-MY2 and CMRPD3G0011, respectively.
- Dai J, Lin W, Moorthy R, Teo CP (2008) Berth allocation planning optimization in container terminals. In: Tang CS, Teo CP, Wei KK (eds) Supply chain analysis. International series in operations research & management science, vol 119. Springer, Boston, MA, pp 69–104Google Scholar
- Fugazza M (2015) Maritime connectivity and trade. UNCTAD policy issues in international trade and commodities, Research Study Series No. 70. New York and GenevaGoogle Scholar
- Hansen P, Oğuz C (2003) A note on formulation of static and dynamic berth allocation problems. Les Cahiers du GERAD G-2003-30Google Scholar
- Li CL, Cai X, Lee CY (1998) Scheduling with multiple-job-on-one-processor pattern. IIE Trans 30(5):433–445Google Scholar
- Mauri GR, Andrade LN, Lorena LAN (2011) A memetic algorithm for a continuous case of the berth allocation problem. In: 2011 international conference on evolutionary computation theory and applications, Paris, FranceGoogle Scholar
- UNCTAD (2016) Review of maritime transportation. In: United Nations conference on trade and developmentGoogle Scholar