Go to the source code of this file.
|
| | ABSL_FLAG (int, vrp_orders, 25, "Nodes in the problem.") |
| |
| | ABSL_FLAG (int, vrp_vehicles, 10, "Size of Traveling Salesman Problem instance.") |
| |
| | ABSL_FLAG (bool, vrp_use_deterministic_random_seed, false, "Use deterministic random seeds.") |
| |
| | ABSL_FLAG (std::string, routing_search_parameters, "", "Text proto RoutingSearchParameters (possibly partial) that will " "override the DefaultRoutingSearchParameters()") |
| |
| StepFunction | RandomStepFunction (int64_t mean, int64_t step_size, int64_t interval_end, int seed) |
| |
| int | main (int argc, char **argv) |
| |
◆ ABSL_FLAG() [1/4]
| ABSL_FLAG |
( |
bool |
, |
|
|
vrp_use_deterministic_random_seed |
, |
|
|
false |
, |
|
|
"Use deterministic random seeds." |
|
|
) |
| |
◆ ABSL_FLAG() [2/4]
| ABSL_FLAG |
( |
int |
, |
|
|
vrp_orders |
, |
|
|
25 |
, |
|
|
"Nodes in the problem." |
|
|
) |
| |
◆ ABSL_FLAG() [3/4]
| ABSL_FLAG |
( |
int |
, |
|
|
vrp_vehicles |
, |
|
|
10 |
, |
|
|
"Size of Traveling Salesman Problem instance." |
|
|
) |
| |
◆ ABSL_FLAG() [4/4]
| ABSL_FLAG |
( |
std::string |
, |
|
|
routing_search_parameters |
, |
|
|
"" |
, |
|
|
"Text proto RoutingSearchParameters (possibly partial) that will " "override the DefaultRoutingSearchParameters()" |
|
|
) |
| |
◆ main()
| int main |
( |
int |
argc, |
|
|
char ** |
argv |
|
) |
| |
◆ RandomStepFunction()
| StepFunction RandomStepFunction |
( |
int64_t |
mean, |
|
|
int64_t |
step_size, |
|
|
int64_t |
interval_end, |
|
|
int |
seed |
|
) |
| |
◆ kCapacity
| const char kCapacity[] = "Capacity" |
|
static |
◆ kTime
| const char kTime[] = "Time" |
|
static |
◆ kTimeDepedentCost
| const char kTimeDepedentCost[] = "TimeDependentCost" |
|
static |