![]() |
Google OR-Tools v9.12
a fast and portable software suite for combinatorial optimization
|
#include <routing_ils.h>
Public Member Functions | |
RandomWalkRemovalRuinProcedure (RoutingModel *model, std::mt19937 *rnd, int walk_length, int num_neighbors_for_route_selection) | |
std::function< int64_t(int64_t)> | Ruin (const Assignment *assignment) override |
Returns next accessors describing the ruined solution. | |
![]() | |
virtual | ~RuinProcedure ()=default |
Removes a number of non start/end nodes by performing a random walk on the routing solution graph described by the assignment.
Definition at line 135 of file routing_ils.h.
operations_research::RandomWalkRemovalRuinProcedure::RandomWalkRemovalRuinProcedure | ( | RoutingModel * | model, |
std::mt19937 * | rnd, | ||
int | walk_length, | ||
int | num_neighbors_for_route_selection ) |
Definition at line 801 of file routing_ils.cc.
|
overridevirtual |
Returns next accessors describing the ruined solution.
Remove the active siblings node of curr before selecting next, so that we do not accidentally end up with next being one of these sibling nodes.
We were not able to find a vertex where to move next. We thus prematurely abort the ruin.
Implements operations_research::RuinProcedure.
Definition at line 815 of file routing_ils.cc.