𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by José Brandão; Alan Mercer

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
907 KB
Volume
100
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

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 common to the basic vehicle routing problem, the following ones are present: during each day a vehicle can make more than one trip; the customers impose delivery time windows; the vehicles have different capacities considered in terms of both volume and weight; the access to some customers is restricted to some vehicles; the drivers' schedules must respect the maximum legal driving time per day and the legal time breaks; the unloading times are considered.

📜 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

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