𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems

✍ Scribed by Jianyong Jin; Teodor Gabriel Crainic; Arne Løkketangen

Book ID
116437065
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
698 KB
Volume
222
Category
Article
ISSN
0377-2217

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