A memetic algorithm for the Multi Trip Vehicle Routing Problem
β Scribed by Cattaruzza, Diego; Absi, Nabil; Feillet, Dominique; Vidal, Thibaut
- Book ID
- 120991834
- Publisher
- Elsevier Science
- Year
- 2014
- Tongue
- English
- Weight
- 947 KB
- Volume
- 236
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
## Abstract Vehicle routing problems are at the heart of most decision support systems for realβlife distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e., fleet of vehicles) located at one or several points (e.g.,