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
β¦ LIBER β¦
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
β Scribed by Abdellah El Fallahi; Christian Prins; Roberto Wolfler Calvo
- Book ID
- 108105800
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 317 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A tabu search algorithm for the multi-tr
β
JosΓ© BrandΓ£o; Alan Mercer
π
Article
π
1997
π
Elsevier Science
π
English
β 907 KB
A tabu search heuristic for the multi-de
β
Jacques Renaud; Gilbert Laporte; Fayez F. Boctor
π
Article
π
1996
π
Elsevier Science
π
English
β 605 KB
A new tabu search algorithm for the vehi
β
JosΓ© BrandΓ£o
π
Article
π
2006
π
Elsevier Science
π
English
β 199 KB
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
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 algorithm for the
β
Niaz A. Wassan; A. Hameed Wassan; GΓ‘bor Nagy
π
Article
π
2007
π
Springer US
π
English
β 319 KB
A Neural-Tabu Search Heuristic for the R
β
Jaber Jemai; Khaled Mellouli
π
Article
π
2008
π
Springer Netherlands
π
English
β 380 KB