Home
last modified time | relevance | path

Searched refs:routing_model (Results 1 – 25 of 29) sorted by relevance

12

/dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/
H A Drouting_filters.cc72 routing_model_(routing_model), in MaxActiveVehiclesFilter()
125 const RoutingModel& routing_model) { in MakeMaxActiveVehiclesFilter() argument
138 routing_model_(routing_model), in NodeDisjunctionFilter()
554 routing_model.Size() + routing_model.vehicles()), in VehicleAmortizedCostFilter()
871 start_to_end_[routing_model.Start(i)] = routing_model.End(i); in ChainCumulFilter()
1235 routing_model_(routing_model), in PathCumulFilter()
2466 routing_model.Nexts(), routing_model.Size() + routing_model.vehicles(), in MakePickupDeliveryFilter()
2492 routing_model.Size() + routing_model.vehicles()), in VehicleVarFilter()
2536 return routing_model.solver()->RevAlloc(new VehicleVarFilter(routing_model)); in MakeVehicleVarFilter()
2990 model_(routing_model), in CPFeasibilityFilter()
[all …]
H A Drouting_filters.h32 const RoutingModel& routing_model);
36 const RoutingModel& routing_model, bool filter_cost);
40 const RoutingModel& routing_model);
44 const RoutingModel& routing_model);
49 const RoutingModel& routing_model, const RoutingModel::IndexPairs& pairs,
54 const RoutingModel& routing_model);
80 IntVarLocalSearchFilter* MakeCPFeasibilityFilter(RoutingModel* routing_model);
H A Drouting_breaks.cc974 VehicleBreaksFilter(const RoutingModel& routing_model,
1000 VehicleBreaksFilter::VehicleBreaksFilter(const RoutingModel& routing_model, in VehicleBreaksFilter() argument
1002 : BasePathFilter(routing_model.Nexts(), in VehicleBreaksFilter()
1003 routing_model.Size() + routing_model.vehicles()), in VehicleBreaksFilter()
1004 model_(routing_model), in VehicleBreaksFilter()
1008 for (int i = 0; i < routing_model.vehicles(); ++i) { in VehicleBreaksFilter()
1009 start_to_vehicle_[routing_model.Start(i)] = i; in VehicleBreaksFilter()
1078 const RoutingModel& routing_model, const RoutingDimension& dimension) { in MakeVehicleBreaksFilter() argument
1079 return routing_model.solver()->RevAlloc( in MakeVehicleBreaksFilter()
1080 new VehicleBreaksFilter(routing_model, dimension)); in MakeVehicleBreaksFilter()
H A Drouting_search.cc766 const RoutingModel& routing_model = *model(); in ComputeNeighborhoods() local
767 const int64_t size = routing_model.Size(); in ComputeNeighborhoods()
769 const int num_cost_classes = routing_model.GetCostClassesCount(); in ComputeNeighborhoods()
779 DCHECK(!routing_model.IsEnd(node_index)); in ComputeNeighborhoods()
780 if (routing_model.IsStart(node_index)) { in ComputeNeighborhoods()
788 if (!routing_model.HasVehicleWithCostClassIndex( in ComputeNeighborhoods()
799 std::make_pair(routing_model.GetArcCostForClass( in ComputeNeighborhoods()
814 DCHECK(!routing_model.IsEnd(neighbor) && in ComputeNeighborhoods()
815 !routing_model.IsStart(neighbor)); in ComputeNeighborhoods()
820 for (int vehicle = 0; vehicle < routing_model.vehicles(); vehicle++) { in ComputeNeighborhoods()
[all …]
/dports/math/py-or-tools/or-tools-9.2/examples/notebook/constraint_solver/
H A Dsimple_routing_program.ipynb113 "# [START routing_model]\n",
116 "# [END routing_model]\n",
H A Dtsp_cities.ipynb155 "# [START routing_model]\n",
158 "# [END routing_model]\n",
H A Dtsp_distance_matrix.ipynb210 "# [START routing_model]\n",
213 "# [END routing_model]\n",
H A Dvrp_with_time_limit.ipynb136 "# [START routing_model]\n",
139 "# [END routing_model]\n",
H A Dvrp_starts_ends.ipynb219 "# [START routing_model]\n",
222 "# [END routing_model]\n",
H A Dtsp_circuit_board.ipynb209 "# [START routing_model]\n",
211 "# [END routing_model]\n",
H A Dtsp.ipynb184 "# [START routing_model]\n",
186 "# [END routing_model]\n",
H A Dvrp.ipynb224 "# [START routing_model]\n",
227 "# [END routing_model]\n",
H A Dvrp_pickup_delivery.ipynb227 "# [START routing_model]\n",
230 "# [END routing_model]\n",
H A Dvrp_pickup_delivery_fifo.ipynb227 "# [START routing_model]\n",
230 "# [END routing_model]\n",
H A Dvrp_global_span.ipynb224 "# [START routing_model]\n",
227 "# [END routing_model]\n",
H A Dvrp_initial_routes.ipynb223 "# [START routing_model]\n",
226 "# [END routing_model]\n",
H A Dvrp_pickup_delivery_lifo.ipynb227 "# [START routing_model]\n",
230 "# [END routing_model]\n",
H A Dvrp_time_windows.ipynb187 "# [START routing_model]\n",
190 "# [END routing_model]\n",
H A Dvrp_capacity.ipynb227 "# [START routing_model]\n",
230 "# [END routing_model]\n",
H A Dvrp_breaks.ipynb190 "# [START routing_model]\n",
192 "# [END routing_model]\n",
H A Dvrp_drop_nodes.ipynb236 "# [START routing_model]\n",
239 "# [END routing_model]\n",
H A Dvrpgs.ipynb230 "# [START routing_model]\n",
232 "# [END routing_model]\n",
H A Dvrp_breaks_from_start.ipynb194 "# [START routing_model]\n",
196 "# [END routing_model]\n",
H A Dvrp_resources.ipynb192 "# [START routing_model]\n",
195 "# [END routing_model]\n",
H A Dvrptw_store_solution_data.ipynb228 "# [START routing_model]\n",
231 "# [END routing_model]\n",

12