The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
This paper presents HyFlex, a software framework for the development of cross-domain search methodologies. The framework features a common software interface for dealing with diff...
Gabriela Ochoa, Matthew R. Hyde, Timothy Curtois, ...
In this paper we report on a study in which genetic algorithms are applied to the analysis of noisy time-series signals, which is related to the problem of analyzing the motion ch...
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...