![]() |
Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
|
Generated protocol buffer code.
Variables | |
| _sym_db = _symbol_database.Default() | |
| DESCRIPTOR = _descriptor_pool.Default().AddSerializedFile(b'\n<ortools/constraint_solver/routing_heuristic_parameters.proto\x12\x13operations_research\"\xe6\x06\n LocalCheapestInsertionParameters\x12m\n\x18pickup_delivery_strategy\x18\x01 \x01(\x0e\x32K.operations_research.LocalCheapestInsertionParameters.PairInsertionStrategy\x12t\n\x1cinsertion_sorting_properties\x18\x02 \x03(\x0e\x32N.operations_research.LocalCheapestInsertionParameters.InsertionSortingProperty\"\x92\x01\n\x15PairInsertionStrategy\x12\r\n\tAUTOMATIC\x10\x00\x12\"\n\x1e\x42\x45ST_PICKUP_THEN_BEST_DELIVERY\x10\x01\x12\x1d\n\x19\x42\x45ST_PICKUP_DELIVERY_PAIR\x10\x02\x12\'\n#BEST_PICKUP_DELIVERY_PAIR_MULTITOUR\x10\x03\"\xc7\x03\n\x18InsertionSortingProperty\x12 \n\x1cSORTING_PROPERTY_UNSPECIFIED\x10\x00\x12%\n!SORTING_PROPERTY_ALLOWED_VEHICLES\x10\x01\x12\x1c\n\x18SORTING_PROPERTY_PENALTY\x10\x02\x12\x38\n4SORTING_PROPERTY_PENALTY_OVER_ALLOWED_VEHICLES_RATIO\x10\x03\x12?\n;SORTING_PROPERTY_HIGHEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS\x10\x04\x12>\n:SORTING_PROPERTY_LOWEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS\x10\x05\x12>\n:SORTING_PROPERTY_LOWEST_MIN_ARC_COST_TO_VEHICLE_START_ENDS\x10\x06\x12,\n(SORTING_PROPERTY_HIGHEST_DIMENSION_USAGE\x10\x07\x12\x1b\n\x17SORTING_PROPERTY_RANDOM\x10\x08\"\x7f\n\x11SavingsParameters\x12\x17\n\x0fneighbors_ratio\x18\x01 \x01(\x01\x12\x1e\n\x16max_memory_usage_bytes\x18\x02 \x01(\x01\x12\x18\n\x10\x61\x64\x64_reverse_arcs\x18\x03 \x01(\x08\x12\x17\n\x0f\x61rc_coefficient\x18\x04 \x01(\x01\"\xc2\x01\n!GlobalCheapestInsertionParameters\x12\x1c\n\x14\x66\x61rthest_seeds_ratio\x18\x01 \x01(\x01\x12\x17\n\x0fneighbors_ratio\x18\x02 \x01(\x01\x12\x15\n\rmin_neighbors\x18\x03 \x01(\x05\x12.\n&use_neighbors_ratio_for_initialization\x18\x06 \x01(\x08\x12\x1f\n\x17\x61\x64\x64_unperformed_entries\x18\x07 \x01(\x08\x42I\n#com.google.ortools.constraintsolverP\x01\xaa\x02\x1fGoogle.OrTools.ConstraintSolverb\x06proto3') | |
| _globals = globals() | |
| _loaded_options | |
| _serialized_options | |
| _serialized_start | |
| _serialized_end | |
|
protected |
Definition at line 29 of file routing_heuristic_parameters_pb2.py.
|
protected |
Definition at line 33 of file routing_heuristic_parameters_pb2.py.
|
protected |
Definition at line 36 of file routing_heuristic_parameters_pb2.py.
|
protected |
Definition at line 34 of file routing_heuristic_parameters_pb2.py.
|
protected |
Definition at line 35 of file routing_heuristic_parameters_pb2.py.
|
protected |
Definition at line 22 of file routing_heuristic_parameters_pb2.py.
| ortools.constraint_solver.routing_heuristic_parameters_pb2.DESCRIPTOR = _descriptor_pool.Default().AddSerializedFile(b'\n<ortools/constraint_solver/routing_heuristic_parameters.proto\x12\x13operations_research\"\xe6\x06\n LocalCheapestInsertionParameters\x12m\n\x18pickup_delivery_strategy\x18\x01 \x01(\x0e\x32K.operations_research.LocalCheapestInsertionParameters.PairInsertionStrategy\x12t\n\x1cinsertion_sorting_properties\x18\x02 \x03(\x0e\x32N.operations_research.LocalCheapestInsertionParameters.InsertionSortingProperty\"\x92\x01\n\x15PairInsertionStrategy\x12\r\n\tAUTOMATIC\x10\x00\x12\"\n\x1e\x42\x45ST_PICKUP_THEN_BEST_DELIVERY\x10\x01\x12\x1d\n\x19\x42\x45ST_PICKUP_DELIVERY_PAIR\x10\x02\x12\'\n#BEST_PICKUP_DELIVERY_PAIR_MULTITOUR\x10\x03\"\xc7\x03\n\x18InsertionSortingProperty\x12 \n\x1cSORTING_PROPERTY_UNSPECIFIED\x10\x00\x12%\n!SORTING_PROPERTY_ALLOWED_VEHICLES\x10\x01\x12\x1c\n\x18SORTING_PROPERTY_PENALTY\x10\x02\x12\x38\n4SORTING_PROPERTY_PENALTY_OVER_ALLOWED_VEHICLES_RATIO\x10\x03\x12?\n;SORTING_PROPERTY_HIGHEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS\x10\x04\x12>\n:SORTING_PROPERTY_LOWEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS\x10\x05\x12>\n:SORTING_PROPERTY_LOWEST_MIN_ARC_COST_TO_VEHICLE_START_ENDS\x10\x06\x12,\n(SORTING_PROPERTY_HIGHEST_DIMENSION_USAGE\x10\x07\x12\x1b\n\x17SORTING_PROPERTY_RANDOM\x10\x08\"\x7f\n\x11SavingsParameters\x12\x17\n\x0fneighbors_ratio\x18\x01 \x01(\x01\x12\x1e\n\x16max_memory_usage_bytes\x18\x02 \x01(\x01\x12\x18\n\x10\x61\x64\x64_reverse_arcs\x18\x03 \x01(\x08\x12\x17\n\x0f\x61rc_coefficient\x18\x04 \x01(\x01\"\xc2\x01\n!GlobalCheapestInsertionParameters\x12\x1c\n\x14\x66\x61rthest_seeds_ratio\x18\x01 \x01(\x01\x12\x17\n\x0fneighbors_ratio\x18\x02 \x01(\x01\x12\x15\n\rmin_neighbors\x18\x03 \x01(\x05\x12.\n&use_neighbors_ratio_for_initialization\x18\x06 \x01(\x08\x12\x1f\n\x17\x61\x64\x64_unperformed_entries\x18\x07 \x01(\x08\x42I\n#com.google.ortools.constraintsolverP\x01\xaa\x02\x1fGoogle.OrTools.ConstraintSolverb\x06proto3') |
Definition at line 27 of file routing_heuristic_parameters_pb2.py.