Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
routing_search.h File Reference
#include <sys/types.h>
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <deque>
#include <functional>
#include <initializer_list>
#include <limits>
#include <map>
#include <memory>
#include <optional>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
#include "absl/container/flat_hash_set.h"
#include "absl/container/inlined_vector.h"
#include "absl/log/check.h"
#include "absl/types/span.h"
#include "ortools/base/adjustable_priority_queue.h"
#include "ortools/constraint_solver/constraint_solver.h"
#include "ortools/constraint_solver/constraint_solveri.h"
#include "ortools/constraint_solver/routing.h"
#include "ortools/constraint_solver/routing_enums.pb.h"
#include "ortools/constraint_solver/routing_parameters.pb.h"
#include "ortools/constraint_solver/routing_types.h"
#include "ortools/constraint_solver/routing_utils.h"
#include "ortools/util/bitset.h"

Go to the source code of this file.

Classes

class  operations_research::VehicleTypeCurator
class  operations_research::IntVarFilteredDecisionBuilder
class  operations_research::IntVarFilteredHeuristic
 Generic filter-based heuristic applied to IntVars. More...
class  operations_research::RoutingFilteredHeuristic
 Filter-based heuristic dedicated to routing. More...
class  operations_research::CheapestInsertionFilteredHeuristic
struct  operations_research::CheapestInsertionFilteredHeuristic::StartEndValue
struct  operations_research::CheapestInsertionFilteredHeuristic::EvaluatorCache
struct  operations_research::CheapestInsertionFilteredHeuristic::Seed
struct  operations_research::CheapestInsertionFilteredHeuristic::SeedQueue
 clang-format off More...
class  operations_research::GlobalCheapestInsertionFilteredHeuristic
struct  operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters
class  operations_research::InsertionSequenceContainer
struct  operations_research::InsertionSequenceContainer::Insertion
class  operations_research::InsertionSequenceContainer::InsertionSequence
class  operations_research::InsertionSequenceContainer::InsertionSequenceIterator
class  operations_research::InsertionSequenceGenerator
 Generates insertion positions respecting structural constraints. More...
struct  operations_research::PickupDeliveryInsertion
class  operations_research::LocalCheapestInsertionFilteredHeuristic
class  operations_research::CheapestAdditionFilteredHeuristic
class  operations_research::EvaluatorCheapestAdditionFilteredHeuristic
class  operations_research::ComparatorCheapestAdditionFilteredHeuristic
class  operations_research::SavingsFilteredHeuristic
struct  operations_research::SavingsFilteredHeuristic::SavingsParameters
struct  operations_research::SavingsFilteredHeuristic::Saving
class  operations_research::SequentialSavingsFilteredHeuristic
class  operations_research::ParallelSavingsFilteredHeuristic
class  operations_research::ChristofidesFilteredHeuristic
class  operations_research::SweepArranger

Namespaces

namespace  operations_research
 In SWIG mode, we don't want anything besides these top-level includes.

Functions

const Assignmentoperations_research::SolveWithAlternativeSolvers (RoutingModel *primary_model, const std::vector< RoutingModel * > &alternative_models, const RoutingSearchParameters &parameters, int max_non_improving_iterations)
const Assignmentoperations_research::SolveFromAssignmentWithAlternativeSolvers (const Assignment *assignment, RoutingModel *primary_model, const std::vector< RoutingModel * > &alternative_models, const RoutingSearchParameters &parameters, int max_non_improving_iterations)
 Same as above, but taking an initial solution.
const Assignmentoperations_research::SolveFromAssignmentWithAlternativeSolversAndParameters (const Assignment *assignment, RoutingModel *primary_model, const RoutingSearchParameters &parameters, const std::vector< RoutingModel * > &alternative_models, const std::vector< RoutingSearchParameters > &alternative_parameters, int max_non_improving_iterations)
 Same as above but taking alternative parameters for each alternative model.
FirstSolutionStrategy::Value operations_research::AutomaticFirstSolutionStrategy (bool has_pickup_deliveries, bool has_node_precedences, bool has_single_vehicle_node)
std::vector< int64_t > operations_research::ComputeVehicleEndChainStarts (const RoutingModel &model)
DecisionBuilderoperations_research::MakeSweepDecisionBuilder (RoutingModel *model, bool check_assignment)
DecisionBuilderoperations_research::MakeAllUnperformed (RoutingModel *model)
 Returns a DecisionBuilder making all nodes unperformed.