A general VNS heuristic for the traveling salesman problem with time windows
From MaRDI portal
Publication:429659
DOI10.1016/j.disopt.2010.04.002zbMath1241.90130OpenAlexW2050817363MaRDI QIDQ429659
Sebastián Urrutia, Rodrigo Ferreira da Silva
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.04.002
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (18)
Scheduled penalty variable neighborhood search ⋮ A variable neighborhood search heuristic for the maximum ratio clique problem ⋮ Deep policy dynamic programming for vehicle routing problems ⋮ The hybrid electric vehicle-traveling salesman problem with time windows ⋮ Variable neighbourhood structures for cycle location problems ⋮ Exact and anytime approach for solving the time dependent traveling salesman problem with time windows ⋮ Multi-objective vehicle routing and loading with time window constraints: a real-life application ⋮ A general variable neighborhood search for the traveling salesman problem with time windows under various objectives ⋮ Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework ⋮ A hybrid mathematical model for flying sidekick travelling salesman problem with time windows ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ A variable iterated greedy algorithm for the traveling salesman problem with time windows ⋮ Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks ⋮ New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times ⋮ A metaheuristic for the delivery man problem with time windows ⋮ An efficient GVNS for solving Traveling Salesman Problem with Time Windows ⋮ Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection ⋮ Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search
- TTT plots: a perl program to create time-to-target plots
- A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- A New Heuristic for the Traveling Salesman Problem with Time Windows
- A Hybrid Exact Algorithm for the TSPTW
- A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
This page was built for publication: A general VNS heuristic for the traveling salesman problem with time windows
