A unified tabu search heuristic for vehicle routing problems with time windows

By Jean-François Cordeau, Gilbert Laporte, A. Mercier. Journal of the Operational Research Society, 2001

991 citations recorded by the source corpus.

Subfields: Automotive Engineering, Computer Vision and Pattern Recognition, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/c02ad0aeaf248a80d5e8a9fa8a2ff522afe1f466

How researchers see this paper

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

In Automotive Engineering

In Computer Vision and Pattern Recognition

In Industrial and Manufacturing Engineering

Citations in the corpus

Models for Evaluating and Planning City Logistics Systems (2009, methodology): “The Unified Tabu Search proposed by Cordeau et al. (2001) and the cooperative search of Le Bouthillier et al. (2005) illustrate this trend that we intend to follow for this problem.”
A general heuristic for vehicle routing problems (2007, background): “[17, 19]) consider heuristic s that “out-of-the-box” can be used to solve several problem types.”
A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem (2002, methodology): “The solution methodology is flexible and can easily be adapted to handle multiple depots or multiple vehicle types, by following the general framework used by Cordeau et al. (2001) for various vehicle routing problems with time windows.”
New Heuristics for the Vehicle Routing Problem (2005, methodology): “Local search includes descent algorithms (Ergun et al. (2003)), simulated annealing (Osman (1993)), deterministic annealing (Golden et al. (1998); Li et al. (2004)), tabu search (Osman (1993); Taillard (1993); Gendreau et al.”
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations (2016, neutral): “A general survey on the subject is provided in Sbihi and Eglese (2010) and Dekker et al. (2011). A recent discussion on electric vehicles for distribution goods is provided by Pelletier et al.”
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (2013, methodology): “UTS exploits long-term memories to penalize frequently-encountered solution features.”
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows (2006, methodology): “In Section 3 we introduce the term Adaptive Large Neighborhood Search (ALNS) to describe an algorithm using several large neighborhoods in an adaptive way.”
Metaheuristics in Combinatorial Optimization (2005, methodology): “Unified tabu search ( Cordeau, Laporte, and Mercier, 2001 ) represents a recent trend aimed at producing simpler, more flexible TS code.”
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (2007, neutral): “[27], and Toth and Vigo [28].”
What you should know about the vehicle routing problem (2007, background): “[12]): A set of attributes B(st ) = {(i, k) : i ∈ V \{0}, k = 1, 2, .”
Routing a mixed fleet of electric and conventional vehicles (2015, methodology): “The diversification penalty is based on the continuous diversification principle introduced in (Cordeau et al. 2001) and later adapted to the E-VRPTW by Schneider et al. (2014).”
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows (2003, methodology): “Special purpose surveys on the VRPTW can be found in Golden and Assad (1986), Desrochers et al. (1988), Golden and Assad (1988), Solomon and Desrosiers (1988), Desrosiers et al. (1995) and Cordeau et al. (2001).”
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics (2005, methodology): “The second objective is total traveled distance in Rochat and Taillard (1995), Taillard et al. (1997), Chiang and Russell (1997), Brandão (1999), Cordeau et al. (2001), and Lau et al. (2001, 2002).”
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows (2004, methodology): “These include simulated annealing (Chiang and Russell 1996), tabu search (Chiang and Russell 1997, Cordeau et al. 2001, De Backer et al. 2000, Rochat and Taillard 1995, Taillard et al. 1997), genetic/evolutionary algorithms (Gehring and Homberger 2001, Homberger and Gehring 1999, Potvin and Begio…”
Models and Tabu Search Heuristics for the Berth-Allocation Problem (2005, methodology): “Legato et al. (2001) have observed that the BAP can be modeled as an MDVRPTW, see, e.g., Cordeau et al. (2001).”