[PDF][PDF] A review of population-based meta-heuristic algorithms

Z Beheshti, SMH Shamsuddin - Int. j. adv. soft comput. appl, 2013‏ - academia.edu
Exact optimization algorithms are not able to provide an appropriate solution in solving
optimization problems with a high-dimensional search space. In these problems, the search …

A review of particle swarm optimization

NK Jain, U Nangia, J Jain - Journal of The Institution of Engineers (India) …, 2018‏ - Springer
This paper presents an overview of the research progress in Particle Swarm Optimization
(PSO) during 1995–2017. Fifty two papers have been reviewed. They have been …

New binary whale optimization algorithm for discrete optimization problems

AG Hussien, AE Hassanien, EH Houssein… - Engineering …, 2020‏ - Taylor & Francis
The whale optimization algorithm (WOA) is an intelligence-based technique that simulates
the hunting behaviour of humpback whales in nature. In this article, an adaptation of the …

A wrapper‐based feature selection for improving performance of intrusion detection systems

M Samadi Bonab, A Ghaffari… - International Journal …, 2020‏ - Wiley Online Library
Along with expansion in using of Internet and computer networks, the privacy, integrity, and
access to digital resources have been faced with permanent risks. Due to the unpredictable …

A binary moth search algorithm based on self-learning for multidimensional knapsack problems

Y Feng, GG Wang - Future Generation Computer Systems, 2022‏ - Elsevier
A key issue for moth search algorithm (MS) is the ability to maintain sufficient diversity in the
population so as to be able to track a dynamically changing landscape. However, for the …

Memory based hybrid crow search algorithm for solving numerical and constrained global optimization problems

M Braik, H Al-Zoubi, M Ryalat, A Sheta… - Artificial Intelligence …, 2023‏ - Springer
Abstract Crow Search Algorithm (CSA) is a promising meta-heuristic method developed
based on the intelligent conduct of crows in nature. This algorithm lacks a good …

A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO

MJ Islam, X Li, Y Mei - Applied Soft Computing, 2017‏ - Elsevier
Many real-world problems belong to the family of discrete optimization problems. Most of
these problems are NP-hard and difficult to solve efficiently using classical linear and …

A hybrid quantum particle swarm optimization for the multidimensional knapsack problem

B Haddar, M Khemakhem, S Hanafi… - Engineering Applications of …, 2016‏ - Elsevier
In this paper we propose a new hybrid heuristic approach that combines the Quantum
Particle Swarm Optimization technique with a local search method to solve the …

Memetic binary particle swarm optimization for discrete optimization problems

Z Beheshti, SM Shamsuddin, S Hasan - Information Sciences, 2015‏ - Elsevier
In recent decades, many researchers have been interested in algorithms inspired by the
observation of natural phenomena to solve optimization problems. Among them, meta …

A time-varying mirrored S-shaped transfer function for binary particle swarm optimization

Z Beheshti - Information Sciences, 2020‏ - Elsevier
Binary Particle swarm optimization (BPSO) is one of the most popular swarm intelligence
algorithms to solve binary optimization problems. It has a few parameters, simple structure …