Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
From MaRDI portal
Publication:5278229
DOI10.1111/itor.12282zbMath1366.90182OpenAlexW2336420787MaRDI 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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
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, 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, Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits, Variable neighborhood search for the single machine scheduling problem to minimize the total early work, General variable neighborhood search for the parallel machine scheduling problem with two common servers, Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem, Multiple traveling salesperson problem with drones: general variable neighborhood search approach, Heuristics for the capacitated dispersion problem, The uncapacitated r‐allocation p‐hub center problem, Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic, A variable neighborhood search for flying sidekick traveling salesman problem, VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties, Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach, Computation of optimum type-II progressively hybrid censoring schemes using variable neighborhood search algorithm, In-depth analysis of granular local search for capacitated vehicle routing, Variable neighborhood search: the power of change and simplicity, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, Variable neighborhood search: basics and variants, 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, 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, Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines, A parallel variable neighborhood search for solving covering salesman problem, An efficient heuristic for a hub location routing problem, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, Solving the traveling delivery person problem with limited computational time, A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
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
