33 search results - page 6 / 7 » The Asymmetric Traveling Salesman Problem: Algorithms, Insta... |
GECCO
2000
Springer
13 years 9 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...
MP
2007
13 years 5 months ago
2007
Abstract One method which has been used very successfully for finding optimal and provably good solutions for large instances of the Symmetric Travelling Salesman Problem (STSP) i...
HM
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
IWANN
2001
Springer
13 years 10 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
AAIM
2009
Springer
13 years 4 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...