• Publications
  • Influence
Vehicle dispatching with time-dependent travel times
TLDR
In this paper, we present a model based on time-dependent travel speeds which satisfies the “first-in–first-out” property. Expand
  • 502
  • 63
  • PDF
A guide to vehicle routing heuristics
TLDR
Several of the most important classical and modern heuristics for the vehicle routing problem are summarized and compared using four criteria: accuracy, speed, simplicity and flexibility. Expand
  • 581
  • 42
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
TLDR
This paper describes a tabu search heuristic for vehicle routing problem with soft time windows. Expand
  • 926
  • 41
  • PDF
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
TLDR
A tabu search heuristic, initially designed for the static version of the problem, has been adapted to the dynamic case and implemented on a parallel platform to increase the computational effort. Expand
  • 436
  • 38
  • PDF
Handbook of Metaheuristics
TLDR
The first edition of the Handbook of Metaheuristics was published in 2003 under the editorship of Fred Glover and Gary A. Kochenberger. Expand
  • 984
  • 37
The Vehicle Routing Problem with Time Windows Part II: Genetic Search
TLDR
This paper is the second part of a work on the application of new search techniques for the vehicle routing problem with time windows. Expand
  • 407
  • 37
  • PDF
A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
TLDR
This paper describes an insertion algorithm for the Vehicle Routing and Scheduling Problem with Time Windows (VRSPTW) that builds routes in parallel and uses a generalized regret measure to select the next candidate for insertion. Expand
  • 411
  • 30
Genetic algorithms for the traveling salesman problem
  • J. Potvin
  • Computer Science
  • Ann. Oper. Res.
  • 1 June 1996
TLDR
This paper is a survey of genetic algorithms for the traveling salesman problem. Expand
  • 516
  • 24
  • PDF
Vehicle Routing
  • J. Potvin
  • Computer Science
  • Encyclopedia of Optimization
  • 2009
  • 293
  • 24
  • PDF
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
TLDR
We introduce a branch-and-price approach to address this problem where lower bounds are computed by solving the linear programming relaxation of a set packing formulation, using column generation. Expand
  • 203
  • 21