An efficient GVNS for solving Traveling Salesman Problem with Time Windows

DOI10.1016/j.endm.2012.10.012zbMath1268.90067OpenAlexW1973780173MaRDI QIDQ2840756

Dragan Urošević, Nenad Mladenović, Raca Todosijević

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.012

zbMATH Keywords

traveling salesman problemtime windowGVNS

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Multi-objective vehicle routing and loading with time window constraints: a real-life application, Variable neighborhood search for the travelling deliveryman problem, An efficient heuristic for a hub location routing problem, Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection

Cites Work

• Unnamed Item
• A general VNS heuristic for the traveling salesman problem with time windows
• Variable neighborhood search
• Beam-ACO for the travelling salesman problem with time windows
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• A New Heuristic for the Traveling Salesman Problem with Time Windows
• A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows