Sciweavers

38 search results - page 3 / 8
» A hybrid genetic algorithm and inver over approach for the t...
Sort
View
IPL
2008
114views more  IPL 2008»
13 years 5 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
13 years 9 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
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...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
APPROX
2008
Springer
124views Algorithms» more  APPROX 2008»
13 years 7 months ago
Deterministic 7/8-Approximation for the Metric Maximum TSP
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
Lukasz Kowalik, Marcin Mucha
ECML
2004
Springer
13 years 9 months ago
Population Diversity in Permutation-Based Genetic Algorithm
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...
Kenny Qili Zhu, Ziwei Liu
GECCO
2003
Springer
141views Optimization» more  GECCO 2003»
13 years 10 months ago
Finding the Optimal Gene Order in Displaying Microarray Data
The rapid advances of genome-scale sequencing have brought out the necessity of developing new data processing techniques for enormous genomic data. Microarrays, for example, can g...
Seung-Kyu Lee, Yong-Hyuk Kim, Byung Ro Moon