- class VehicleRouting(graph, num_vehicles=2, depot=0)[ソース]¶
Optimization application for the 「vehicle routing problem」  based on a
: 「Vehicle routing problem」, https://en.wikipedia.org/wiki/Vehicle_routing_problem
List]) – A graph representing a problem. It can be specified directly as a NetworkX graph, or as an array or list format suitable to build out a NetworkX graph.
int) – The number of vehicles
int) – The index of the depot node where all the vehicle depart
Getter of depot
Getter of num_vehicles
create_random_instance(n[, low, high, seed, ...])
Create a random instance of the vehicle routing problem.
Interpret a result as a list of the routes for each vehicle
Convert a vehicle routing problem instance into a