lau15 {xegaSelectGene}

The problem environment lau15 for a traveling salesman problem.

Description

15 abstract cities for which a traveling salesman solution is sought. Solution: A path with a length of 291.

The problem environment lau15 is a list with the following functions:

1. lau15$name(): "lau15", the name of the TSP problem environment.

2. lau15$genelength(): 15, the number of cities on the round trip.

3. lau15$dist(): The distance matrix of the problem.

4. lau15$cities(): A list of city names or the vector 1:lau15$genelength().

5. lau15$f (permutation, gene = 0, lF = 0, tour = TRUE): The fitness function. Computes the roundtrip for permutation of cities.

6. lau15$solution(): 291, the known optimal solution of lau15.

7. lau15$path(): The permutation for the optimal roundtrip.

8. lau15$show(p): Prints the roundtrip p.

9. lau15$greedy(startposition, k): Computes a path of length k starting at startposition by choosing the nearest city.

10. lau15$kBestGreedy(k, tour=TRUE): Computes the best greedy path/tour with k cities.

11. lau15$rnd2Opt(permutation, maxtries=5): Tries to find a better permutation by at most 5 random 2-opt heuristics.

12. lau15$LinKernighan(permutation, maxtries=5): A randomized Lin-Kernigan heuristic implemented as a sequence of randomized 2-opt moves.

Usage

lau15

Format

An object of class list of length 12.

References

Lau, H. T. (1986): Combinatorial Heuristic Algorithms in FORTRAN. Springer, 1986. p. 61. <doi:10.1007/978-3-642-61649-5>

See Also

Other Problem Environments: DeJongF4Factory(), DelayedPFactory(), Parabola2DEarlyFactory(), Parabola2DErrFactory(), Parabola2DFactory(), envXOR, newEnvXOR(), newTSP()