![]() |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
#include <cstdint>#include <functional>#include <memory>#include <random>#include <string>#include <vector>#include "absl/types/span.h"#include "ortools/base/strong_vector.h"#include "ortools/constraint_solver/routing.h"Go to the source code of this file.
Classes | |
| class | operations_research::LocationContainer |
| class | operations_research::RandomDemand |
| Random demand. More... | |
| class | operations_research::ServiceTimePlusTransition |
| Service time (proportional to demand) + transition time callback. More... | |
| class | operations_research::StopServiceTimePlusTransition |
| Stop service time + transition time callback. More... | |
Namespaces | |
| namespace | operations_research |
| In SWIG mode, we don't want anything besides these top-level includes. | |
Typedefs | |
| typedef std::function< int64_t(RoutingNodeIndex, RoutingNodeIndex)> | operations_research::RoutingNodeEvaluator2 |
Functions | |
| int32_t | operations_research::GetSeed (bool deterministic) |
| Random seed generator. | |
| void | operations_research::DisplayPlan (const operations_research::RoutingIndexManager &manager, const operations_research::RoutingModel &routing, const operations_research::Assignment &plan, bool use_same_vehicle_costs, int64_t max_nodes_per_group, int64_t same_vehicle_cost, absl::Span< const std::string > dimension_names) |