Creates a benchmark function for the (Asymmetric) Travelling Salesperson Problem. Path (Do not return to start of tour. Start and end of tour not fixed.) or Cycle (Return to start of tour). Symmetry depends on supplied distance matrix.
Matrix that collects the distances between travelled locations.
Can be "Cycle" (return to start, default) or "Path" (no return to start).
the function of type cost=f(permutation)
1 2 3 4 5 6 7 8 9 10 11 12 13 14
set.seed(1) #create 5 random locations to be part of a tour n=5 cities <- matrix(runif(2*n),,2) #calculate distances between cities cdist <- as.matrix(dist(cities)) #create objective functions (for path or cycle) fun1 <- benchmarkGeneratorTSP(cdist, "Path") fun2 <- benchmarkGeneratorTSP(cdist, "Cycle") #evaluate fun1(1:n) fun1(n:1) fun2(n:1) fun2(1:n)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.