• Publications
  • Influence
A tabu search heuristic for periodic and multi-depot vehicle routing problems
We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicleExpand
  • 648
  • 68
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
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
TLDR
We propose an exact solution procedure for the Elementary Shortest Path Problem with Resource Constraints, which extends the classical label correcting algorithm originally developed for the relaxed (nonelementary) path version of this problem. Expand
  • 572
  • 60
  • PDF
Hyper-heuristics: a survey of the state of the art
TLDR
Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the goal of automating the design of heuristic methods to solve hard computational search problems. Expand
  • 776
  • 59
  • PDF
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
TLDR
This paper presents a survey of the research on the vehicle routing problem with time windows (VRPTW). Expand
  • 965
  • 58
  • PDF
A review of dynamic vehicle routing problems
TLDR
A number of technological advances have led to a renewed interest in dynamic vehicle routing problems. Expand
  • 812
  • 55
  • 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
Combinatorial auctions
TLDR
We discuss the formulation of the winner determination problem, the expression of combined bids, the design of progressive combinatorial auctions that require less information revelation, and the need for decision support tools. Expand
  • 452
  • 38
  • PDF