| 摘要 |
<p>PROBLEM TO BE SOLVED: To quickly find a likely solution of a complicated combination problem such as a traveling salesman problem by utilizing a combination that is included in the time series of a chaos which is observed by nonlinear quantization. SOLUTION: When the internal state of a chaos is now written as y (t), the y (t) is a time series and (t) is a discrete time. The database of a time series Z (t)-1 which is nonlinearly quantized is retrieved, and the time series of a degenerate quantum is extracted and is rewritten in a data format that is suitable to a traveling salesman problem. For instance, there are 5!=120 ways in traveling combinations in the case that a traveling salesman starts from a city 0 and comes back to the city 0 again. Although a person easily finds the shortest distance by observing them with his eyes in the case of the combinations to this extent, an arrangement which rewrites the time series of Z (t-4) of a degenerated quantum to 0 to 15 is utilized. That is, 0 is retrieved with the time series and cities 1 to 5 are found out among the sequence that follow 0 in a sequential order and are made a traveling route.</p> |
