| Calling Sequence
| ComputeCubicTSP(Dist,trials,p1..pk)
|
| Parameters
| | Name | Type | Description |
|
| Dist
| matrix(nonnegative) | symmetric, square, distance matrix |
| trials
| posint | number of random starting points (optional) |
| p1..pk
| list(posint) | optional good solutions |
|
| Return Type
| list(posint) |
| Synopsis
| Compute a minimum distance cycle (symmetric travelling
salesman problem) with a heuristic O(n^3) algorithm.
The second argument is optional. If present it indicates the number
of (random starting points) trials that will be computed; the best
cycle/tour of these will be returned.
The third ... kth arguments are also optional and are
permutations of integers which are good solutions to the TSP
problem. These will be used as seeds to build new (better) solutions.
This is the default function used by ComputeTSP. It should be used
only when you can provide initial good solutions or a different
number of trials is desired. |
| See also
| ComputeTSP |