The Mixed Capacitated General Routing Problem
In the VRP literature, there is almost a dichotomy between arc and node routing. In real life, there are several applications where a pure node routing or a pure arc routing formulation is not adequate. This talk will motivate, define, and describe the Mixed Capacitated General Routing Problem (MCGRP), also called the Node, Edge, and Arc Routing Problem (NEARP) which is a generalization of the CARP and the CVRP. The relatively scarce literature on the MCGRP and variants will be summarized, with focus on recent results.
- Research Council of Norway (RCN) / 205298
- Research Council of Norway (RCN) / 217108
- SINTEF Digital / Mathematics and Cybernetics
The International Colloquium on Graphs and Optimization 2014 (GO IX)
06.07.2014 - 10.07.2014
C. Archetti, L. Bertazzi, A. Hertz, B. Ries, S. Varone