powered by
Some variants of the Vehicle Routing Problem (VRP) consider static as well as dynamic customers (nodes). This function takes a Network and dynamises it, i. e., it adds dynamic arrival times to the customers via a Poisson process.
Network
dynamise(x, n.dynamic = NULL, dyn.customers.ratio = NULL, arrival.limit)
[Network] Network.
[integer(1) | NULL] Number of nodes, which should become dynamic. Ignored if dyn.customers.ratio is not NULL.
dyn.customers.ratio
NULL
[numeric(1) | NULL] Ratio of dynamic nodes. If this is set to a numeric value in (0, 1), the parameter n.dynamic is ignored.
n.dynamic
[numeric(1)] Maximal arrival time.
[Network] Modified network (now has an additional list element 'arrival.times') and the ratio of dynamic customers as an attribute.
generateRandomNetwork, generateClusteredNetwork, generateGridNetwork
generateRandomNetwork
generateClusteredNetwork
generateGridNetwork
# NOT RUN { x = generateClusteredNetwork(n.points = 100L, n.cluster = 4L, upper = 100, n.depots = 2L) x = dynamise(x, dyn.customers.ratio = 0.3, arrival.limit = 400) print(x) # }
Run the code above in your browser using DataLab