𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem

✍ Scribed by Escobar, John Willmer; Linfati, Rodrigo; Toth, Paolo; Baldoquin, Maria G.

Book ID
125360788
Publisher
Springer US
Year
2014
Tongue
English
Weight
257 KB
Volume
20
Category
Article
ISSN
1381-1231

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 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