Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- 6 April 2016
- journal article
- research article
- Published by Wiley in International Transactions in Operational Research
- Vol. 24 (3) , 615-633
Abstract
In a single local search algorithm, several neighborhood structures are usually explored. The simplest way is to define a single neighborhood as the union of all predefined neighborhood structures; the other possibility is to make an order (or sequence) of the predefined neighborhoods, and to use them in the first improvement or the best improvement fashion, following that order. In this work, first we classify possible variants of sequential use of neighborhoods and then, empirically analyze them in solving the classical traveling salesman problem (TSP). We explore the most commonly used TSP neighborhood structures, such as 2‐opt and insertion neighborhoods. In our empirical study, we tested 76 different such heuristics on 15,200 random test instances. Several interesting observations are derived. In addition, the two best of 76 heuristics (used as local searches within a variable neighborhood search) are tested on 23 test instances taken from the TSP library (TSPLIB). It appears that the union of neighborhoods does not perform well.Keywords
This publication has 11 references indexed in Scilit:
- A general variable neighborhood search for solving the uncapacitated $r$ r -allocation $p$ p -hub median problemOptimization Letters, 2015
- Multi-neighborhood tabu search for the maximum weight clique problemAnnals of Operations Research, 2012
- A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problemEuropean Journal of Operational Research, 2010
- Neighborhood analysis: a case study on curriculum-based course timetablingJournal of Heuristics, 2010
- Variable neighbourhood search: methods and applicationsAnnals of Operations Research, 2009
- First vs. best improvement: An empirical studyDiscrete Applied Mathematics, 2006
- Variable neighborhood searchComputers & Operations Research, 1997
- TSPLIB—A Traveling Salesman Problem LibraryINFORMS Journal on Computing, 1991
- Configuration space analysis of travelling salesman problemsJournal de Physique, 1985
- Individual Comparisons by Ranking MethodsBiometrics Bulletin, 1945