A diversity metric for population-based metaheuristic algorithms

2022 ◽  
Vol 586 ◽  
pp. 192-208
Author(s):  
Valentín Osuna-Enciso ◽  
Erik Cuevas ◽  
Bernardo Morales Castañeda
Keyword(s):  
Population Based ◽  
Metaheuristic Algorithms

scholarly journals Berth scheduling at marine container terminals

2019 ◽  
Vol 5 (1) ◽  
pp. 30-66 ◽  
Author(s):  
Masoud Kavoosi ◽  
Maxim A. Dulebenets ◽  
Olumide Abioye ◽  
Junayed Pasha ◽  
Oluwatosin Theophilus ◽  
...  
Keyword(s):  
Population Based ◽  
Container Terminals ◽  
Metaheuristic Algorithms ◽  
Computational Time ◽  
Scheduling Problem ◽  
Metaheuristic Algorithm ◽  
Content Type ◽  
Marine Container Terminals ◽  
Problem Instances ◽  
Berth Scheduling

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.

scholarly journals TV White Space Network Power Allocation Using Hybrid Grey Wolf Optimizer with Firefly Algorithm and Particle Swarm Optimization

2021 ◽  
Vol 20 ◽  
pp. 66-75
Author(s):  
Kennedy Ronoh ◽  
George Kamucha
Keyword(s):  
Particle Swarm Optimization ◽  
Power Allocation ◽  
Firefly Algorithm ◽  
Population Based ◽  
Metaheuristic Algorithms ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Secondary Users ◽  
Swarm Optimization ◽  
Network Power

TV white spaces (TVWS) can be utilized by Secondary Users (SUs) equipped with cognitive radio functionality on the condition that they do not cause harmful interference to Primary Users (PUs). Optimization of power allocation is necessary when there is a high density of secondary users in a network in order to reduce the level of interference among SUs and to protect PUs against harmful interference. Grey Wolf Optimizer (GWO) is relatively recent population based metaheuristic algorithm that has shown superior performance compared to other population based metaheuristic algorithms. Recent trend has been to hybridize population based metaheuristic algorithms in order to avoid the problem of getting trapped in a local optimum. This paper presents the design and analysis of performance of a hybrid grey wolf optimizer and Firefly Algorithm (FA) with Particle Swarm Optimization operators for optimization of power allocation in TVWS network power allocation as a continuous optimization problem. Matlab was used for simulation. The hybrid of GWO, FA and PSO (HFAGWOPSO) reduces sum power by 81.42% compared to GWO and improves sum throughput by 16.41% when compared to GWO. Simulation results also show that the algorithm has better convergence rate.

Chaos-Enhanced Firefly Algorithm with Automatic Parameter Tuning

2011 ◽  
Vol 2 (4) ◽  
pp. 1-11 ◽  
Author(s):  
Xin-She Yang
Keyword(s):  
Particle Swarm Optimization ◽  
Design Problem ◽  
Firefly Algorithm ◽  
Parameter Tuning ◽  
Population Based ◽  
Metaheuristic Algorithms ◽  
Metaheuristic Algorithm ◽  
Swarm Optimization ◽  
New Algorithms ◽  
Automatic Parameter Tuning

Many metaheuristic algorithms are nature-inspired, and most are population-based. Particle swarm optimization is a good example as an efficient metaheuristic algorithm. Inspired by PSO, many new algorithms have been developed in recent years. For example, firefly algorithm was inspired by the flashing behaviour of fireflies. In this paper, the author extends the standard firefly algorithm further to introduce chaos-enhanced firefly algorithm with automatic parameter tuning, which results in two more variants of FA. The author first compares the performance of these algorithms, and then uses them to solve a benchmark design problem in engineering. Results obtained by other methods will be compared and analyzed.

Sign in / Sign up

Export Citation Format

Share Document