The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

By Paolo Toth, Daniele Vigo. INFORMS journal on computing, 2003

608 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering, Signal Processing

View Paper: https://www.semanticscholar.org/paper/4f982e2a29134a3a54303c638ab47c66401f40c4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

In Signal Processing

Citations in the corpus

Heuristics for multi-attribute vehicle routing problems: A survey and synthesis (2013, methodology): “A common method, called granular search, requires computing for each node a list Γ( ) of spatially related neighbours, and only considering moves that involve and ∈ Γ( ) (Gendreau et al. 1992, Johnson and McGeoch 1997, Toth and Vigo 2003).”
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic (2007, methodology): “a cost smaller than (*d̃) are allowed, where * is a constant and d̃ is the average cost of the edges linking two customers in a good feasible solution, as suggested in Toth and Vigo (2003). This will result in the removal of the expensive edges that usually connect two very distant customers and tha”
A general heuristic for vehicle routing problems (2007, methodology): “TV—granular tabu search by Toth and Vigo [54], LGV—variable-length neighbor list record-to-record travel heuristic by Li et al.”
New Heuristics for the Vehicle Routing Problem (2005, methodology): “The granular tabu search (GTS) algorithm put forward by Toth and Vigo (2003) a priori removes from the graph edges that are unlikely to appear in an optimal VRP solution, with the aim of curtailing computation time.”
Energy Minimizing Vehicle Routing Problem (2007, methodology): “procedures for the EMVRP like heuristics proposed for CVRP (Gendreau, et al. [7], Toth and Vigo [ 18 ]).”
The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations (2014, methodology): “In each iteration, the composite neighborhood N (S) of TS is generated by applying the following neighborhood operators on every arc in the list of generator arcs (cp. Toth and Vigo 2003): 2-opt*, relocate, exchange and a new, problem-specific operator called stationInRe.”
Metaheuristics in Combinatorial Optimization (2005, background): “Another example of this new trend is the granular TS (Toth and Vigo, 2003).”
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (2007, background): “[27], and Toth and Vigo [28].”
What you should know about the vehicle routing problem (2007, methodology): “For reviews, see Laporte and Nobert [36] and Toth and Vigo [58].”
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (2013, background): “The parameter values from Vidal et al. (2011b) were shown to perform well on a large range of VRP variants.”
Models, relaxations and exact approaches for the capacitated vehicle routing problem (2002, methodology): “The Fischetti et al. algorithm (FTV) at each node of the branch-decision tree uses a heuristic algorithm proposed by Vigo [47] which starts from the infeasible solution associated with the current relaxation and tries to obtain a feasible solution through an insertion procedure and a post-optimizati”
Routing a mixed fleet of electric and conventional vehicles (2015, background): “Moves are realized by means of the generator arc principle introduced in (Toth and Vigo 2003).”
An artificial bee colony algorithm for the capacitated vehicle routing problem (2011, methodology): “Granular tabu search (Toth and Vigo, 2003) restricts the neighborhood size by removing edges from the graph that are unlikely to appear in an optimal solution.”