![]() |
Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
|
Acceptance strategy in which a solution is accepted only if it has less absences than the reference solution (see Slack Induction by String Removals for Vehicle Routing Problems" Christiaens and Vanden Berghe, Transportation Science 2020). More...
Acceptance strategy in which a solution is accepted only if it has less absences than the reference solution (see Slack Induction by String Removals for Vehicle Routing Problems" Christiaens and Vanden Berghe, Transportation Science 2020).
In particular, for each node n, the number of solutions where n was not performed by any route is tracked by a counter absences[n]. A candidate is accepted if sum(absences[n]) < sum(absences[m]) with n in unperformed(candidate) m in unperformed(reference) The counter absences is increased after every ILS iteration for the unperformed nodes in the reference solution. In addition, when remove_route_with_lowest_absences is true and a new best found solution is found, the route with the lowest sum of absences is removed from the reference solution.
Definition at line 3915 of file RoutingIls.pb.cs.
Public Member Functions | |
| AbsencesBasedAcceptanceStrategy () | |
| AbsencesBasedAcceptanceStrategy (AbsencesBasedAcceptanceStrategy other) | |
| AbsencesBasedAcceptanceStrategy | Clone () |
| void | ClearRemoveRouteWithLowestAbsences () |
| Clears the value of the "remove_route_with_lowest_absences" field. | |
| override bool | Equals (object other) |
| bool | Equals (AbsencesBasedAcceptanceStrategy other) |
| override int | GetHashCode () |
| override string | ToString () |
| void | WriteTo (pb::CodedOutputStream output) |
| int | CalculateSize () |
| void | MergeFrom (AbsencesBasedAcceptanceStrategy other) |
| void | MergeFrom (pb::CodedInputStream input) |
Static Public Attributes | |
| const int | RemoveRouteWithLowestAbsencesFieldNumber = 1 |
| Field number for the "remove_route_with_lowest_absences" field. | |
Properties | |
| static pb::MessageParser< AbsencesBasedAcceptanceStrategy > | Parser [get] |
| static pbr::MessageDescriptor | Descriptor [get] |
| bool | RemoveRouteWithLowestAbsences [get, set] |
| If true, when a new best solution is found, the route with the lowest sum of absences is removed from the reference solution. | |
| bool | HasRemoveRouteWithLowestAbsences [get] |
| Gets whether the "remove_route_with_lowest_absences" field is set. | |
|
inline |
Definition at line 3941 of file RoutingIls.pb.cs.
|
inline |
Definition at line 3949 of file RoutingIls.pb.cs.
|
inline |
Definition at line 4060 of file RoutingIls.pb.cs.
|
inline |
Clears the value of the "remove_route_with_lowest_absences" field.
Definition at line 3988 of file RoutingIls.pb.cs.
|
inline |
Definition at line 3957 of file RoutingIls.pb.cs.
|
inline |
Definition at line 4000 of file RoutingIls.pb.cs.
|
inline |
Definition at line 3994 of file RoutingIls.pb.cs.
|
inline |
Definition at line 4013 of file RoutingIls.pb.cs.
|
inline |
Definition at line 4073 of file RoutingIls.pb.cs.
|
inline |
Definition at line 4085 of file RoutingIls.pb.cs.
|
inline |
Definition at line 4024 of file RoutingIls.pb.cs.
|
inline |
Definition at line 4030 of file RoutingIls.pb.cs.
|
static |
Field number for the "remove_route_with_lowest_absences" field.
Definition at line 3962 of file RoutingIls.pb.cs.
|
staticget |
Definition at line 3929 of file RoutingIls.pb.cs.
|
get |
Gets whether the "remove_route_with_lowest_absences" field is set.
Definition at line 3982 of file RoutingIls.pb.cs.
|
staticget |
Definition at line 3925 of file RoutingIls.pb.cs.
|
getset |
If true, when a new best solution is found, the route with the lowest sum of absences is removed from the reference solution.
Definition at line 3972 of file RoutingIls.pb.cs.