242 search results - page 32 / 49 » Approximation Algorithms for Multi-Criteria Traveling Salesm... |
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
68
Voted
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
104
click to vote
CIAC
2003
Springer
15 years 1 months ago
2003
Springer
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
66
Voted
GECCO
2005
Springer
15 years 3 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
2007
Springer
14 years 9 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 ...