-
- Pascal Kerschke
- Information Systems and Statistics, University of Münster, 48149 Münster, Germany
-
- Lars Kotthoff
- Department of Computer Science, University of British Columbia, Vancouver, B.C., V6T 1Z4, Canada
-
- Jakob Bossek
- Information Systems and Statistics, University of Münster, 48149 Münster, Germany
-
- Holger H. Hoos
- Department of Computer Science, University of British Columbia, Vancouver, B.C., V6T 1Z4, Canada
-
- Heike Trautmann
- Information Systems and Statistics, University of Münster, 48149 Münster, Germany
書誌事項
- 公開日
- 2018-12
- DOI
-
- 10.1162/evco_a_00215
- 公開者
- MIT Press - Journals
この論文をさがす
説明
<jats:p> The Travelling Salesperson Problem (TSP) is one of the best-studied NP-hard problems. Over the years, many different solution approaches and solvers have been developed. For the first time, we directly compare five state-of-the-art inexact solvers—namely, LKH, EAX, restart variants of those, and MAOS—on a large set of well-known benchmark instances and demonstrate complementary performance, in that different instances may be solved most effectively by different algorithms. We leverage this complementarity to build an algorithm selector, which selects the best TSP solver on a per-instance basis and thus achieves significantly improved performance compared to the single best solver, representing an advance in the state of the art in solving the Euclidean TSP. Our in-depth analysis of the selectors provides insight into what drives this performance improvement. </jats:p>
収録刊行物
-
- Evolutionary Computation
-
Evolutionary Computation 26 (4), 597-620, 2018-12
MIT Press - Journals
