A Neural-Tabu Search Heuristic for the Real Time Vehicle Routing Problem
β Scribed by Jaber Jemai; Khaled Mellouli
- Publisher
- Springer Netherlands
- Year
- 2008
- Tongue
- English
- Weight
- 380 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1570-1166
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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
In the article, "A Tabu Search Heuristic for the Vehicle Routing Problem with Two-Dimensional Loading Constraints" by M. Gendreau et al., which appeared in the January issue of Networks (Networks 51 (2008), 4-18), the last author's name was misspelled. Silvano Martello's name was inadvertently spell
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