Two level general variable neighborhood search for attractive traveling salesman problem
From MaRDI portal
Publication:337241
DOI10.1016/j.cor.2013.04.015zbMath1348.90113OpenAlexW2040532988MaRDI QIDQ337241
Dragan Urošević, Nenad Mladenović, Raca Todosijević
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.04.015
traveling salesman problemvariable neighborhood search2-level GVNSdemand allocationdemand attraction
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search ⋮ A general variable neighborhood search for the swap-body vehicle routing problem ⋮ Two multi-start heuristics for the \(k\)-traveling salesman problem ⋮ A general variable neighborhood search variants for the travelling salesman problem with draft limits ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems ⋮ Variable neighborhood search: basics and variants
Uses Software
Cites Work
- Unnamed Item
- Variable neighbourhood search: methods and applications
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- Variable neighbourhood search: Methods and applications
- The attractive traveling salesman problem
- Variable neighborhood search
- Gaussian variable neighborhood search for continuous optimization
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Variable neighborhood search for the travelling deliveryman problem
- Sum-of-squares clustering on networks
- TSPLIB—A Traveling Salesman Problem Library
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows