|Title:||Combinatorial approach to exactly solving discrete and hybrid berth allocation problem||Journal:||Applied Mathematical Modelling||Volume:||40||Issue:||21-22||First page:||8952||Last page:||8973||Issue Date:||1-Nov-2016||Rank:||M21||ISSN:||0307-904X||DOI:||10.1016/j.apm.2016.05.004||Abstract:||
This paper presents an exact combinatorial algorithm for solving the Discrete Berth Allocation Problem (DBAP) and the Hybrid Berth Allocation Problem (HBAP) with fixed handling times of vessels based on the original algorithm for solving combinatorial problems called Sedimentation Algorithm. We address the issues of DBAP and HBAP according to the Rashidi and Tsang model. To the best of our knowledge, the proposed algorithm is the first exact combinatorial algorithm for solving the general DBAP and HBAP based on Rashidi and Tsang model. Computational results prove the superiority of the proposed algorithms compared with the exact solvers based on the Mixed Integer Programming (MIP) models. Efficient C implementation enabled us to solve instances with up to 65 vessels. This resolves most of the real life problems, even in large ports.
|Keywords:||Berth allocation problem | Branch and bound | Combinatorial optimization | Minimization of total cost | Optimal solution||Publisher:||Elsevier|
Show full item record
checked on Feb 5, 2023
checked on Feb 6, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.