613 search results - page 17 / 123 » Generalized Traveling Salesman Problem Reduction Algorithms |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
IJCAI
2003
13 years 9 months ago
2003
We empirically study phase transitions of the asymmetric Traveling Salesman. Using random instances of up to 1,500 cities, we show that many properties of the problem, including t...
EMO
2003
Springer
14 years 23 days ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
ICEC
1996
13 years 8 months ago
1996
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...