## 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
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
✍ Scribed by Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvano Martello
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 45 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
✦ Synopsis
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 spelled Silvaro Martello as a result of a printer's error. The correct spelling is Silvano Martello. The publisher deeply regrets the error and conveys its apologies to the author.
📜 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