M. Gendreau

Publications
Influence

A tabu search heuristic for periodic and multi-depot vehicle routing problems

J. Cordeau, M. Gendreau, G. Laporte
Mathematics
1 September 1997

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 vehicle… Expand

Vehicle dispatching with time-dependent travel times

S. Ichoua, M. Gendreau, J. Potvin
Computer Science
Eur. J. Oper. Res.
16 January 2003

In this paper, we present a model based on time-dependent travel speeds which satisfies the “first-in–first-out” property. Expand

An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

D. Feillet, P. Dejax, M. Gendreau, Cyrille Gueguen
Mathematics, Computer Science
Networks
1 October 2004

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

Hyper-heuristics: a survey of the state of the art

E. Burke, M. Gendreau, +4 authors R. Qu
Computer Science
J. Oper. Res. Soc.
1 December 2013

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

Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

O. Bräysy, M. Gendreau
Computer Science
Transp. Sci.
1 February 2005

This paper presents a survey of the research on the vehicle routing problem with time windows (VRPTW). Expand

A review of dynamic vehicle routing problems

Victor Pillac, M. Gendreau, C. Guéret, A. Medaglia
Computer Science
Eur. J. Oper. Res.
16 February 2013

A number of technological advances have led to a renewed interest in dynamic vehicle routing problems. Expand

A guide to vehicle routing heuristics

J. Cordeau, M. Gendreau, G. Laporte, J. Potvin, F. Semet
Computer Science
J. Oper. Res. Soc.
1 May 2002

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

A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows

É. Taillard, Philippe Badeau, M. Gendreau, F. Guertin, J. Potvin
Computer Science
Transp. Sci.
1 May 1997

This paper describes a tabu search heuristic for vehicle routing problem with soft time windows. Expand

Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching

M. Gendreau, F. Guertin, J. Potvin, É. Taillard
Engineering, Computer Science
Transp. Sci.
1 April 1999

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

Combinatorial auctions

Jawad Abrache, T. Crainic, M. Gendreau, Monia Rekik
Computer Science
Ann. Oper. Res.
2007

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

Recommended Authors