In the real world, there are a number of optimization problems whose search space is
restricted to take binary values; however, there are many continuous metaheuristics with …

Abstract Presently, the Cuckoo Search algorithm is attracting unprecedented attention from
the research community and applications of the algorithm are expected to increase in …

Adaptation and hybridization typically improve the performances of original algorithm. This
paper proposes a novel hybrid self-adaptive cuckoo search algorithm, which extends the …

The multidimensional knapsack problem (MKP) is one of the widely known integer
programming problems. The MKP has received significant attention from the operational …

The binarization of Swarm intelligence continuous metaheuristics is an area of great interest
in operations research. This interest is mainly due to the application of binarized …

The progress of metaheuristic techniques, big data, and the Internet of things generates
opportunities to performance improvements in complex industrial systems. This article …

The set covering problem seeks for minimum cost family of subsets from n given subsets,
which together covers the complete set. In this article, we present multi dynamic binary black …

The set covering problem is a classical optimization benchmark that finds application in
several real-world domains, particularly in line balancing production, crew scheduling, and …

The binarization of continuous swarm-intelligence metaheuristics is an area of great interest
in operational research. This interest is mainly due to the application of binarized …

One of the current problems in engineering is the collapse of bridges that cross rivers due to
the scour of their piers. This can lead to collapse and thus high costs associated with …