RoutingParameters.java

Go to the documentation of this file.

// Generated by the protocol buffer compiler.  DO NOT EDIT!
// source: ortools/constraint_solver/routing_parameters.proto
 
package com.google.ortools.constraintsolver;
 
public final class RoutingParameters {
  private RoutingParameters() {}
  public static void registerAllExtensions(
      com.google.protobuf.ExtensionRegistryLite registry) {
  }
 
  public static void registerAllExtensions(
      com.google.protobuf.ExtensionRegistry registry) {
    registerAllExtensions(
        (com.google.protobuf.ExtensionRegistryLite) registry);
  }
  static final com.google.protobuf.Descriptors.Descriptor
    internal_static_operations_research_RoutingSearchParameters_descriptor;
  static final 
    com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
      internal_static_operations_research_RoutingSearchParameters_fieldAccessorTable;
  static final com.google.protobuf.Descriptors.Descriptor
    internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor;
  static final 
    com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
      internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_fieldAccessorTable;
  static final com.google.protobuf.Descriptors.Descriptor
    internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor;
  static final 
    com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
      internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_fieldAccessorTable;
  static final com.google.protobuf.Descriptors.Descriptor
    internal_static_operations_research_RoutingModelParameters_descriptor;
  static final 
    com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
      internal_static_operations_research_RoutingModelParameters_fieldAccessorTable;
 
