Description Usage Arguments Value
We aim to minimize the tour length and the number of unvisited customers with later requests in time. Note: tour length depends not only on the edge costs, i.e., driving from customer i to j, but on the release dates of j too. So given a tour t1,t2,...,tk we end up with the following recursive formulation f(t1,tj) = max(f(t1,t(j-1)), r[j]) + d[i, j].
1 | fitness.fun(ind, instance)
|
ind |
[ |
instance |
[ |
[numeric(2)
] Vector of tour length and number of
unvisited dynamic customers.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.