Name
Abstract | ||
|---|---|---|
We introduce a reduction technique for the well-known TSP. The basic idea of the approach consists of transforming a TSP instance to another one with smaller size by contracting pseudo backbone edges computed in a preprocessing step, where pseudo backbone edges are edges which are likely to be in an optimal tour. A tour of the small instance can be re-transformed to a tour of the original instance. We experimentally investigated TSP benchmark instances by our reduction technique combined with the currently leading TSP heuristic of Helsgaun. The results strongly demonstrate the effectivity of this reduction technique: for the six VLSI instances xvb13584 , pjh17845 , fnc19402 , ido21215 , boa28924 , and fht47608 we could set world records, i.e., find better tours than the best tours known so far. The success of this approach is mainly due to the effective reduction of the problem size so that we can search the more important tour subspace more intensively. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02158-9_16 | AAIM |
Keywords | Field | DocType |
tsp heuristic,better tour,effective tour searching,well-known tsp,tsp instance,optimal tour,reduction technique,important tour subspace,effective reduction,best tour,tsp benchmark instance,pseudo backbone edges,discrete mathematics | Combinatorics,Heuristic,Mathematical optimization,Subspace topology,Computer science,Algorithm,Preprocessor,Very-large-scale integration | Conference |
Volume | ISSN | Citations |
5564 | 0302-9743 | 5 |
PageRank | References | Authors |
0.46 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Dong | 1 | 13 | 1.95 |
| Gerold Jäger | 2 | 113 | 14.66 |
| Dirk Richter | 3 | 23 | 2.27 |
| P. Molitor | 4 | 211 | 18.50 |