An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows

From MaRDI portal
Revision as of 02:21, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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)




Related Items (21)

The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memoryNested general variable neighborhood search for the periodic maintenance problemScheduled penalty variable neighborhood searchTwo level general variable neighborhood search for attractive traveling salesman problemSkewed general variable neighborhood search for the location routing scheduling problemA general variable neighborhood search for the swap-body vehicle routing problemTwo multi-start heuristics for the \(k\)-traveling salesman problemA general variable neighborhood search variants for the travelling salesman problem with draft limitsA general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problemNew heuristic for harmonic means clusteringMulti‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristicA general variable neighborhood search for the traveling salesman problem with time windows under various objectivesVariable neighborhood search: basics and variantsSolving the traveling repairman problem with profits: a novel variable neighborhood search approachA new local search for continuous location problemsAn efficient heuristic for a hub location routing problemA heuristic hybrid framework for vector job schedulingVariable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup timesIntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problemIterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent versionVariable 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