The Continuous Berth Allocation Problem by Simulated Annealing  

Oleh:

Ting, Ching-Jung ; Lin, Shih-Wei ; Wu, Kun-Chih

Jenis: Article from Proceeding
Dalam koleksi: The 14th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS), 3-6 December 2013 Cebu, Philippines, page 1-8.
Topik: berth allocation problem; simulated annealing; continuous
Fulltext: 1270.pdf (253.82KB)

Isi artikel

Due to over 80 percent of global trade by volume and over 70 percent by value is carried by sea, berth allocation problem can be considered as an optimization problem of the seaside operations in container terminals. In this paper, we study the continuous and dynamic berth allocation problem whose objective is to minimize the total service time. Since the dynamic berth allocation problem is NP-hard, exact solution method cannot solve the practical problem in reasonable time. An efficient simulated annealing (SA) algorithm is proposed to identify the possible locations along the quay for next vessel. The SA is to assign vessels from the left side of available position along the quay. Both small and large scale instances from the literature are tested to evaluate the effectiveness of the proposed SAs by comparison with optimization software CPLEX and two other heuristic algorithms. The results show that our proposed SA can obtain optimal solutions in small instances and updates the best solutions in large instances.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali