Skip to content
Review Open access

Nature-Inspired Metaheuristics for Solving Complex Optimization Problems in the Maritime Industry

Aug 2026 · TEM Journal · Vol 15, pp. 2321 · 0 citations

TL;DR

Recent algorithms such as The Pelican Optimization Algorithm, The Squirrel Search Optimization Algorithm, The Snow Leopard Optimization Algorithm and The Deer Hunting Optimization Algorithm have outperformed traditional metaheuristics in optimising known test functions, suggesting that they may offer promising improvements for solving complex maritime optimization problems.

Abstract

The maritime industry is crucial for global trade and the promotion of economic development. However, it faces major challenges, especially in tackling complex NP-hard problems that require effective decision support. To overcome these challenges, nature-inspired metaheuristic algorithms have proven to be powerful tools for optimization processes in the maritime sector. This paper provides a systematic overview of the application of these algorithms to various maritime problems, including collision avoidance, ship routing, tugboat scheduling, evacuation planning, container stowage, berth allocation, quay crane allocation, transport optimisation, search and rescue operations, hydrant location optimization and the damage stability problem. In addition, new optimisation algorithms are constantly being presented in the literature to further improve performance in various applications. As shown in this paper, recent algorithms such as The Pelican Optimization Algorithm, The Squirrel Search Optimization Algorithm, The Snow Leopard Optimization Algorithm and The Deer Hunting Optimization Algorithm have outperformed traditional metaheuristics in optimising known test functions, suggesting that they may offer promising improvements for solving complex maritime optimization problems.

Read PDF

Similar papers

Review Open access 2026

Hybrid Salp Swarm-Genetic Algorithm Optimization for the Multidimensional Knapsack Problem: A Conceptual Review and Framework Synthesis

An overview of the conceptual review of Hybrid Salp Swarm–Genetic Algorithm optimization in Multidimensional Knapsack Problem outlines the development of the MKP, metaheuristic optimization, evolutionary computation, swarm intelligence and hybrid optimization and discusses the complementary nature of exploring/exploiti...

Asaju La’aro Bolaji, Sanfo Bala, Andrew Ishaku Wreford et al. · 0 citations
Review Open access Nov 2026

An Improved Ant Colony Optimization Algorithm for Automated Ready-Mixed Concrete Distribution

The dynamic scheduling of ready-mixed concrete constitutes a critical bottleneck in construction automation. Following the design science paradigm and informed by a systematic literature review, this study develops the multistrategy ant colony optimization (MSACO) algorithm, which integrates three mechanisms: adapt...

Yang Guan, Ge Shi, Jie Yang et al. · 0 citations
Open access Sep 2026

An Application of a Modified Metaheuristic Algorithm for Solving Capacitated Vehicle Routing Problems

The vehicle routing problem is one of the most often studied optimization problems. In this study, an improved artificial bee colony (ABC) algorithm is proposed which is structured specifically to address the capacitated vehicle routing problem (CVRP), a significant challenge in combinatorial optimization. The proposed...

S. D. Jabeen, D. Sharma, Sandeep Jagtap · 0 citations
Review Open access Sep 2026

Advanced Optimization Methods for the Knapsack, Traveling Salesman, and Close-Enough Traveling Salesman Problems: A Survey and Case Studies

Combinatorial optimization problems (COPs), including the Knapsack Problem (KP), the Traveling Salesman Problem (TSP), and regional variants such as the Close-Enough Traveling Salesman Problem (CETSP), constitute fundamental models for addressing complex decision-making tasks in modern computational systems. Their comp...

S. El Kafhali, Mohamed Abid, Mohamed Hanini · 1 citation
Open access Sep 2026

Modified snake optimizer algorithm for solving the permutation flow shop scheduling problem

Minimising the makespan for large job sets is the goal of the algorithmically intensive NP-hard permutation flow shop scheduling problem (PFSP), which is crucial for real-world applications. Originally designed for continuous optimisation, the snake optimiser is a recently discovered swarm-based metaheuristic that may...

Hassan Almazini, Salah Mortada, H. Almazini · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.