|
VRPH
1.0
|
#include <CrossExchange.h>
Public Member Functions | |
| bool | route_search (class VRP *V, int r1, int r2, int criteria) |
Private Member Functions | |
| bool | evaluate (class VRP *V, int i1, int i2, int k1, int k2, int j1, int j2, int l1, int l2, int criteria, VRPMove *M) |
| bool | move (class VRP *V, VRPMove *M) |
Definition at line 15 of file CrossExchange.h.
| bool CrossExchange::evaluate | ( | class VRP * | V, |
| int | i1, | ||
| int | i2, | ||
| int | k1, | ||
| int | k2, | ||
| int | j1, | ||
| int | j2, | ||
| int | l1, | ||
| int | l2, | ||
| int | criteria, | ||
| VRPMove * | M | ||
| ) | [private] |
Evaluate the move of removing the edges i1-i2 and k1-k2 in one route and j1-j2 and l1-l2 in another route and replacing these edges with i1-j2, j1-i2, k1-l2, and l1-k2
Definition at line 238 of file CrossExchange.cpp.
| bool CrossExchange::move | ( | class VRP * | V, |
| VRPMove * | M | ||
| ) | [private] |
Make the move of removing the edges i1-i2 and k1-k2 in one route and j1-j2 and l1-l2 in another route and replacing these edges with i1-j2, j1-i2, k1-l2, and l1-k2. See
Definition at line 375 of file CrossExchange.cpp.
| bool CrossExchange::route_search | ( | class VRP * | V, |
| int | r1, | ||
| int | r2, | ||
| int | criteria | ||
| ) |
Attempts to find a cross exchange move between routes r1 and r2. Edges i1-i2 and k1-k2 in route r1, and edges j1-j2 and l1-l2 in route r2.
Definition at line 16 of file CrossExchange.cpp.
1.7.6.1