-
ShipmentRoute.Builder.build()
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.
InjectedSolutionConstraint.Builder.getRoutes(int index)
Routes of the solution to inject.
InjectedSolutionConstraint.getRoutes(int index)
Routes of the solution to inject.
InjectedSolutionConstraintOrBuilder.getRoutes(int index)
Routes of the solution to inject.
OptimizeToursResponse.Builder.getRoutes(int index)
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.
OptimizeToursResponseOrBuilder.getRoutes(int index)
Routes computed for each vehicle; the i-th route corresponds to the i-th
vehicle in the model.
ShipmentRoute.parseFrom(byte[] data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
ShipmentRoute.parseFrom(com.google.protobuf.ByteString data)
ShipmentRoute.parseFrom(com.google.protobuf.ByteString data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
ShipmentRoute.parseFrom(com.google.protobuf.CodedInputStream input)
ShipmentRoute.parseFrom(com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
ShipmentRoute.parseFrom(InputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
ShipmentRoute.parseFrom(ByteBuffer data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
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.
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 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.
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 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.
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 computed for each vehicle; the i-th route corresponds to the i-th
vehicle in the model.