A general VNS heuristic for the traveling salesman problem with time windows

DOI10.1016/J.DISOPT.2010.04.002MaRDI QIDQ429659zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heuristicstime windowsvariable neighborhood searchtraveling salesmanvariable neighborhood descent

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• A compressed-annealing heuristic for the traveling salesman problem with time windows
• A generalized insertion heuristic for the travelling salesman problem with time windows
• A hybrid exact algorithm for the TSPTW
• A new heuristic for the traveling salesman problem with time windows.
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
• An exact constraint logic programming algorithm for the traveling salesman problem with time windows
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Optimization by simulated annealing
• Primal-dual variable neighborhood search for the simple plant-location problem
• TTT plots: a perl program to create time-to-target plots
• Variable neighborhood search
• Variable neighbourhood search: Methods and applications

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
• Deep policy dynamic programming for vehicle routing problems
• An efficient general variable neighborhood search for large travelling salesman problem with time windows
• 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
• The hybrid electric vehicle-traveling salesman problem with time windows
• scientific article; zbMATH DE number 2202185 (Why is no real title available?)

Describes a project that uses

Uses Software

• TTTPLOTS
• TSPTW
• PERL

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)