from time to time I'm requested to explain why a given tour optimization does not produce the result the customer expects, e.g. the customer knows a manual solution while the automatic algorithm fails.
Of course we deal with heuristics and we can not guarantee perfect solutions in 100% of given cases.
In some of these tasks it is helpful to understand the potential manipulations (=moves) that are proceeded within the optimization algorithms, e.g. "the solution wanted by the customer requires to move a scheduled order into a new tour to create space on a special vehicle but such a move doesn't exist".
I therefore asked our developers whether they could provide a quick list of moves that are available (extended by those which are impossible). Here's the answer regarding xTour1.
- potential moves matched to the steps
