𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A large neighbourhood search heuristic for the aircraft and passenger recovery problem

✍ Scribed by Serge Bisaillon; Jean-François Cordeau; Gilbert Laporte; Federico Pasin

Publisher
Springer
Year
2010
Tongue
English
Weight
240 KB
Volume
9
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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