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 …

With the process of urbanization, the problem of insufficient parking spaces has become
prominent. Adopting a high-density parking lot with parking robots can greatly improve the …

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 …

Metaheuristics have been showing interesting results in solving hard optimization problems.
However, they become limited in terms of effectiveness and runtime for high dimensional …

This paper presents a fine-grained parallel genetic algorithm improved with a 2-opt heuristic
for finding solutions near to the optimum to the Quadratic Assignment Problem (QAP). The …

Quadratic image filter involves the second-order multiplications of an input image mask in
addition to linear terms, and determining the weights of the quadratic filter using optimization …

Since the Compute Unified Device Architecture (CUDA) has been proposed, some swarm
intelligence algorithms were migrated to the GPU. The release of the Fermi architecture …

The existing facility layout problem (FLP) only considers the layout of processing facilities.
However, in the current scenario of industrial logistics, there are not only working facilities …

This article presents an implementation of a cellular parallel genetic algorithm and a local
optimization heuristic to solve the Quadratic Assignment Problem (QAP). First, we …

Este trabajo consiste en implementar un algoritmo genético paralelo de grano fino mejorado
con una heurística 2-opt voraz para encontrar soluciones cercanas al óptimo al problema de …