VRPH
1.0
|
#include <TwoPointMove.h>
Public Member Functions | |
bool | search (class VRP *V, int i, int rules) |
bool | route_search (class VRP *V, int r1, int r2, int rules) |
Private Member Functions | |
bool | evaluate (class VRP *V, int i, int j, int rules, VRPMove *M) |
bool | move (class VRP *V, VRPMove *M) |
Definition at line 17 of file TwoPointMove.h.
bool TwoPointMove::evaluate | ( | class VRP * | V, |
int | i, | ||
int | j, | ||
int | rules, | ||
VRPMove * | M | ||
) | [private] |
This function evaluates the move of swapping the positions of j and b in the current solution. If a satisfactory move is found subject to the provided rules, then the solution modification data is placed in the VRPMove M and the function returns true. Returns false otherwise.
Definition at line 256 of file TwoPointMove.cpp.
bool TwoPointMove::move | ( | class VRP * | V, |
VRPMove * | M | ||
) | [private] |
Performs the actual solution modification given by the move M.
Definition at line 320 of file TwoPointMove.cpp.
bool TwoPointMove::route_search | ( | class VRP * | V, |
int | r1, | ||
int | r2, | ||
int | rules | ||
) |
Searches for all TPM moves involving a node from route r1 and the other from route r2.
Definition at line 162 of file TwoPointMove.cpp.
bool TwoPointMove::search | ( | class VRP * | V, |
int | i, | ||
int | rules | ||
) |
Attempts to find the best Two-Point move involving node j using the specified search space, and rules. If an acceptable move is found, then the move is made and all relevant solution modifications are made.
Definition at line 17 of file TwoPointMove.cpp.