RoutingParameters.java

Go to the documentation of this file.

// Generated by the protocol buffer compiler.  DO NOT EDIT!
// NO CHECKED-IN PROTOBUF GENCODE
// source: ortools/constraint_solver/routing_parameters.proto
// Protobuf Java Version: 4.29.3
 
package com.google.ortools.constraintsolver;
 
public final class RoutingParameters {
  private RoutingParameters() {}
  static {
    com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
      com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
      /* major= */ 4,
      /* minor= */ 29,
      /* patch= */ 3,
      /* suffix= */ "",
      RoutingParameters.class.getName());
  }
  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.GeneratedMessage.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.GeneratedMessage.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.GeneratedMessage.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.GeneratedMessage.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\032+ortool" +
      "s/constraint_solver/routing_ils.proto\0321o" +
      "rtools/constraint_solver/solver_paramete" +
      "rs.proto\032 ortools/sat/sat_parameters.pro" +
      "to\032#ortools/util/optional_boolean.proto\"" +
      "\2727\n\027RoutingSearchParameters\022Q\n\027first_sol" +
      "ution_strategy\030\001 \001(\01620.operations_resear" +
      "ch.FirstSolutionStrategy.Value\022.\n&use_un" +
      "filtered_first_solution_strategy\030\002 \001(\010\022\037" +
      "\n\027savings_neighbors_ratio\030\016 \001(\001\022&\n\036savin" +
      "gs_max_memory_usage_bytes\030\027 \001(\001\022 \n\030savin" +
      "gs_add_reverse_arcs\030\017 \001(\010\022\037\n\027savings_arc" +
      "_coefficient\030\022 \001(\001\022/\n\'cheapest_insertion" +
      "_farthest_seeds_ratio\030\020 \001(\001\0229\n1cheapest_" +
      "insertion_first_solution_neighbors_ratio" +
      "\030\025 \001(\001\0227\n/cheapest_insertion_first_solut" +
      "ion_min_neighbors\030, \001(\005\0226\n.cheapest_inse" +
      "rtion_ls_operator_neighbors_ratio\030\037 \001(\001\022" +
      "4\n,cheapest_insertion_ls_operator_min_ne" +
      "ighbors\030- \001(\005\022P\nHcheapest_insertion_firs" +
      "t_solution_use_neighbors_ratio_for_initi" +
      "alization\030. \001(\010\0222\n*cheapest_insertion_ad" +
      "d_unperformed_entries\030( \001(\010\022}\n1local_che" +
      "apest_insertion_pickup_delivery_strategy" +
      "\0301 \001(\0162B.operations_research.RoutingSear" +
      "chParameters.PairInsertionStrategy\022\202\001\n6l" +
      "ocal_cheapest_cost_insertion_pickup_deli" +
      "very_strategy\0307 \001(\0162B.operations_researc" +
      "h.RoutingSearchParameters.PairInsertionS" +
      "trategy\022z\n+local_cheapest_insertion_sort" +
      "ing_properties\030C \003(\0162E.operations_resear" +
      "ch.RoutingSearchParameters.InsertionSort" +
      "ingProperty\022)\n!christofides_use_minimum_" +
      "matching\030\036 \001(\010\022*\n\"first_solution_optimiz" +
      "ation_period\030; \001(\005\022m\n\026local_search_opera" +
      "tors\030\003 \001(\0132M.operations_research.Routing" +
      "SearchParameters.LocalSearchNeighborhood" +
      "Operators\022#\n\033ls_operator_neighbors_ratio" +
      "\0305 \001(\001\022!\n\031ls_operator_min_neighbors\0306 \001(" +
      "\005\0224\n,use_multi_armed_bandit_concatenate_" +
      "operators\030) \001(\010\022?\n7multi_armed_bandit_co" +
      "mpound_operator_memory_coefficient\030* \001(\001" +
      "\022D\n<multi_armed_bandit_compound_operator" +
      "_exploration_coefficient\030+ \001(\001\022\"\n\032max_sw" +
      "ap_active_chain_size\030B \001(\005\0225\n-relocate_e" +
      "xpensive_chain_num_arcs_to_consider\030\024 \001(" +
      "\005\022:\n2heuristic_expensive_chain_lns_num_a" +
      "rcs_to_consider\030  \001(\005\022+\n#heuristic_close" +
      "_nodes_lns_num_nodes\030# \001(\005\022W\n\032local_sear" +
      "ch_metaheuristic\030\004 \001(\01623.operations_rese" +
      "arch.LocalSearchMetaheuristic.Value\022X\n\033l" +
      "ocal_search_metaheuristics\030? \003(\01623.opera" +
      "tions_research.LocalSearchMetaheuristic." +
      "Value\0228\n0num_max_local_optima_before_met" +
      "aheuristic_switch\030@ \001(\005\022.\n&guided_local_" +
      "search_lambda_coefficient\030\005 \001(\001\022@\n8guide" +
      "d_local_search_reset_penalties_on_new_be" +
      "st_solution\0303 \001(\010\0229\n1guided_local_search" +
      "_penalize_with_vehicle_classes\030= \001(\010\022C\n;" +
      "use_guided_local_search_penalties_in_loc" +
      "al_search_operators\030> \001(\010\022\036\n\026use_depth_f" +
      "irst_search\030\006 \001(\010\0224\n\006use_cp\030\034 \001(\0162$.oper" +
      "ations_research.OptionalBoolean\0228\n\nuse_c" +
      "p_sat\030\033 \001(\0162$.operations_research.Option" +
      "alBoolean\022D\n\026use_generalized_cp_sat\030/ \001(" +
      "\0162$.operations_research.OptionalBoolean\022" +
      ">\n\016sat_parameters\0300 \001(\0132&.operations_res" +
      "earch.sat.SatParameters\022,\n$report_interm" +
      "ediate_cp_sat_solutions\0308 \001(\010\022)\n!fallbac" +
      "k_to_cp_sat_size_threshold\0304 \001(\005\022c\n\034cont" +
      "inuous_scheduling_solver\030! \001(\0162=.operati" +
      "ons_research.RoutingSearchParameters.Sch" +
      "edulingSolver\022f\n\037mixed_integer_schedulin" +
      "g_solver\030\" \001(\0162=.operations_research.Rou" +
      "tingSearchParameters.SchedulingSolver\022C\n" +
      "6disable_scheduling_beware_this_may_degr" +
      "ade_performance\0302 \001(\010H\000\210\001\001\022\031\n\021optimizati" +
      "on_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_limit\030\t \001(\0132\031.google.protobuf.Dura" +
      "tion\0221\n\016lns_time_limit\030\n \001(\0132\031.google.pr" +
      "otobuf.Duration\022%\n\035secondary_ls_time_lim" +
      "it_ratio\0309 \001(\001\022s\n\034improvement_limit_para" +
      "meters\030% \001(\0132M.operations_research.Routi" +
      "ngSearchParameters.ImprovementSearchLimi" +
      "tParameters\022\034\n\024use_full_propagation\030\013 \001(" +
      "\010\022\022\n\nlog_search\030\r \001(\010\022\037\n\027log_cost_scalin" +
      "g_factor\030\026 \001(\001\022\027\n\017log_cost_offset\030\035 \001(\001\022" +
      "\017\n\007log_tag\030$ \001(\t\022!\n\031use_iterated_local_s" +
      "earch\030: \001(\010\022\\\n iterated_local_search_par" +
      "ameters\030< \001(\01322.operations_research.Iter" +
      "atedLocalSearchParameters\032\332\025\n LocalSearc" +
      "hNeighborhoodOperators\022:\n\014use_relocate\030\001" +
      " \001(\0162$.operations_research.OptionalBoole" +
      "an\022?\n\021use_relocate_pair\030\002 \001(\0162$.operatio" +
      "ns_research.OptionalBoolean\022E\n\027use_light" +
      "_relocate_pair\030\030 \001(\0162$.operations_resear" +
      "ch.OptionalBoolean\022D\n\026use_relocate_neigh" +
      "bors\030\003 \001(\0162$.operations_research.Optiona" +
      "lBoolean\022B\n\024use_relocate_subtrip\030\031 \001(\0162$" +
      ".operations_research.OptionalBoolean\022:\n\014" +
      "use_exchange\030\004 \001(\0162$.operations_research" +
      ".OptionalBoolean\022?\n\021use_exchange_pair\030\026 " +
      "\001(\0162$.operations_research.OptionalBoolea" +
      "n\022B\n\024use_exchange_subtrip\030\032 \001(\0162$.operat" +
      "ions_research.OptionalBoolean\0227\n\tuse_cro" +
      "ss\030\005 \001(\0162$.operations_research.OptionalB" +
      "oolean\022@\n\022use_cross_exchange\030\006 \001(\0162$.ope" +
      "rations_research.OptionalBoolean\022J\n\034use_" +
      "relocate_expensive_chain\030\027 \001(\0162$.operati" +
      "ons_research.OptionalBoolean\0229\n\013use_two_" +
      "opt\030\007 \001(\0162$.operations_research.Optional" +
      "Boolean\0228\n\nuse_or_opt\030\010 \001(\0162$.operations" +
      "_research.OptionalBoolean\022?\n\021use_lin_ker" +
      "nighan\030\t \001(\0162$.operations_research.Optio" +
      "nalBoolean\0229\n\013use_tsp_opt\030\n \001(\0162$.operat" +
      "ions_research.OptionalBoolean\022=\n\017use_mak" +
      "e_active\030\013 \001(\0162$.operations_research.Opt" +
      "ionalBoolean\022J\n\034use_relocate_and_make_ac" +
      "tive\030\025 \001(\0162$.operations_research.Optiona" +
      "lBoolean\022J\n\034use_exchange_and_make_active" +
      "\030% \001(\0162$.operations_research.OptionalBoo" +
      "lean\022Z\n,use_exchange_path_start_ends_and" +
      "_make_active\030& \001(\0162$.operations_research" +
      ".OptionalBoolean\022?\n\021use_make_inactive\030\014 " +
      "\001(\0162$.operations_research.OptionalBoolea" +
      "n\022E\n\027use_make_chain_inactive\030\r \001(\0162$.ope" +
      "rations_research.OptionalBoolean\022=\n\017use_" +
      "swap_active\030\016 \001(\0162$.operations_research." +
      "OptionalBoolean\022C\n\025use_swap_active_chain" +
      "\030# \001(\0162$.operations_research.OptionalBoo" +
      "lean\022F\n\030use_extended_swap_active\030\017 \001(\0162$" +
      ".operations_research.OptionalBoolean\022K\n\035" +
      "use_shortest_path_swap_active\030\" \001(\0162$.op" +
      "erations_research.OptionalBoolean\022G\n\031use" +
      "_shortest_path_two_opt\030$ \001(\0162$.operation" +
      "s_research.OptionalBoolean\022G\n\031use_node_p" +
      "air_swap_active\030\024 \001(\0162$.operations_resea" +
      "rch.OptionalBoolean\022:\n\014use_path_lns\030\020 \001(" +
      "\0162$.operations_research.OptionalBoolean\022" +
      "?\n\021use_full_path_lns\030\021 \001(\0162$.operations_" +
      "research.OptionalBoolean\0229\n\013use_tsp_lns\030" +
      "\022 \001(\0162$.operations_research.OptionalBool" +
      "ean\022>\n\020use_inactive_lns\030\023 \001(\0162$.operatio" +
      "ns_research.OptionalBoolean\022T\n&use_globa" +
      "l_cheapest_insertion_path_lns\030\033 \001(\0162$.op" +
      "erations_research.OptionalBoolean\022S\n%use" +
      "_local_cheapest_insertion_path_lns\030\034 \001(\016" +
      "2$.operations_research.OptionalBoolean\022l" +
      "\n>use_relocate_path_global_cheapest_inse" +
      "rtion_insert_unperformed\030! \001(\0162$.operati" +
      "ons_research.OptionalBoolean\022_\n1use_glob" +
      "al_cheapest_insertion_expensive_chain_ln" +
      "s\030\035 \001(\0162$.operations_research.OptionalBo" +
      "olean\022^\n0use_local_cheapest_insertion_ex" +
      "pensive_chain_lns\030\036 \001(\0162$.operations_res" +
      "earch.OptionalBoolean\022[\n-use_global_chea" +
      "pest_insertion_close_nodes_lns\030\037 \001(\0162$.o" +
      "perations_research.OptionalBoolean\022Z\n,us" +
      "e_local_cheapest_insertion_close_nodes_l" +
      "ns\030  \001(\0162$.operations_research.OptionalB" +
      "oolean\032u\n ImprovementSearchLimitParamete" +
      "rs\022$\n\034improvement_rate_coefficient\030& \001(\001" +
      "\022+\n#improvement_rate_solutions_distance\030" +
      "\' \001(\005\"\222\001\n\025PairInsertionStrategy\022\r\n\tAUTOM" +
      "ATIC\020\000\022\"\n\036BEST_PICKUP_THEN_BEST_DELIVERY" +
      "\020\001\022\035\n\031BEST_PICKUP_DELIVERY_PAIR\020\002\022\'\n#BES" +
      "T_PICKUP_DELIVERY_PAIR_MULTITOUR\020\003\"\252\003\n\030I" +
      "nsertionSortingProperty\022 \n\034SORTING_PROPE" +
      "RTY_UNSPECIFIED\020\000\022%\n!SORTING_PROPERTY_AL" +
      "LOWED_VEHICLES\020\001\022\034\n\030SORTING_PROPERTY_PEN" +
      "ALTY\020\002\0228\n4SORTING_PROPERTY_PENALTY_OVER_" +
      "ALLOWED_VEHICLES_RATIO\020\003\022?\n;SORTING_PROP" +
      "ERTY_HIGHEST_AVG_ARC_COST_TO_VEHICLE_STA" +
      "RT_ENDS\020\004\022>\n:SORTING_PROPERTY_LOWEST_AVG" +
      "_ARC_COST_TO_VEHICLE_START_ENDS\020\005\022>\n:SOR" +
      "TING_PROPERTY_LOWEST_MIN_ARC_COST_TO_VEH" +
      "ICLE_START_ENDS\020\006\022,\n(SORTING_PROPERTY_HI" +
      "GHEST_DIMENSION_USAGE\020\007\"T\n\020SchedulingSol" +
      "ver\022\024\n\020SCHEDULING_UNSET\020\000\022\023\n\017SCHEDULING_" +
      "GLOP\020\001\022\025\n\021SCHEDULING_CP_SAT\020\002B9\n7_disabl" +
      "e_scheduling_beware_this_may_degrade_per" +
      "formanceJ\004\010\023\020\024J\004\010A\020B\"\250\001\n\026RoutingModelPar" +
      "ameters\022J\n\021solver_parameters\030\001 \001(\0132/.ope" +
      "rations_research.ConstraintSolverParamet" +
      "ers\022!\n\031reduce_vehicle_cost_model\030\002 \001(\010\022\037" +
      "\n\027max_callback_cache_size\030\003 \001(\005BI\n#com.g" +
      "oogle.ortools.constraintsolverP\001\252\002\037Googl" +
      "e.OrTools.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.RoutingIls.getDescriptor(),
          com.google.ortools.constraintsolver.SolverParameters.getDescriptor(),
          com.google.ortools.sat.SatParametersOuterClass.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.GeneratedMessage.FieldAccessorTable(
        internal_static_operations_research_RoutingSearchParameters_descriptor,
        new java.lang.String[] { "FirstSolutionStrategy", "UseUnfilteredFirstSolutionStrategy", "SavingsNeighborsRatio", "SavingsMaxMemoryUsageBytes", "SavingsAddReverseArcs", "SavingsArcCoefficient", "CheapestInsertionFarthestSeedsRatio", "CheapestInsertionFirstSolutionNeighborsRatio", "CheapestInsertionFirstSolutionMinNeighbors", "CheapestInsertionLsOperatorNeighborsRatio", "CheapestInsertionLsOperatorMinNeighbors", "CheapestInsertionFirstSolutionUseNeighborsRatioForInitialization", "CheapestInsertionAddUnperformedEntries", "LocalCheapestInsertionPickupDeliveryStrategy", "LocalCheapestCostInsertionPickupDeliveryStrategy", "LocalCheapestInsertionSortingProperties", "ChristofidesUseMinimumMatching", "FirstSolutionOptimizationPeriod", "LocalSearchOperators", "LsOperatorNeighborsRatio", "LsOperatorMinNeighbors", "UseMultiArmedBanditConcatenateOperators", "MultiArmedBanditCompoundOperatorMemoryCoefficient", "MultiArmedBanditCompoundOperatorExplorationCoefficient", "MaxSwapActiveChainSize", "RelocateExpensiveChainNumArcsToConsider", "HeuristicExpensiveChainLnsNumArcsToConsider", "HeuristicCloseNodesLnsNumNodes", "LocalSearchMetaheuristic", "LocalSearchMetaheuristics", "NumMaxLocalOptimaBeforeMetaheuristicSwitch", "GuidedLocalSearchLambdaCoefficient", "GuidedLocalSearchResetPenaltiesOnNewBestSolution", "GuidedLocalSearchPenalizeWithVehicleClasses", "UseGuidedLocalSearchPenaltiesInLocalSearchOperators", "UseDepthFirstSearch", "UseCp", "UseCpSat", "UseGeneralizedCpSat", "SatParameters", "ReportIntermediateCpSatSolutions", "FallbackToCpSatSizeThreshold", "ContinuousSchedulingSolver", "MixedIntegerSchedulingSolver", "DisableSchedulingBewareThisMayDegradePerformance", "OptimizationStep", "NumberOfSolutionsToCollect", "SolutionLimit", "TimeLimit", "LnsTimeLimit", "SecondaryLsTimeLimitRatio", "ImprovementLimitParameters", "UseFullPropagation", "LogSearch", "LogCostScalingFactor", "LogCostOffset", "LogTag", "UseIteratedLocalSearch", "IteratedLocalSearchParameters", });
    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.GeneratedMessage.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", "UseExchangeAndMakeActive", "UseExchangePathStartEndsAndMakeActive", "UseMakeInactive", "UseMakeChainInactive", "UseSwapActive", "UseSwapActiveChain", "UseExtendedSwapActive", "UseShortestPathSwapActive", "UseShortestPathTwoOpt", "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.GeneratedMessage.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.GeneratedMessage.FieldAccessorTable(
        internal_static_operations_research_RoutingModelParameters_descriptor,
        new java.lang.String[] { "SolverParameters", "ReduceVehicleCostModel", "MaxCallbackCacheSize", });
    descriptor.resolveAllFeaturesImmutable();
    com.google.protobuf.DurationProto.getDescriptor();
    com.google.ortools.constraintsolver.RoutingEnums.getDescriptor();
    com.google.ortools.constraintsolver.RoutingIls.getDescriptor();
    com.google.ortools.constraintsolver.SolverParameters.getDescriptor();
    com.google.ortools.sat.SatParametersOuterClass.getDescriptor();
    com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor();
  }
 
  // @@protoc_insertion_point(outer_class_scope)
}