New hybrid genetic algorithms to solve dynamic berth allocation problem

Bacalhau, Eduardo Tadeu; Casacio, Luciana; Azevedo, Aníbal Tavares de

doi:10.1016/j.eswa.2020.114198

Cited by 23 publications

(6 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Results from simulations show that the proposed method provides the berth allocation plan with minimum (or no) delays in departure times. A hybrid heuristic-based genetic algorithm (GA) is developed in [13] to solve the BAP to avoid the issue of high computation time in exact approaches. The authors combine dynamic programming (DP) with the standard GA to solve large-scale problems that minimize service cost [13].…”

Section: Literature Reviewmentioning

confidence: 99%

“…A hybrid heuristic-based genetic algorithm (GA) is developed in [13] to solve the BAP to avoid the issue of high computation time in exact approaches. The authors combine dynamic programming (DP) with the standard GA to solve large-scale problems that minimize service cost [13].…”

Section: Literature Reviewmentioning

confidence: 99%

“…Numerous studies deal only with the allocation of berths at a single quay, assuming that it forms one straight line in which vessels can be berthed according to their length and the positions of other vessels. For example, an exact approach to solve SQ-BAP is presented in [11], an evolutionary algorithm in [12], and a metaheuristic-based method in [13]. However, this assumption is not realistic for several ports around the globe, which consist of multiple separate line segments or quays for berthing [14].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Berth Allocation Considering Multiple Quays: A Practical Approach Using Cuckoo Search Optimization

Aslam

Michaelides

Herodotou

2023

JMSE

View full text Add to dashboard Cite

Maritime container terminals (MCTs) play a fundamental role in international maritime trade, handling inbound, outbound, and transshipped containers. The increasing number of ships and containers creates several challenges to MCTs, such as congestion, long waiting times before ships dock, delayed departures, and high service costs. The berth allocation problem (BAP) concerns allocating berthing positions to arriving ships to reduce total service cost, waiting times, and delays in vessels’ departures. In this work, we extend the study of continuous BAP, which considers a single quay (straight line) for berthing ships, to multiple quays, as found in many ports around the globe. Multi-Quay BAP (MQ-BAP) adds the additional dimension of assigning a preferred quay to each arriving ship, rather than just specifying the berthing position and time. In this study, we address MQ-BAP with the objective of minimizing the total service cost, which includes minimizing the waiting times and delays in the departure of ships. MQ-BAP is first formulated as a mixed-integer linear problem and then solved using the cuckoo search algorithm (CSA), a computational intelligence (CI)-based approach. In addition, the exact mixed-integer linear programming (MILP) method, two other state-of-the-art metaheuristic approaches, namely the genetic algorithm (GA) and particle swarm optimization (PSO), as well as a first come first serve (FCFS) approach, are also implemented for comparison purposes. Several experiments are conducted using both randomly generated and real data from the Port of Limassol, Cyprus, which has five quays serving commercial vessel traffic. The comparative analysis and experimental results show that the CSA-based method achieves the best overall results in affordable time as compared to the other CI-based methods, for all considered scenarios.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Berth Allocation Considering Multiple Quays: A Practical Approach Using Cuckoo Search Optimization

Aslam

Michaelides

Herodotou

2023

JMSE

View full text Add to dashboard Cite

show abstract

“…In the research of BAP, some scholars have studied the discrete berth scheduling problem. e berth scheduling problem is to reasonably assign the berth of terminal to the given vessels, optimizing the total service time and the utilization of berth [18]. Imai et al [19] discussed the static berth scheduling problem and established a mathematical model aiming at minimizing the total stay time of ships in port and the dissatisfaction of ship berthing.…”

Section: Literature Review and Related Workmentioning

confidence: 99%

Container Terminal Berth and Yard Collaborative Allocation for Import and Export Synchronous Operations by Computational Logistics

Jiang

Lei

2022

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

Container terminal operators have practical and clear requirements on improving operational efficiency and service level to address running challenges. The resource allocation and collaborative scheduling of quayside berth and storage yard are vital issues in the optimization of container terminal handling systems (CTHSs). The allocation of berth in quayside and blocks on storage yard directly affects the running efficiency of CTHS. Consequently, we focus on the berth and yard collaborative allocation for import and export synchronous operations (BYCA-IESOs) and propose the BYCA-IESO research model based on synchronous or asynchronous integrated scheduling strategy by computational logistics. The BYCA-IESO model is a mixed integer quadratic programming model to minimize multiple time consumption of calling liners and the total horizontal transferring distances of yard trailers at container terminals. Furthermore, we design other two allocation policies for comparison on the BYCA-IESO, which are both multistage scheduling strategy profiles. CPLEX 20.1.0 is applied to implement and solve the model and tactics of BYCA-IESO. Accordingly, the feasibility, validity, and relative merits of the models and strategies are obtained and verified by analyzing and comparing multiple numerical experimental results.

show abstract

“…In [24], a real dynamic berth allocation model was implemented in the terminal of Paranaguá in Brazil. Two optimizers were combined: a local search dynamic programming with a genetic algorithm.…”

Section: Related Workmentioning

confidence: 99%

A Comprehensive Modeling of the Discrete and Dynamic Problem of Berth Allocation in Maritime Terminals

Mnasri

Alrashidi

2021

Electronics

View full text Add to dashboard Cite

In this study, the discrete and dynamic problem of berth allocation in maritime terminals, is investigated. The suggested resolution method relies on a paradigm of optimization with two techniques: heuristic and multi-agent. Indeed, a set of techniques such as the protocol of negotiation named contract net, the multi-agent interactions, and Worst-Fit arrangement technique, are involved. The main objective of the study is to propose a solution for attributing m parallel machines to a set of activities. The contribution of the study is to provide a detailed modeling of the discrete and dynamic berth allocation problem by establishing the corresponding models using a multi-agent methodology. A set of numerical experiments are detailed to prove the performance of the introduced multi-agent strategy compared with genetic algorithm and tabu search.

show abstract

New hybrid genetic algorithms to solve dynamic berth allocation problem

Cited by 23 publications

References 32 publications

Berth Allocation Considering Multiple Quays: A Practical Approach Using Cuckoo Search Optimization

Berth Allocation Considering Multiple Quays: A Practical Approach Using Cuckoo Search Optimization

Container Terminal Berth and Yard Collaborative Allocation for Import and Export Synchronous Operations by Computational Logistics

A Comprehensive Modeling of the Discrete and Dynamic Problem of Berth Allocation in Maritime Terminals

Contact Info

Product

Resources

About