-
final class
A vehicle's route can be decomposed, along the time axis, like this (we
assume there are n visits):
```
| | | | | T[2], | | |
| Transition | Visit #0 | | | V[2], | | |
| #0 | aka | T[1] | V[1] |
static final class
A vehicle's route can be decomposed, along the time axis, like this (we
assume there are n visits):
```
| | | | | T[2], | | |
| Transition | Visit #0 | | | V[2], | | |
| #0 | aka | T[1] | V[1] |
Guide the optimization algorithm in finding a first solution that is
similar to a previous solution.
Guide the optimization algorithm in finding a first solution that is
similar to a previous solution.
Guide the optimization algorithm in finding a first solution that is
similar to a previous solution.
If non-empty, the given routes will be refreshed, without modifying their
underlying sequence of visits or travel times: only other details will be
updated.
If non-empty, the given routes will be refreshed, without modifying their
underlying sequence of visits or travel times: only other details will be
updated.
If non-empty, the given routes will be refreshed, without modifying their
underlying sequence of visits or travel times: only other details will be
updated.
Routes of the solution to inject.
Routes of the solution to inject.
Routes of the solution to inject.
Routes computed for each vehicle; the i-th route corresponds to the i-th
vehicle in the model.
Routes computed for each vehicle; the i-th route corresponds to the i-th
vehicle in the model.
Routes computed for each vehicle; the i-th route corresponds to the i-th
vehicle in the model.
Guide the optimization algorithm in finding a first solution that is
similar to a previous solution.
Guide the optimization algorithm in finding a first solution that is
similar to a previous solution.
Guide the optimization algorithm in finding a first solution that is
similar to a previous solution.
If non-empty, the given routes will be refreshed, without modifying their
underlying sequence of visits or travel times: only other details will be
updated.
If non-empty, the given routes will be refreshed, without modifying their
underlying sequence of visits or travel times: only other details will be
updated.
If non-empty, the given routes will be refreshed, without modifying their
underlying sequence of visits or travel times: only other details will be
updated.
Routes of the solution to inject.
Routes of the solution to inject.
Routes of the solution to inject.
Routes computed for each vehicle; the i-th route corresponds to the i-th
vehicle in the model.
Routes computed for each vehicle; the i-th route corresponds to the i-th
vehicle in the model.
Routes computed for each vehicle; the i-th route corresponds to the i-th
vehicle in the model.