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

Authors:
Rodrigo Ferreira Da Silva;SebastiáN Urrutia
Affiliations:
Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antônio Carlos 6627, Belo Horizonte, MG, 31270-010, Brazil;Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antônio Carlos 6627, Belo Horizonte, MG, 31270-010, Brazil
Venue:
Discrete Optimization
Year:
2010

Citing 8
Cited 1

New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
Variable neighborhood search

Computers and Operations Research
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

Operations Research
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows

Transportation Science
A New Heuristic for the Traveling Salesman Problem with Time Windows

Transportation Science
A Hybrid Exact Algorithm for the TSPTW

INFORMS Journal on Computing
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows

INFORMS Journal on Computing
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem

INFORMS Journal on Computing

The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a General Variable Neighborhood Search (GVNS) heuristic for the Traveling Salesman Problem with Time Windows (TSPTW). The heuristic is composed by both constructive and optimization stages. In the first stage, the heuristic constructs a feasible solution using VNS, and in the optimization stage the heuristic improves the feasible solution with a General VNS heuristic. Both constructive and optimization stages take advantage of elimination tests, partial neighbor evaluation and neighborhood partitioning techniques. Experimental results show that this approach is efficient, reducing significantly the computation time and improving some best known results from the literature.