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
✦ LIBER ✦
A parallel iterated tabu search heuristic for vehicle routing problems
✍ Scribed by Jean-François Cordeau; Mirko Maischberger
- Book ID
- 113553772
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 354 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A tabu search heuristic for periodic and
✍
Cordeau, Jean-Fran�ois; Gendreau, Michel; Laporte, Gilbert
📂
Article
📅
1997
🏛
John Wiley and Sons
🌐
English
⚖ 142 KB
👁 1 views
A tabu search heuristic for the multi-de
✍
Jacques Renaud; Gilbert Laporte; Fayez F. Boctor
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 605 KB
A parallel multi-neighborhood cooperativ
✍
Jianyong Jin; Teodor Gabriel Crainic; Arne Løkketangen
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 698 KB
A Neural-Tabu Search Heuristic for the R
✍
Jaber Jemai; Khaled Mellouli
📂
Article
📅
2008
🏛
Springer Netherlands
🌐
English
⚖ 380 KB
Parallel Tabu search heuristics for the
✍
Andrea Attanasio; Jean-François Cordeau; Gianpaolo Ghiani; Gilbert Laporte
📂
Article
📅
2004
🏛
Elsevier Science
🌐
English
⚖ 203 KB
A reactive tabu search meta-heuristic fo
✍
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