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 The Set Covering Problem (SCP) is one of the classical Karp's 21 NP-complete
problems. Although this is a traditional optimization problem, we find many papers assuming …

Feature selection is an important method to reduce the number of attributes of high-
dimensional data and an essential preprocess work in classification. It eliminates irrelevant …

To locate the damage of the structure efficiently and judge the damage degree, this paper
proposes an improved fruit fly optimization algorithm (IFOA). Aiming at the problem of poor …

Currently, the industry is experiencing an exponential increase in dealing with binary-based
combinatorial problems. In this sense, metaheuristics have been a common trend in the field …

The set covering problem (SCP) is an NP‐complete optimization problem, fitting with many
problems in engineering. The traditional SCP formulation does not directly address both …

In order to find a more effective method for the structural optimization, an improved fruit fly
Optimization Algorithm was proposed. The dynamic adjustment search, the inertia weight …

Using the approximate algorithms, we are faced with the problem of determining the
appropriate values of their input parameters, which is always a complex task and is …

The set covering problem (SCP) has quite a large coefficient matrix in practical problems,
but due to its low density, most of its entries are zero. Drawing on this observation, some …

Abstract The Soccer League Competition algorithm (SLC) is a new nature-based
metaheuristic approach to solve optimization problems. It gets its basis model from the …