Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/34045
Title: | A collaborative agreement for berth allocation under excessive demand |
Authors: | Dulebenets, Maxim A. Golias, Mihalis Mishra, Sabyasachee |
Major Field of Science: | Engineering and Technology |
Keywords: | Maritime container terminals;Collaborative agreement;Shared capacity;Service time windows;Memetic algorithm;Cost savings |
Issue Date: | 1-Mar-2018 |
Source: | Engineering Applications of Artificial Intelligence, vol.69, p.76-92, 2018 |
Volume: | 69 |
Start page: | 76 |
End page: | 92 |
Journal: | Engineering Applications of Artificial Intelligence |
Abstract: | International seaborne trade has increased significantly during the last three decades, and this growth is expected to continue at similar rates. To address the growing demand, terminal operators aim to improve productivity with the minimum capital investment. This study extends an existing berth allocation policy, where demand can be diverted from a multi-user maritime container terminal to an external maritime container terminal at an additional cost. Furthermore, additional market based rules are introduced in the model for the vessel diversion decision making. The objective of the multi-user maritime terminal operator is to minimize the total vessel service cost. Due to complexity of the proposed mathematical formulation, a Memetic Algorithm is developed to solve the resulting problem. A number of numerical experiments are presented to evaluate efficiency of the new berth allocation policy and the solution algorithm. Results indicate that the suggested berth allocation policy yields substantial cost savings during high demand periods. |
URI: | https://hdl.handle.net/20.500.14279/34045 |
ISSN: | 09521976 |
DOI: | 10.1016/j.engappai.2017.11.009 |
Type: | Article |
Affiliation : | Florida State University University of Memphis |
Publication Type: | Peer Reviewed |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
Sorry the service is unavailable at the moment. Please try again later.
Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.