Authors: Kovač, Nataša
Davidović, Tatjana 
Stanimirović, Zorica
Title: Variable neighborhood search methods for the dynamic minimum cost hybrid berth allocation problem
Journal: Information Technology and Control
Volume: 47
Issue: 3
First page: 471
Last page: 488
Issue Date: 1-Jan-2018
Rank: M23
ISSN: 1392-124X
DOI: 10.5755/j01.itc.47.3.20420
This study considers the Dynamic Minimum Cost Hybrid Berth Allocation Problem (DMCHBAP) with fixed handling times of vessels. The objective function to be minimized consists of three components: the costs of positioning, waiting, and tardiness of completion for all vessels. Having in mind that the speed of finding high-quality solutions is of crucial importance for designing an efficient and reliable decision support system in container terminal, metaheuristic methods represent the natural choice to deal with DMCHBAP. Four variants of Variable Neighborhood Search (VNS) metaheuristic are designed for DMCHBAP. All four proposed VNS methods are evaluated on four classes of randomly generated instances with respect to solution quality and running times. The conducted computational analysis indicates that all four VNS-based methods represent promising solution approaches to DMCHBAP and similar problems in maritime transportation.
Keywords: Container terminal | Metaheuristics | Penalties | Scheduling vessels | Variable neighborhood search
Publisher: Kaunas University of Technology
Project: Graph theory and mathematical programming with applications in chemistry and computer science 
Mathematical Modelas and Optimization Methods on Large-Scale Systems 

Show full item record


checked on May 20, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.