599 search results - page 28 / 120 » The traveling salesman problem |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this, [1]...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Given an evolutionary algorithm for a problem and an instance of the problem, the results of several trials of the EA on the instance constitute a sample from the distrib...
CAAN
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...