A general VNS heuristic for the traveling salesman problem with time windows
From MaRDI portal
Publication:429659
DOI10.1016/J.DISOPT.2010.04.002zbMATH Open1241.90130OpenAlexW2050817363MaRDI QIDQ429659FDOQ429659
Authors: Rodrigo Ferreira da Silva, Sebastián Urrutia 
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
Recommendations
- An efficient general variable neighborhood search for large travelling salesman problem with time windows
- An efficient GVNS for solving traveling salesman problem with time windows
- Variable neighborhood search for vehicle routing problem with multiple time windows
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- A generalized insertion heuristic for the travelling salesman problem with time windows
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Optimization by simulated annealing
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search
- TTT plots: a perl program to create time-to-target plots
- Title not available (Why is that?)
- 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
- A generalized insertion heuristic for the travelling salesman problem with time windows
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- A compressed-annealing heuristic 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
- Primal-dual variable neighborhood search for the simple plant-location problem
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
Cited In (27)
- A comprehensive survey on the generalized traveling salesman problem
- Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
- Variable neighborhood search for vehicle routing problem with multiple time windows
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- A generalized insertion heuristic for the travelling salesman problem with time windows
- A compressed-annealing heuristic for the traveling salesman problem with time windows
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework
- A variable neighborhood search heuristic for the maximum ratio clique problem
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows
- Variable neighbourhood structures for cycle location problems
- Scheduled penalty variable neighborhood search
- Two level general variable neighborhood search for attractive traveling salesman problem
- A metaheuristic for the delivery man problem with time windows
- A hybrid mathematical model for flying sidekick travelling salesman problem with time windows
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- A new heuristic for the traveling salesman problem with time windows.
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- An efficient general variable neighborhood search for large travelling salesman problem with time windows
- Deep policy dynamic programming for vehicle routing problems
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- An efficient GVNS for solving traveling salesman problem with time windows
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- Title not available (Why is that?)
- The hybrid electric vehicle-traveling salesman problem with time windows
Uses Software
This page was built for publication: A general VNS heuristic for the traveling salesman problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429659)
