Binary bat algorithm

S Mirjalili, SM Mirjalili, XS Yang - Neural Computing and Applications, 2014 - Springer
Bat algorithm (BA) is one of the recently proposed heuristic algorithms imitating the
echolocation behavior of bats to perform global optimization. The superior performance of …

S-shaped versus V-shaped transfer functions for binary particle swarm optimization

S Mirjalili, A Lewis - Swarm and Evolutionary Computation, 2013 - Elsevier
Abstract Particle Swarm Optimization (PSO) is one of the most widely used heuristic
algorithms. The simplicity and inexpensive computational cost makes this algorithm very …

Binary optimization using hybrid particle swarm optimization and gravitational search algorithm

S Mirjalili, GG Wang, LS Coelho - Neural Computing and Applications, 2014 - Springer
The PSOGSA is a novel hybrid optimization algorithm, combining strengths of both particle
swarm optimization (PSO) and gravitational search algorithm (GSA). It has been proven that …

New binary bat algorithm for solving 0–1 knapsack problem

RM Rizk-Allah, AE Hassanien - Complex & Intelligent Systems, 2018 - Springer
This paper presents a novel binary bat algorithm (NBBA) to solve 0–1 knapsack problems.
The proposed algorithm combines two important phases: binary bat algorithm (BBA) and …

An improved adaptive binary harmony search algorithm

L Wang, R Yang, Y Xu, Q Niu, PM Pardalos, M Fei - Information Sciences, 2013 - Elsevier
Harmony Search (HS), inspired by the music improvisation process, is a new meta-heuristic
optimization method and has been successfully used to tackle the optimization problems in …

A binary social spider algorithm for uncapacitated facility location problem

E Baş, E Ülker - Expert Systems with Applications, 2020 - Elsevier
In order to find efficient solutions to real complex world problems, computer sciences and
especially heuristic algorithms are often used. Heuristic algorithms can give optimal …

A simplified binary harmony search algorithm for large scale 0–1 knapsack problems

X Kong, L Gao, H Ouyang, S Li - Expert Systems with Applications, 2015 - Elsevier
As an important subset of combinatorial optimization, 0–1 knapsack problems, especially the
high-dimensional ones, are often difficult to solve. This study aims to provide a new …

A self-adaptive binary differential evolution algorithm for large scale binary optimization problems

A Banitalebi, MI Abd Aziz, ZA Aziz - Information Sciences, 2016 - Elsevier
This study proposes a new self-adaptive binary variant of a differential evolution algorithm,
based on measure of dissimilarity and named SabDE. It uses an adaptive mechanism for …

Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm

X Kong, L Gao, H Ouyang, S Li - Computers & Operations Research, 2015 - Elsevier
Harmony search (HS) is a meta-heuristic method that has been applied widely to continuous
optimization problems. In this study, a new binary coded version of HS, named NBHS, is …

How important is a transfer function in discrete heuristic algorithms

S Saremi, S Mirjalili, A Lewis - Neural Computing and Applications, 2015 - Springer
Transfer functions are considered the simplest and cheapest operators in designing discrete
heuristic algorithms. The main advantage of such operators is the maintenance of the …