Hi Stefan,
It will be like in the ShipmentInsertionCalculator, the deliverShipmentLoop does not start from j = i, but from j = 0.
But yeah, I agree. For a job with N activities, it seems that the complexity will be multiplied by N!.
The old way has some issues:
-
when dealing with multiple related jobs (e.g., 10 jobs must go to the same route), it is difficult that in an iteration all of them are ruined, which seems one of the motivations @Balage1551 triggered this discussion (see here);
-
sometimes we might want those related jobs are either all assigned to a route, or all unassigned, which seems difficult to realize now (see here).
Best regards,
He