275 search results - page 28 / 55 » The Attractive Traveling Salesman Problem |
117
click to vote
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
GECCO
2004
Springer
15 years 3 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...
COCO
2006
Springer
15 years 1 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
2007
Springer
15 years 3 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]...
GECCO
2003
Springer
15 years 3 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...