Article ID: | iaor20091072 |
Country: | Netherlands |
Volume: | 5 |
Issue: | 2 |
Start Page Number: | 350 |
End Page Number: | 372 |
Publication Date: | May 2008 |
Journal: | Discrete Optimization |
Authors: | Magnanti Thomas L., Gouveia Luis, Godinho Maria Teresa |
Keywords: | programming: travelling salesman |
We consider two types of hop-indexed models for the unit-demand asymmetric Capacitated Vehicle Routing Problem (CVRP): (a) capacitated models guaranteeing that the number of commodities (paths) traversing any given arc does not exceed a specified capacity; and (b) hop-constrained models guaranteeing that any route length (number of nodes) does not exceed a given value. The latter might, in turn, be divided into two classes: (b1) those restricting the length of the path from the depot to any node