É. Taillard

Publications
Influence

Benchmarks for basic scheduling problems

É. Taillard
Computer Science
22 January 1993

We propose 260 randomly generated scheduling problems whose size is greater than that of the rare examples published. Expand

1,926
304

Probabilistic diversification and intensification in local search for vehicle routing

Yves Rochat, É. Taillard
Computer Science
J. Heuristics
1 September 1995

This article presents a probabilistic technique to diversify, intensify, and parallelize a local search adapted for solving vehicle routing problems. Expand

Robust taboo search for the quadratic assignment problem

É. Taillard
Computer Science
Parallel Comput.
1 July 1991

An adaptation of taboo search to the quadratic assignment problem is discussed in this paper, requiring less complexity and fewer parameters than earlier adaptations. Expand

MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows

MACS-VRPTW, an Ant Colony Optimization based approach useful to solve vehicle routing problems with time windows is presented. MACS-VRPTW is organized with a hierarchy of artificial ant colonies… Expand

Some efficient heuristic methods for the flow shop sequencing problem

É. Taillard
Mathematics
5 July 1990

Abstract In this paper the best heuristic methods known up to now are compared to solve the flow shop sequencing problem and we improve the complexity of the best one. Next, this problem is applied… Expand

COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM.

É. Taillard
Mathematics
1 August 1995

Abstract This paper compares some of the most efficient heuristic methods for the quadratic assignment problem. These methods are known as strict taboo search, robust taboo search, reactive taboo… Expand

Parallel iterative search methods for vehicle routing problems

É. Taillard
Mathematics, Computer Science
Networks
1 December 1993

This paper presents two partition methods that speed up iterative search methods applied to vehicle routing problems including a large number of vehicles. 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

Ant colonies for the quadratic assignment problem

L. Gambardella, É. Taillard, M. Dorigo
Computer Science, Economics
J. Oper. Res. Soc.
9 February 1999

We present HAS–QAP, a hybrid ant colony system coupled with a local search, applied to the quadratic assignment problem. 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

Recommended Authors