Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks

2017 ◽  
pp. 254-262 ◽  
Author(s):  
Natashia Boland ◽  
Mike Hewitt ◽  
Duc Minh Vu ◽  
Martin Savelsbergh
Keyword(s):  
Traveling Salesman Problem ◽  
Time Windows ◽  
Traveling Salesman ◽  
Time Expanded Networks ◽  
The Traveling Salesman Problem

scholarly journals An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

1995 ◽  
Vol 43 (2) ◽  
pp. 367-371 ◽  
Author(s):  
Yvan Dumas ◽  
Jacques Desrosiers ◽  
Eric Gelinas ◽  
Marius M. Solomon
Keyword(s):  
Traveling Salesman Problem ◽  
Optimal Algorithm ◽  
Time Windows ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem

A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

1998 ◽  
Vol 46 (3) ◽  
pp. 330-335 ◽  
Author(s):  
Michel Gendreau ◽  
Alain Hertz ◽  
Gilbert Laporte ◽  
Mihnea Stan
Keyword(s):  
Traveling Salesman Problem ◽  
Time Windows ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem ◽  
Insertion Heuristic

scholarly journals Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows

Technologies ◽  
2019 ◽  
Vol 7 (3) ◽  
pp. 61 ◽  
Author(s):  
Christos Papalitsas ◽  
Theodore Andronikos
Keyword(s):  
Traveling Salesman Problem ◽  
Optimization Problems ◽  
Time Windows ◽  
Experimental Information ◽  
Traveling Salesman ◽  
Neighborhood Search ◽  
Np Hard ◽  
The Novel ◽  
Global Positioning ◽  
The Traveling Salesman Problem

GVNS, which stands for General Variable Neighborhood Search, is an established and commonly used metaheuristic for the expeditious solution of optimization problems that belong to the NP-hard class. This paper introduces an expansion of the standard GVNS that borrows principles from quantum computing during the shaking stage. The Traveling Salesman Problem with Time Windows (TSP-TW) is a characteristic NP-hard variation in the standard Traveling Salesman Problem. One can utilize TSP-TW as the basis of Global Positioning System (GPS) modeling and routing. The focus of this work is the study of the possible advantages that the proposed unconventional GVNS may offer to the case of garbage collector trucks GPS. We provide an in-depth presentation of our method accompanied with comprehensive experimental results. The experimental information gathered on a multitude of TSP-TW cases, which are contained in a series of tables, enable us to deduce that the novel GVNS approached introduced here can serve as an effective solution for this sort of geographical problems.

Sign in / Sign up

Export Citation Format

Share Document