Application of Evolutionary Computation for Berth Scheduling at Marine Container Terminals: Parameter Tuning Versus Parameter Control

2018 ◽  
Vol 19 (1) ◽  
pp. 25-37 ◽  
Author(s):  
Maxim A. Dulebenets
2019 ◽  
Vol 5 (1) ◽  
pp. 30-66 ◽  
Author(s):  
Masoud Kavoosi ◽  
Maxim A. Dulebenets ◽  
Olumide Abioye ◽  
Junayed Pasha ◽  
Oluwatosin Theophilus ◽  
...  

Purpose Marine transportation has been faced with an increasing demand for containerized cargo during the past decade. Marine container terminals (MCTs), as the facilities for connecting seaborne and inland transportation, are expected to handle the increasing amount of containers, delivered by vessels. Berth scheduling plays an important role for the total throughput of MCTs as well as the overall effectiveness of the MCT operations. This study aims to propose a novel island-based metaheuristic algorithm to solve the berth scheduling problem and minimize the total cost of serving the arriving vessels at the MCT. Design/methodology/approach A universal island-based metaheuristic algorithm (UIMA) was proposed in this study, aiming to solve the spatially constrained berth scheduling problem. The UIMA population was divided into four sub-populations (i.e. islands). Unlike the canonical island-based algorithms that execute the same metaheuristic on each island, four different population-based metaheuristics are adopted within the developed algorithm to search the islands, including the following: evolutionary algorithm (EA), particle swarm optimization (PSO), estimation of distribution algorithm (EDA) and differential evolution (DE). The adopted population-based metaheuristic algorithms rely on different operators, which facilitate the search process for superior solutions on the UIMA islands. Findings The conducted numerical experiments demonstrated that the developed UIMA algorithm returned near-optimal solutions for the small-size problem instances. As for the large-size problem instances, UIMA was found to be superior to the EA, PSO, EDA and DE algorithms, which were executed in isolation, in terms of the obtained objective function values at termination. Furthermore, the developed UIMA algorithm outperformed various single-solution-based metaheuristic algorithms (including variable neighborhood search, tabu search and simulated annealing) in terms of the solution quality. The maximum UIMA computational time did not exceed 306 s. Research limitations/implications Some of the previous berth scheduling studies modeled uncertain vessel arrival times and/or handling times, while this study assumed the vessel arrival and handling times to be deterministic. Practical implications The developed UIMA algorithm can be used by the MCT operators as an efficient decision support tool and assist with a cost-effective design of berth schedules within an acceptable computational time. Originality/value A novel island-based metaheuristic algorithm is designed to solve the spatially constrained berth scheduling problem. The proposed island-based algorithm adopts several types of metaheuristic algorithms to cover different areas of the search space. The considered metaheuristic algorithms rely on different operators. Such feature is expected to facilitate the search process for superior solutions.


2017 ◽  
Vol 2 (2) ◽  
pp. 142-157 ◽  
Author(s):  
Ali Dadashi ◽  
Maxim A. Dulebenets ◽  
Mihalis M. Golias ◽  
Abdolreza Sheikholeslami

Purpose The paper aims to propose a new mathematical model for allocation and scheduling of vessels at multiple marine container terminals of the same port, considering the access channel depth variations by time of day. Design/methodology/approach This paper proposes a new mathematical model for allocation and scheduling of vessels at multiple marine container terminals of the same port, considering the access channel depth variations by time of day. The access channel serves as a gate for vessels entering or leaving the port. During low-depth tidal periods the vessels with deep drafts have to wait until the depth of the access channel reaches the required depth. Findings A number of numerical experiments are performed using the operational data collected from Port of Bandar Abbas (Iran). Results demonstrate that the suggested methodology is able to improve the existing port operations and significantly decrease delayed vessel departures. Originality/value The contribution of this study to the state of the art is a novel mathematical model for allocation and scheduling of vessels at multiple terminals of the same port, taking into consideration channel depth variations by time of day. To the best of the authors’ knowledge, this is the first continuous berth scheduling linear model that addresses the tidal effects on berth scheduling (both in terms of vessel arrival and departure at/from the berth) at multiple marine container terminals.


2020 ◽  
Author(s):  
Masoud Kavoosi

