✦ LIBER ✦

A Tabu Search Heuristic for a Full-Load, Multi-Terminal, Vehicle Scheduling Problem with Backhauling and Time Windows

✍ Scribed by R. H. Currie; S. Salhi

Book ID: 111589761
Publisher: Springer Netherlands
Year: 2004
Tongue: English
Weight: 160 KB
Volume: 3
Category: Article
ISSN: 1570-1166
DOI: 10.1023/b:jmma.0000038616.99798.f2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search heuristic for the single v

A tabu search heuristic for the single vehicle pickup and delivery problem with time windows

✍ Antoine Landrieu; Yazid Mati; Zdenek Binder 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 418 KB

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 tabu search algorithm for the multi-tr

A tabu search algorithm for the multi-trip vehicle routing and scheduling problem

✍ José Brandão; Alan Mercer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 907 KB

This paper describes a novel tabu search heuristic for the multi-trip vehicle routing and scheduling problem (MTVRSP). The method was developed to tackle real distribution problems, taking into account most of the constraints that appear in practice. In the MTVRSP, besides the constraints that are c

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

A tabu search heuristic for the multipro

A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times

✍ Paulo M. França; Michel Gendreau; Gilbert Laporte; Felipe M. Müller 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 961 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