✦ LIBER ✦

A tabu search heuristic for the multi-depot vehicle routing problem

✍ Scribed by Jacques Renaud; Gilbert Laporte; Fayez F. Boctor

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 605 KB
Volume: 23
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(95)o0026-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search heuristic for periodic and

A tabu search heuristic for periodic and multi-depot vehicle routing problems

✍ Cordeau, Jean-Fran�ois; Gendreau, Michel; Laporte, Gilbert 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problem. Computational experiments carried out on instances taken from the literature indicate t

A reactive tabu search meta-heuristic fo

A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls

✍ Ibrahim H. Osman; Niaz A. Wassan 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 195 KB

The vehicle routing problem with back-hauls involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a set of vehicles to service a set of customers with known quantities to be either delivered or collected. This paper describes two route-construction

A Tabu search heuristic for the vehicle

A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints

✍ Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvaro Martello 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

## Abstract This article addresses the well‐known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two‐dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delive

Parallel Tabu search heuristics for the

Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem

✍ Andrea Attanasio; Jean-François Cordeau; Gianpaolo Ghiani; Gilbert Laporte 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Erratum: A Tabu search heuristic for the

Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints

✍ Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvano Martello 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 45 KB

In the article, "A Tabu Search Heuristic for the Vehicle Routing Problem with Two-Dimensional Loading Constraints" by M. Gendreau et al., which appeared in the January issue of Networks (Networks 51 (2008), 4-18), the last author's name was misspelled. Silvano Martello's name was inadvertently spell

A tabu search heuristic for the Steiner

A tabu search heuristic for the Steiner Tree Problem

✍ Gendreau, Michel; Larochelle, Jean-Francois; Sans�, Brunilde 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se