The quadratic assignment problem (QAP) is a well‐known challenging combinatorial
optimization problem that has received many researchers' attention with varied real‐world …

Abstract The Quadratic Assignment Problem (QAP) is a combinatorial NP-hard optimization
problem that is not solvable in a polynomial time. It has a large number of real-world …

Many real world optimization problems are formulated as mixed-variable optimization
problems (MVOPs) which involve both continuous and discrete variables. MVOPs including …

Grouping problems aim to partition a set of items into multiple mutually disjoint subsets
according to some specific criterion and constraints. Grouping problems cover a large class …

Traffic offloading in cellular networks is considered an evolving application of unmanned
aerial vehicles (UAVs). UAVs have attractive characteristics for this application, such as the …

The quadratic assignment problem (QAP) is an NP-hard problem with a wide range of
applications in many real-world applications. This study introduces a discrete rat swarm …

The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization
problems and is known for its diverse applications. The QAP is an NP-hard optimization …

We propose and develop an improved version of antlion optimizer (ALO), namely
tournament selection based antlion optimization algorithm for quadratic assignment problem …

Differential evolution is primarily designed and used to solve continuous optimization
problems. Therefore, it has not been widely considered as applicable for real-world …

This paper proposes a new generalized two dimensional learning approach for particle
swarm based feature selection. The core idea of the proposed approach is to include the …