A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
✍ Scribed by Niaz A. Wassan; A. Hameed Wassan; Gábor Nagy
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 319 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1382-6905
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
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
## Abstract This article addresses the well‐known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two‐dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delive