3 search results - page 1 / 1 » An Improved Adaptive Multi-Start Approach to Finding Near-Op... |
GECCO
2000
Springer
13 years 10 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...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded lo...
VLDB
2004
ACM
14 years 7 days ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...