13 search results - page 2 / 3 » A branch-and-cut algorithm for the undirected selective trav... |
CAAN
2006
Springer
13 years 10 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...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
Abstract-- In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. Th...