lau15 {xega}

The problem environment lau15

Description

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

Usage

lau15

Format

An object of class list of length 12.

References

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

See Also

Other Problem Environment: NewEnvXOR(), Parabola2DEarly, Parabola2D

Examples

names(lau15)
lau15$genelength()