Description Usage Arguments Value Note References
Inexact TSP solvers based the Lin-Kernigham heuristic.
1 2 3 4 5 6 7 | ## S3 method for class 'lkh'
run(solver, instance, seed = as.integer(ceiling(runif(1L) *
2^15)), cutoff.time = NULL, opt.tour.length = NULL,
max.trials = NULL, with.restarts = FALSE, full.matrix = FALSE,
verbose = FALSE, log.trajectory = TRUE, work.dir = NULL,
output.files.prefix = NULL, keep.output.files = FALSE,
more.args = list(), ...)
|
solver |
[ |
instance |
[ |
seed |
[ |
cutoff.time |
[ |
opt.tour.length |
[ |
max.trials |
[ |
with.restarts |
[ |
full.matrix |
[ |
verbose |
[ |
log.trajectory |
[ |
work.dir |
[ |
output.files.prefix |
[ |
keep.output.files |
[ |
more.args |
[ |
... |
[any] |
[TSPSolverResult
]
This solver requires integer inter-city distances.
Helsgaun, K. (2000). An effective implementation of the lin-kernighan traveling salesman heuristic. European Journal of Operational Research, 126:106-130.
Helsgaun, K. (2009). General k-opt submoves for the Lin-Kernighan TSP heuristic. Mathematical Programming Computation, 1(2-3):119-163.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.