Exact and heuristic methods to solve the berth allocation problem in bulk ports |
| |
Institution: | 1. Universitat de València, Dept. de Estadística i Investigació Operativa, Doctor Moliner 50, Burjassot 46100, Spain;2. KU Leuven, Department of Computer Science, CODeS & imec, Gebroeders De Smetstraat 1, Ghent 9000, Belgium |
| |
Abstract: | In this paper, we study the dynamic hybrid berth allocation problem in bulk ports with the objective to minimize the total service times of the vessels. We propose two exact methods based on mixed integer programming and generalized set partitioning, and a heuristic method based on squeaky wheel optimization, explicitly considering the cargo type on the vessel. The formulations are compared through extensive numerical experiments based on instances inspired from real bulk port data. The results indicate that the set partitioning method and the heuristic method can be used to obtain near-optimal solutions for even larger problem size. |
| |
Keywords: | Bulk ports Berth allocation Mixed integer programming Set partitioning Squeaky wheel optimization |
本文献已被 ScienceDirect 等数据库收录! |
|