An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
From MaRDI portal
Publication:5420849
DOI10.2298/YJOR120530015MzbMath1299.90417MaRDI QIDQ5420849
Dragan Urošević, Raca Todosijević, Nenad Mladenović
Publication date: 13 June 2014
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory ⋮ Nested general variable neighborhood search for the periodic maintenance problem ⋮ Scheduled penalty variable neighborhood search ⋮ Two level general variable neighborhood search for attractive traveling salesman problem ⋮ Skewed general variable neighborhood search for the location routing scheduling problem ⋮ 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 ⋮ New heuristic for harmonic means clustering ⋮ Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic ⋮ A general variable neighborhood search for the traveling salesman problem with time windows under various objectives ⋮ Variable neighborhood search: basics and variants ⋮ Solving the traveling repairman problem with profits: a novel variable neighborhood search approach ⋮ A new local search for continuous location problems ⋮ An efficient heuristic for a hub location routing problem ⋮ A heuristic hybrid framework for vector job scheduling ⋮ Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times ⋮ IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem ⋮ Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version ⋮ Variable neighborhood search for minimum sum-of-squares clustering on networks
This page was built for publication: An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
