Search Results - "Taillard, Eric D."

A linearithmic heuristic for the travelling salesman problem by Taillard, Éric D.

“…•A linearithmic heuristic is proposed for the travelling salesman problem.•The method is tested on instances with more than 2 billion cities.•A few runs of the…”
Get full text

POPMUSIC for the travelling salesman problem by Taillard, Éric D., Helsgaun, Keld

“…•Proposes a low-complexity constructive method for general and large TSP instances.•Proposes a low-complexity improvement method for general TSP…”
Get full text

Few statistical tests for proportions comparison by Taillard, Éric D., Waelti, Philippe, Zuber, Jacques

“…This article reviews a number of statistical tests for comparing proportions. These statistical tests are presented in a comprehensive way, so that OR…”
Get full text

POPMUSIC for the point feature label placement problem by Alvim, Adriana C.F., Taillard, Éric D.

“…Point feature label placement is the problem of placing text labels adjacent to point features on a map so as to maximize legibility. The goal is to choose…”
Get full text

Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem by Brimberg, Jack, Hansen, Pierre, Mladenović, Nenad, Taillard, Eric D.

“…The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to minimize the total transportation cost for satisfying the…”
Get full text

Adaptive memory programming: A unified view of metaheuristics by Taillard, Éric D, Gambardella, Luca M, Gendreau, Michel, Potvin, Jean-Yves

“…The paper analyses recent developments of a number of memory-based metaheuristics such as taboo search (TS), scatter search (SS), genetic algorithms (GA) and…”
Get full text

POPMUSIC for the world location-routing problem by Alvim, Adriana C. F., Taillard, Éric D.

“…POPMUSIC—partial optimization metaheuristic under special intensification conditions—is a template for tackling large problem instances. This template has been…”
Get full text

An adaptive memory heuristic for a class of vehicle routing problems with minmax objective by Golden, Bruce L., Laporte, Gilbert, Taillard, Éric D.

“…We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with…”
Get full text

Probabilistic diversification and intensification in local search for vehicle routing by Rochat, Yves, Taillard, Éric D.

Get full text

Heuristic Methods for Large Centroid Clustering Problems by Taillard, Eric D

“…This article presents new heuristic methods for solving a class of hard centroid clustering problems including the p-median, the sum-of-squares clustering and…”
Get full text

A tabu search heuristic for the heterogeneous fleet vehicle routing problem by Gendreau, Michel, Laporte, Gilbert, Musaraganyi, Christophe, Taillard, Éric D.

“…The Heterogeneous Fleet Vehicle Routing Problem (HVRP) is a variant of the classical Vehicle Routing Problem in which customers are served by a heterogeneous…”
Get full text

Vehicle Routeing with Multiple Use of Vehicles by Taillard, Éric D., Laporte, Gilbert, Gendreau, Michel

“…The vehicle routeing problem with multiple use of vehicles is a variant of the standard vehicle routeing problem in which the same vehicle may be assigned to…”
Get full text

Comparison of iterative searches for the quadratic assignment problem by Taillard, Éric D.

“…This paper compares some of the most efficient heuristic methods for the quadratic assignment problem. These methods are known as strict taboo search, robust…”
Get full text

Vehicle Routeing with Multiple Use of Vehicles by Taillard, Eric D., Laporte, Gilbert, Gendreau, Michel

Get full text

Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem by Brimberg, Jack, Hansen, Pierre, Mladenovic, Nenad, Taillard, Eric. D

“…The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to minimize the total transportation cost for satisfying the…”
Get full text