Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
From MaRDI portal
Publication:5278229
DOI10.1111/itor.12282zbMath1366.90182MaRDI QIDQ5278229
Nenad Mladenović, Saïd Hanafi, Pierre Hansen, Anis Mjirda, Raca Todosijević
Publication date: 13 July 2017
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12282
TSP; variable neighborhood search; empirical study; variable neighborhood descent; neighborhood structures
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, Variable neighborhood search accelerated column generation for the nurse rostering problem, Empirical study of variable neighbourhood search applied to the optimization of the internal delivery vehicles at maritime container terminals, Computation of optimum type-II progressively hybrid censoring schemes using variable neighborhood search algorithm, Variable neighborhood search: basics and variants, Solving the maximum min-sum dispersion by alternating formulations of two different problems, Less is more: general variable neighborhood search for the capacitated modular hub location problem, A parallel variable neighborhood search for solving covering salesman problem, An efficient heuristic for a hub location routing problem, A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning, Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem, A survey on the applications of variable neighborhood search algorithm in healthcare management, Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines, A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem, Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
Uses Software
Cites Work
- Variable neighbourhood search: methods and applications
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Variable neighborhood search
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- First vs. best improvement: an empirical study
- TSPLIB—A Traveling Salesman Problem Library
