• Publications
  • Influence
A Tabu Search Heuristic for the Vehicle Routing Problem
TLDR
Numerical tests on a set of benchmark problems indicate that tabu search outperforms the best existing heuristics, and TABUROUTE often produces the bes known solutions.
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
TLDR
An exact solution procedure is proposed for the ESPPRC, which extends the classical label correcting algorithm originally developed for the relaxed (nonelementary) path version of this problem.
Hyper-heuristics: a survey of the state of the art
TLDR
A critical discussion of the scientific literature on hyper-heuristics including their origin and intellectual roots, a detailed account of the main types of approaches, and an overview of some related areas are presented.
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
TLDR
How heuristic methods should be evaluated and proposed using the concept of Pareto optimality in the comparison of different heuristic approaches are discussed.
Handbook of Metaheuristics
TLDR
The Handbook now includes updated chapters on the best known metaheuristics, including simulated annealing, tabu search, variable neighborhood search, scatter search and path relinking, genetic algorithms, memetic algorithms, genetic programming, ant colony optimization, and multi-start methods.
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
TLDR
A tabu search heuristic for the vehicle routing problem with soft time windows, where lateness at customer locations is allowed although a penalty is incurred and added to the objective value.
A guide to vehicle routing heuristics
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.
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
TLDR
A new insertion procedure and a new post- optimization routine for the traveling salesman problem results in an efficient algorithm (GENIUS) which outperforms known alternative heuristics in terms of solution quality and computing time.
...
...