  public static com.google.protobuf.Descriptors.FileDescriptor
      getDescriptor() {
    return descriptor;
  }
  private static  com.google.protobuf.Descriptors.FileDescriptor
      descriptor;
  static {
    java.lang.String[] descriptorData = {
      "\n2ortools/constraint_solver/routing_para" +
      "meters.proto\022\023operations_research\032\036googl" +
      "e/protobuf/duration.proto\032-ortools/const" +
      "raint_solver/routing_enums.proto\0321ortool" +
      "s/constraint_solver/solver_parameters.pr" +
      "oto\032#ortools/util/optional_boolean.proto" +
      "\"\263#\n\027RoutingSearchParameters\022Q\n\027first_so" +
      "lution_strategy\030\001 \001(\01620.operations_resea" +
      "rch.FirstSolutionStrategy.Value\022.\n&use_u" +
      "nfiltered_first_solution_strategy\030\002 \001(\010\022" +
      "\037\n\027savings_neighbors_ratio\030\016 \001(\001\022&\n\036savi" +
      "ngs_max_memory_usage_bytes\030\027 \001(\001\022 \n\030savi" +
      "ngs_add_reverse_arcs\030\017 \001(\010\022\037\n\027savings_ar" +
      "c_coefficient\030\022 \001(\001\022\037\n\027savings_parallel_" +
      "routes\030\023 \001(\010\022/\n\'cheapest_insertion_farth" +
      "est_seeds_ratio\030\020 \001(\001\0229\n1cheapest_insert" +
      "ion_first_solution_neighbors_ratio\030\025 \001(\001" +
      "\0226\n.cheapest_insertion_ls_operator_neigh" +
      "bors_ratio\030\037 \001(\001\0222\n*cheapest_insertion_a" +
      "dd_unperformed_entries\030( \001(\010\022)\n!christof" +
      "ides_use_minimum_matching\030\036 \001(\010\022m\n\026local" +
      "_search_operators\030\003 \001(\0132M.operations_res" +
      "earch.RoutingSearchParameters.LocalSearc" +
      "hNeighborhoodOperators\0224\n,use_multi_arme" +
      "d_bandit_concatenate_operators\030) \001(\010\022?\n7" +
      "multi_armed_bandit_compound_operator_mem" +
      "ory_coefficient\030* \001(\001\022D\n<multi_armed_ban" +
      "dit_compound_operator_exploration_coeffi" +
      "cient\030+ \001(\001\0225\n-relocate_expensive_chain_" +
      "num_arcs_to_consider\030\024 \001(\005\022:\n2heuristic_" +
      "expensive_chain_lns_num_arcs_to_consider" +
      "\030  \001(\005\022+\n#heuristic_close_nodes_lns_num_" +
      "nodes\030# \001(\005\022W\n\032local_search_metaheuristi" +
      "c\030\004 \001(\01623.operations_research.LocalSearc" +
      "hMetaheuristic.Value\022.\n&guided_local_sea" +
      "rch_lambda_coefficient\030\005 \001(\001\022\036\n\026use_dept" +
      "h_first_search\030\006 \001(\010\0224\n\006use_cp\030\034 \001(\0162$.o" +
      "perations_research.OptionalBoolean\0228\n\nus" +
      "e_cp_sat\030\033 \001(\0162$.operations_research.Opt" +
      "ionalBoolean\022c\n\034continuous_scheduling_so" +
      "lver\030! \001(\0162=.operations_research.Routing" +
      "SearchParameters.SchedulingSolver\022f\n\037mix" +
      "ed_integer_scheduling_solver\030\" \001(\0162=.ope" +
      "rations_research.RoutingSearchParameters" +
      ".SchedulingSolver\022\031\n\021optimization_step\030\007" +
      " \001(\001\022&\n\036number_of_solutions_to_collect\030\021" +
      " \001(\005\022\026\n\016solution_limit\030\010 \001(\003\022-\n\ntime_lim" +
      "it\030\t \001(\0132\031.google.protobuf.Duration\0221\n\016l" +
      "ns_time_limit\030\n \001(\0132\031.google.protobuf.Du" +
      "ration\022s\n\034improvement_limit_parameters\030%" +
      " \001(\0132M.operations_research.RoutingSearch" +
      "Parameters.ImprovementSearchLimitParamet" +
      "ers\022\034\n\024use_full_propagation\030\013 \001(\010\022\022\n\nlog" +
      "_search\030\r \001(\010\022\037\n\027log_cost_scaling_factor" +
      "\030\026 \001(\001\022\027\n\017log_cost_offset\030\035 \001(\001\022\017\n\007log_t" +
      "ag\030$ \001(\t\032\327\022\n LocalSearchNeighborhoodOper" +
      "ators\022:\n\014use_relocate\030\001 \001(\0162$.operations" +
      "_research.OptionalBoolean\022?\n\021use_relocat" +
      "e_pair\030\002 \001(\0162$.operations_research.Optio" +
      "nalBoolean\022E\n\027use_light_relocate_pair\030\030 " +
      "\001(\0162$.operations_research.OptionalBoolea" +
      "n\022D\n\026use_relocate_neighbors\030\003 \001(\0162$.oper" +
      "ations_research.OptionalBoolean\022B\n\024use_r" +
      "elocate_subtrip\030\031 \001(\0162$.operations_resea" +
      "rch.OptionalBoolean\022:\n\014use_exchange\030\004 \001(" +
      "\0162$.operations_research.OptionalBoolean\022" +
      "?\n\021use_exchange_pair\030\026 \001(\0162$.operations_" +
      "research.OptionalBoolean\022B\n\024use_exchange" +
      "_subtrip\030\032 \001(\0162$.operations_research.Opt" +
      "ionalBoolean\0227\n\tuse_cross\030\005 \001(\0162$.operat" +
      "ions_research.OptionalBoolean\022@\n\022use_cro" +
      "ss_exchange\030\006 \001(\0162$.operations_research." +
      "OptionalBoolean\022J\n\034use_relocate_expensiv" +
      "e_chain\030\027 \001(\0162$.operations_research.Opti" +
      "onalBoolean\0229\n\013use_two_opt\030\007 \001(\0162$.opera" +
      "tions_research.OptionalBoolean\0228\n\nuse_or" +
      "_opt\030\010 \001(\0162$.operations_research.Optiona" +
      "lBoolean\022?\n\021use_lin_kernighan\030\t \001(\0162$.op" +
      "erations_research.OptionalBoolean\0229\n\013use" +
      "_tsp_opt\030\n \001(\0162$.operations_research.Opt" +
      "ionalBoolean\022=\n\017use_make_active\030\013 \001(\0162$." +
      "operations_research.OptionalBoolean\022J\n\034u" +
      "se_relocate_and_make_active\030\025 \001(\0162$.oper" +
      "ations_research.OptionalBoolean\022?\n\021use_m" +
      "ake_inactive\030\014 \001(\0162$.operations_research" +
      ".OptionalBoolean\022E\n\027use_make_chain_inact" +
      "ive\030\r \001(\0162$.operations_research.Optional" +
      "Boolean\022=\n\017use_swap_active\030\016 \001(\0162$.opera" +
      "tions_research.OptionalBoolean\022F\n\030use_ex" +
      "tended_swap_active\030\017 \001(\0162$.operations_re" +
      "search.OptionalBoolean\022G\n\031use_node_pair_" +
      "swap_active\030\024 \001(\0162$.operations_research." +
      "OptionalBoolean\022:\n\014use_path_lns\030\020 \001(\0162$." +
      "operations_research.OptionalBoolean\022?\n\021u" +
      "se_full_path_lns\030\021 \001(\0162$.operations_rese" +
      "arch.OptionalBoolean\0229\n\013use_tsp_lns\030\022 \001(" +
      "\0162$.operations_research.OptionalBoolean\022" +
      ">\n\020use_inactive_lns\030\023 \001(\0162$.operations_r" +
      "esearch.OptionalBoolean\022T\n&use_global_ch" +
      "eapest_insertion_path_lns\030\033 \001(\0162$.operat" +
      "ions_research.OptionalBoolean\022S\n%use_loc" +
      "al_cheapest_insertion_path_lns\030\034 \001(\0162$.o" +
      "perations_research.OptionalBoolean\022l\n>us" +
      "e_relocate_path_global_cheapest_insertio" +
      "n_insert_unperformed\030! \001(\0162$.operations_" +
      "research.OptionalBoolean\022_\n1use_global_c" +
      "heapest_insertion_expensive_chain_lns\030\035 " +
      "\001(\0162$.operations_research.OptionalBoolea" +
      "n\022^\n0use_local_cheapest_insertion_expens" +
      "ive_chain_lns\030\036 \001(\0162$.operations_researc" +
      "h.OptionalBoolean\022[\n-use_global_cheapest" +
      "_insertion_close_nodes_lns\030\037 \001(\0162$.opera" +
      "tions_research.OptionalBoolean\022Z\n,use_lo" +
      "cal_cheapest_insertion_close_nodes_lns\030 " +
      " \001(\0162$.operations_research.OptionalBoole" +
      "an\032u\n ImprovementSearchLimitParameters\022$" +
      "\n\034improvement_rate_coefficient\030& \001(\001\022+\n#" +
      "improvement_rate_solutions_distance\030\' \001(" +
      "\005\"3\n\020SchedulingSolver\022\t\n\005UNSET\020\000\022\010\n\004GLOP" +
      "\020\001\022\n\n\006CP_SAT\020\002\"\250\001\n\026RoutingModelParameter" +
      "s\022J\n\021solver_parameters\030\001 \001(\0132/.operation" +
      "s_research.ConstraintSolverParameters\022!\n" +
      "\031reduce_vehicle_cost_model\030\002 \001(\010\022\037\n\027max_" +
      "callback_cache_size\030\003 \001(\005BI\n#com.google." +
      "ortools.constraintsolverP\001\252\002\037Google.OrTo" +
      "ols.ConstraintSolverb\006proto3"
    };
    descriptor = com.google.protobuf.Descriptors.FileDescriptor
      .internalBuildGeneratedFileFrom(descriptorData,
        new com.google.protobuf.Descriptors.FileDescriptor[] {
          com.google.protobuf.DurationProto.getDescriptor(),
          com.google.ortools.constraintsolver.RoutingEnums.getDescriptor(),
          com.google.ortools.constraintsolver.SolverParameters.getDescriptor(),
          com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor(),
        });
    internal_static_operations_research_RoutingSearchParameters_descriptor =
      getDescriptor().getMessageTypes().get(0);
    internal_static_operations_research_RoutingSearchParameters_fieldAccessorTable = new
      com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
        internal_static_operations_research_RoutingSearchParameters_descriptor,
        new java.lang.String[] { "FirstSolutionStrategy", "UseUnfilteredFirstSolutionStrategy", "SavingsNeighborsRatio", "SavingsMaxMemoryUsageBytes", "SavingsAddReverseArcs", "SavingsArcCoefficient", "SavingsParallelRoutes", "CheapestInsertionFarthestSeedsRatio", "CheapestInsertionFirstSolutionNeighborsRatio", "CheapestInsertionLsOperatorNeighborsRatio", "CheapestInsertionAddUnperformedEntries", "ChristofidesUseMinimumMatching", "LocalSearchOperators", "UseMultiArmedBanditConcatenateOperators", "MultiArmedBanditCompoundOperatorMemoryCoefficient", "MultiArmedBanditCompoundOperatorExplorationCoefficient", "RelocateExpensiveChainNumArcsToConsider", "HeuristicExpensiveChainLnsNumArcsToConsider", "HeuristicCloseNodesLnsNumNodes", "LocalSearchMetaheuristic", "GuidedLocalSearchLambdaCoefficient", "UseDepthFirstSearch", "UseCp", "UseCpSat", "ContinuousSchedulingSolver", "MixedIntegerSchedulingSolver", "OptimizationStep", "NumberOfSolutionsToCollect", "SolutionLimit", "TimeLimit", "LnsTimeLimit", "ImprovementLimitParameters", "UseFullPropagation", "LogSearch", "LogCostScalingFactor", "LogCostOffset", "LogTag", });
    internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor =
      internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedTypes().get(0);
    internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_fieldAccessorTable = new
      com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
        internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor,
        new java.lang.String[] { "UseRelocate", "UseRelocatePair", "UseLightRelocatePair", "UseRelocateNeighbors", "UseRelocateSubtrip", "UseExchange", "UseExchangePair", "UseExchangeSubtrip", "UseCross", "UseCrossExchange", "UseRelocateExpensiveChain", "UseTwoOpt", "UseOrOpt", "UseLinKernighan", "UseTspOpt", "UseMakeActive", "UseRelocateAndMakeActive", "UseMakeInactive", "UseMakeChainInactive", "UseSwapActive", "UseExtendedSwapActive", "UseNodePairSwapActive", "UsePathLns", "UseFullPathLns", "UseTspLns", "UseInactiveLns", "UseGlobalCheapestInsertionPathLns", "UseLocalCheapestInsertionPathLns", "UseRelocatePathGlobalCheapestInsertionInsertUnperformed", "UseGlobalCheapestInsertionExpensiveChainLns", "UseLocalCheapestInsertionExpensiveChainLns", "UseGlobalCheapestInsertionCloseNodesLns", "UseLocalCheapestInsertionCloseNodesLns", });
    internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor =
      internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedTypes().get(1);
    internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_fieldAccessorTable = new
      com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
        internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor,
        new java.lang.String[] { "ImprovementRateCoefficient", "ImprovementRateSolutionsDistance", });
    internal_static_operations_research_RoutingModelParameters_descriptor =
      getDescriptor().getMessageTypes().get(1);
    internal_static_operations_research_RoutingModelParameters_fieldAccessorTable = new
      com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
        internal_static_operations_research_RoutingModelParameters_descriptor,
        new java.lang.String[] { "SolverParameters", "ReduceVehicleCostModel", "MaxCallbackCacheSize", });
    com.google.protobuf.DurationProto.getDescriptor();
    com.google.ortools.constraintsolver.RoutingEnums.getDescriptor();
    com.google.ortools.constraintsolver.SolverParameters.getDescriptor();
    com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor();
  }
 
  // @@protoc_insertion_point(outer_class_scope)
}