Michel Gendreau

Solving an Ambulance Location Model by Tabu Search

...

Tabu Search Algorithms for the Maximum Clique Problem

Tabu search is a relatively new general heuristic framework successfully applied to a wide variety of hard combinatorial optimization points. In two p...

A Tabu Search Heuristic for the Vehicle Routing Problem

...

A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers

This paper considers a version of the stochastic vehicle routing problem where customers are present with some probability and have random demands. A ...

Arc Routing : Problems, Applications and Algorithms

...

Sequence Dependent Routing Or Scheduling to Minimize the Number of Missed Deadlines

...

Efficient Heuristics for the Design of Ring Networks

...

Sequence Dependent Scheduling to Minimize the Number of Late Jobs

...

Arc Routing Problems

The Chinese postman problem

...

Heuristics for the Clustered Traveling Salesman Problem

...

Metaheuristics

A Canadian Perspective

...

Location of Facilities on Networks Subject to a Single Edge Failure

By Horst A. Eiselt, Michel Gendreau and Gilbert Laporte

...

Location of Facilities on a Network with Edge Failures

...

The Vehicle Routing Problem with Stochastic Customers and Demands

...

The Windy Postman Problem on General Graphs

The Windy Postman Problem consists of determining a least cost oriented tour covering all edges of a connected undirected graph, when the cost of trav...

The Preemptive Swapping Problem on a Tree

...

Locating Rapid Transit Lines

Decision Criteria and Methodology

...

Maximizing Pedestrian Flow in Shopping Center Layout

...

Metaheuristics for the Vehicle Routing Problem

...

New Insertion and Post-optimization Procedures for the Traveling Salesman Problem

...

Tracking Down Elusive Customers : the Fredericton Mall Survey

...