- class VehicleRouting(graph, num_vehicles=2, depot=0)[fuente]¶
Optimization application for the «vehicle routing problem»  based on a
: «Vehicle routing problem», https://en.wikipedia.org/wiki/Vehicle_routing_problem
Getter of depot
Getter of the graph
Getter of num_vehicles
create_random_instance(n[, low, high, seed, ...])
Create a random instance of the vehicle routing problem.
Draw a graph with the result.
Interpret a result as a list of the routes for each vehicle
random_graph(num_nodes, num_edges[, seed])
- param num_nodes:
The number of nodes in a graph
Compute the most likely binary string from state vector.
Convert a vehicle routing problem instance into a