Gendreau Michel

Michel Gendreau

Information about the author Michel Gendreau will soon be added to the site.
Found 118 papers in total
A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
2001
This article proposes lower bounds, as well as a divide and merge heuristic for the...
A tabu search heuristic for periodic and multi-depot vehicle routing problems
1997
We propose a tabu search heuristic capable of solving three well-known routing...
Adaptive memory programming: a unified view of metaheuristics
2001
The paper analyses recent developments of a number of memory-based metaheuristics such...
A tabu search algorithm for the capacitated shortest spanning tree problem
1997
The Capacitated Shortest Scanning Tree Problem consists of determining a shortest...
Diversion issues in real-time vehicle dispatching
2000
Recent technological advances in communication systems now allow the exploitation of...
Classical and modern heuristics for the vehicle routing problem
2000
This article is a survey of heuristics for the Vehicle Routing Problem. It is divided...
A simplex-based tabu search method for capacitated network design
2000
The fixed charge capacitated multicommodity network design problem is a well-known...
Finding disjoint routes in telecommunications networks with two technologies
1999
We consider networks in which a cost is associated with each arc or edge and a...
Implicit enumeration of hyperpaths in a logit model for transit networks
1998
This paper investigates the application of a logit model to urban transit networks...
Parallel tabu search for real-time vehicle routing and dispatching
1999
An abundant literature about vehicle routing and scheduling problems is available in...
Heuristics for the location of inspection stations on a network
2000
This article considers the preventive flow interception problem (FIP) on a network....
An exact constraint logic programming algorithm for the travelling salesman problem with time windows
1998
This paper presents a constraint logic programming model for the traveling salesman...
The covering tour problem
1997
The Covering Tour Problem (CTP) is defined on a graph G = ( V ∪ W, E ),...
An approximation algorithm for the traveling salesman problem with backhauls
1997
The Traveling Salesman Problem with Backhauls (TSPB) is defined on a graph G =...
A tabu search heuristic for the vehicle routing problem with stochastic demands and customers
1996
This paper considers a version of the stochastic vehicle routing problem where...
On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
1999
One of the major strengths of Constraint Programming is the flexibility and...
Heuristics for the traveling salesman problem with pickup and delivery
1999
We consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD), an...
A tabu search heuristic for the heterogeneous fleet vehicle routing problem
1999
The Heterogeneous Fleet Vehicle Routing Problem (HVRP) is a variant of the classical...
A constraint programming framework for local search methods
1999
We propose in this paper a novel integration of local search algorithms within a...
A tabu search heuristic for the undirected selective travelling salesman problem
1998
The undirected Selective Travelling Salesman Problem (STSP) is defined on a graph G =...
The Hot Strip Mill Production Scheduling Problem: A Tabu Search approach
1998
The Hot Strip Mill Production Scheduling Problem is a hard problem that arises in the...
A generalized insertion heuristic for the traveling salesman problem with time windows
1998
This article describes a generalized insertion heuristic for the Traveling Salesman...
Solving an ambulance location model by tabu search
1997
This paper considers a double coverage ambulance location problem. A model is proposed...
Efficient routing of service vehicles
1997
Arc routing problems arise in a number of settings where vehicles must traverse...
Papers per page: