Search results

1 – 4 of 4
Content available
Article
Publication date: 15 December 2017

Maxim A. Dulebenets

The volumes of international containerized trade substantially increased over the past years. In the meantime, marine container terminal (MCT) operators are facing…

Abstract

Purpose

The volumes of international containerized trade substantially increased over the past years. In the meantime, marine container terminal (MCT) operators are facing congestion issues at their terminals because of the increasing number of large-size vessels, the lack of innovative technologies and advanced handling equipment and the inability of proper scheduling of the available resources. This study aims to propose a novel memetic algorithm with a deterministic parameter control to facilitate the berth scheduling at MCTs and minimize the total vessel service cost.

Design/methodology/approach

A local search heuristic, which is based on the first-come-first-served policy, is applied at the chromosomes and population initialization stage within the developed memetic algorithm (MA). The deterministic parameter control strategy is implemented for a custom mutation operator, which alters the mutation rate values based on the piecewise function throughout the evolution of the algorithm. Performance of the proposed MA is compared with that of the alternative solution algorithms widely used in the berth scheduling literature, including a MA that does not apply the deterministic parameter control strategy, typical evolutionary algorithm, simulated annealing and variable neighborhood search.

Findings

Results demonstrate that the developed MA with a deterministic parameter control can obtain superior berth schedules in terms of the total vessel service cost within a reasonable computational time. Furthermore, greater cost savings are observed for the cases with high demand and low berthing capacity at the terminal. A comprehensive analysis of the convergence patterns indicates that introduction of the custom mutation operator with a deterministic control for the mutation rate value would provide more efficient exploration and exploitation of the search space.

Research limitations/implications

This study does not account for uncertainty in vessel arrivals. Furthermore, potential changes in the vessel handling times owing to terminal disruptions are not captured.

Practical implications

The developed solution algorithm can serve as an efficient planning tool for MCT operators and assist with efficient berth scheduling for both discrete and continuous berthing layout cases.

Originality/value

The majority of studies on berth scheduling rely on the stochastic search algorithms without considering the specific problem properties and applying the guided search heuristics. Unlike canonical evolutionary algorithms, the developed algorithm uses a local search heuristic for the chromosomes and population initialization and adjusts the mutation rate values based on a deterministic parameter control strategy for more efficient exploration and exploitation of the search space.

Details

Maritime Business Review, vol. 2 no. 4
Type: Research Article
ISSN: 2397-3757

Keywords

Content available
Article
Publication date: 3 December 2019

Masoud Kavoosi, Maxim A. Dulebenets, Olumide Abioye, Junayed Pasha, Oluwatosin Theophilus, Hui Wang, Raphael Kampmann and Marko Mikijeljević

Marine transportation has been faced with an increasing demand for containerized cargo during the past decade. Marine container terminals (MCTs), as the facilities for…

Abstract

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.

Content available
Article
Publication date: 30 June 2016

Maxim A. Dulebenets

Emissions produced by oceangoing vessels not only negatively affect the environment but also may deteriorate health of living organisms. Several regulations were released…

Downloads
6480

Abstract

Purpose

Emissions produced by oceangoing vessels not only negatively affect the environment but also may deteriorate health of living organisms. Several regulations were released by the International Maritime Organization (IMO) to alleviate negative externalities from maritime transportation. Certain polluted areas were designated as “Emission Control Areas” (ECAs). However, IMO did not enforce any restrictions on the actual quantity of emissions that could be produced within ECAs. This paper aims to perform a comprehensive assessment of advantages and disadvantages from introducing restrictions on the emissions produced within ECAs. Two mixed-integer non-linear mathematical programs are presented to model the existing IMO regulations and an alternative policy, which along with the established IMO requirements also enforces restrictions on the quantity of emissions produced within ECAs. A set of linearization techniques are applied to linearize both models, which are further solved using the dynamic secant approximation procedure. Numerical experiments demonstrate that introduction of emission restrictions within ECAs can significantly reduce pollution levels but may incur increasing route service cost for the liner shipping company.

Design/methodology/approach

Two mixed-integer non-linear mathematical programs are presented to model the existing IMO regulations and an alternative policy, which along with the established IMO requirements also enforces restrictions on the quantity of emissions produced within ECAs. A set of linearization techniques are applied to linearize both models, which are further solved using the dynamic secant approximation procedure.

Findings

Numerical experiments were conducted for the French Asia Line 3 route, served by CMA CGM liner shipping company and passing through ECAs with sulfur oxide control. It was found that introduction of emission restrictions reduced the quantity of sulfur dioxide emissions produced by 40.4 per cent. In the meantime, emission restrictions required the liner shipping company to decrease the vessel sailing speed not only at voyage legs within ECAs but also at the adjacent voyage legs, which increased the total vessel turnaround time and in turn increased the total route service cost by 7.8 per cent.

Research limitations/implications

This study does not capture uncertainty in liner shipping operations.

Practical implications

The developed mathematical model can serve as an efficient practical tool for liner shipping companies in developing green vessel schedules, enhancing energy efficiency and improving environmental sustainability.

Originality/value

Researchers and practitioners seek for new mathematical models and environmental policies that may alleviate pollution from oceangoing vessels and improve energy efficiency. This study proposes two novel mathematical models for the green vessel scheduling problem in a liner shipping route with ECAs. The first model is based on the existing IMO regulations, whereas the second one along with the established IMO requirements enforces emission restrictions within ECAs. Extensive numerical experiments are performed to assess advantages and disadvantages from introducing emission restrictions within ECAs.

Content available
Article
Publication date: 15 June 2017

Ali Dadashi, Maxim A. Dulebenets, Mihalis M. Golias and Abdolreza Sheikholeslami

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…

Downloads
1031

Abstract

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.

Details

Maritime Business Review, vol. 2 no. 2
Type: Research Article
ISSN: 2397-3757

Keywords

1 – 4 of 4