Now showing items 1-5 of 5
On the symmetry of the Quadratic Assignment Problem through Elementary Landscape Decomposition
When designing meta-heuristic strategies to optimize the quadratic assignment problem (QAP), it is important to take into account the specific characteristics of the instance to be solved. One of the characteristics that ...
Journey to the center of the linear ordering problem
A number of local search based algorithms have been designed to escape from the local optima, such as, iterated local search or variable neighborhood search. The neighborhood chosen for the local search as well as the ...
Anatomy of the attraction basins: Breaking with the intuition
olving combinatorial optimization problems efficiently requires the development of algorithms that consider the specific properties of the problems. In this sense, local search algorithms are designed over a neighborhood ...
Characterising the rankings produced by combinatorial optimisation problems and finding their intersections
The aim of this paper is to introduce the concept of intersection between combinatorial optimisation problems. We take into account that most algorithms, in their machinery, do not consider the exact objective function ...
Estimating attraction basin sizes
The performance of local search algorithms is influenced by the properties that the neighborhood imposes on the search space. Among these properties, the number of local optima has been traditionally considered as a ...