The quadratic assignment problem (QAP) has considered one of the most significant
combinatorial optimization problems due to its variant and significant applications in real life …

Parallel metaheuristics require programming languages that provide both, high performance
and a high level of programmability. This paper aims at providing a useful data point to help …

We present new improved algorithms for the sorting problem. The algorithms are not only
efficient but also clear and simple. First, we introduce Forward Radix Sort which combines …

Solving efficiently large benchmarks of NP-hard permutation-based problems requires the
development of hybrid methods combining different classes of optimization methods …

The quadratic 3-dimensional assignment problem (Q3AP) is an extension of the well-known
NP-hard quadratic assignment problem. It has been proved to be one of the most difficult …

On the one hand, surrogate-assisted evolutionary algorithms are established as a method of
choice for expensive black-box optimization problems. On the other hand, the growth in …

Parallel genetic algorithms (PGAs) have been used to improve the potential of genetic
algorithms, which are efficient search techniques that have been employed in producing …

A new memetic algorithm named EAMDGA is designed by combining the characteristics of
Environmental Adaption Method for Dynamic Environment (EAMD) and Genetic Algorithm …

Simulated annealing (SA) is a general-purpose optimization technique widely used in
various combinatorial optimization problems. However, the main drawback of this technique …

Abstract The Quadratic Assignment Problem (QAP) is one of the most challenging
combinatorial optimization problems with many real-life applications. Currently, the best …