Sciweavers

18 search results - page 1 / 4
» An effective implementation of the Lin-Kernighan traveling s...
Sort
View
EOR
2000
115views more  EOR 2000»
13 years 5 months ago
An effective implementation of the Lin-Kernighan traveling salesman heuristic
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric travel...
Keld Helsgaun
IPPS
2005
IEEE
13 years 10 months ago
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
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...
Thomas Fischer, Peter Merz
EVOW
2006
Springer
13 years 8 months ago
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
Yuichi Nagata
IMCSIT
2010
13 years 2 months ago
Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
Sorin Ilie, Costin Badica