| 摘要 |
PURPOSE: A method for judging the shortest distance by using a chaos time series is provided to judge the shortest course by calculating the distance according to the appointed order. CONSTITUTION: A method for judging the shortest distance by using a chaos time series uses a circuit, which indicates the distribution of six cities and on which city numbers from 0 to 5 are indicated. A time series of Z(t-4) of reduced quantum, £7| is changed into 0-15 and this arrangement is used. '0' is searched on the time series in case that the start point is '0' and from 1 to 5 are searched in order of a series after '0'. The shortest distance in this drawing is a circuit indicated with a dotted line, {0, 5, 4, 1, 2, 3, 0} or {0, 3, 2, 1, 4, 5, 0}.
|