International trade plays a critical role for the global economy. A significant portion of general consumption goods is transported by vessels in a containerized form. Increasing volumes of the containerized trade impose additional pressure on marine container terminals (MCTs), which are responsible for service of incoming vessels from different liner shipping companies. MCTs are considered as important nodes in supply chains, as they allow transfer of containers from vessels to one of the alternative inland modes (generally, truck or rail). Managing operations within MCTs is a quite challenging task not only due to increasing seaborne trade volumes, but also due to increasing number of liner shipping alliances, deployment of megaships by liner shipping companies, inability to expand the terminal size due to spatial constraints, and other factors. Another important goal for the MCT operator is to ensure the timely service of vessels, as the vessel service delays may result in potential disruption of liner shipping schedules, and ultimately cause product delivery delays to the final customers.This dissertation focuses on addressing complex decision problems, which are faced by the MCT operators. The seaside operations, which deal with loading and unloading of vessels, will be of a primary interest, as they affect the total turnaround time of vessels. The latter is considered as one of the key performance indicators for the MCT operations. As many of decision problems related to the seaside operations, cannot be solved using the exact optimization algorithms (e.g., Simplex, Branch-and-Bound, Brach-and-Cut) within a reasonable computational time for the realistic size problem instances, a number of metaheuristic algorithms will be proposed (with a primary focus on Evolutionary Algorithms, which have been widely used in different fields for solving combinatorial decision problems). The proposed metaheuristic algorithms are expected to serve as efficient decision making tools for the MCT operators and facilitate exchange of freight flows between water and inland transportation modes.


2014 ◽  
Vol 41 ◽  
pp. 412-422 ◽  
Author(s):  
Mihalis Golias ◽  
Isabel Portal ◽  
Dinçer Konur ◽  
Evangelos Kaisar ◽  
Georgios Kolomvos

2019 ◽  
Vol 42 ◽  
pp. 100972 ◽  
Author(s):  
Masoud Kavoosi ◽  
Maxim A. Dulebenets ◽  
Olumide F. Abioye ◽  
Junayed Pasha ◽  
Hui Wang ◽  
...  

Algorithms ◽  
2018 ◽  
Vol 11 (7) ◽  
pp. 100 ◽  
Author(s):  
Maxim A. Dulebenets ◽  
Masoud Kavoosi ◽  
Olumide Abioye ◽  
Junayed Pasha

Author(s):  
Snehal Mohan Kamalapur ◽  
Varsha Patil

The issue of parameter setting of an algorithm is one of the most promising areas of research. Particle Swarm Optimization (PSO) is population based method. The performance of PSO is sensitive to the parameter settings. In the literature of evolutionary computation there are two types of parameter settings - parameter tuning and parameter control. Static parameter tuning may lead to poor performance as optimal values of parameters may be different at different stages of run. This leads to parameter control. This chapter has two-fold objectives to provide a comprehensive discussion on parameter settings and on parameter settings of PSO. The objectives are to study parameter tuning and control, to get the insight of PSO and impact of parameters settings for particles of PSO.


2020 ◽  
Vol 2020 ◽  
pp. 1-11 ◽  
Author(s):  
Cheng Luo ◽  
Hongying Fei ◽  
Dana Sailike ◽  
Tingyi Xu ◽  
Fuzhi Huang

“Double-Line Ship Mooring” (DLSM) mode has been applied as an initiative operation mode for solving berth allocation problems (BAP) in certain giant container terminals in China. In this study, a continuous berth scheduling problem with the DLSM model is illustrated and solved with exact and heuristic methods with an objective to minimize the total operation cost, including both the additional transportation cost for vessels not located at their minimum-cost berthing position and the penalties for vessels not being able to leave as planned. First of all, this problem is formulated as a mixed-integer programming model and solved by the CPLEX solver for small-size instances. Afterwards, a particle swarm optimization (PSO) algorithm is developed to obtain good quality solutions within reasonable execution time for large-scale problems. Experimental results show that DLSM mode can not only greatly reduce the total operation cost but also significantly improve the efficiency of berth scheduling in comparison with the widely used single-line ship mooring (SLSM) mode. The comparison made between the results obtained by the proposed PSO algorithm and that obtained by the CPLEX solver for both small-size and large-scale instances are also quite encouraging. To sum up, this study can not only validate the effectiveness of DLSM mode for heavy-loaded ports but also provide a powerful decision support tool for the port operators to make good quality berth schedules with the DLSM mode.


Sign in / Sign up

Export Citation Format

Share Document