Question: Explain why the following constraints can or cannot be integrated into the Savings Algorithm. (a) Distance constraint. Each route must be at most miles
Explain why the following constraints can or cannot be integrated into the Savings Algorithm.
(a) Distance constraint. Each route must be at most λ miles long.
(b) Minimum route size. Each route must pick up at least m points.
(c) Mixing constraints. Even indexed points cannot be on the same route as odd indexed points.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
