MinMax vs. MinSum Vehicle Routing: A worst-case analysis
We study MinSum VRP (min total distance) and MinMax VRP (min longest route). We compare the optimal costs from the worst-case point of view. We compare the structure of the optimal solutions in worst-case instances. We motivate the design of heuristic algorithms for the MinMax VRP. We show that the MinMax approach should be adopted only when it is well justified.
minmax minsum worst-case analysis vehicle routing problem