Information processing method and information processing apparatus
First Claim
1. An information processing method of finding a route minimizing a total length of lines each connecting two points among routes each once passing through all of a plurality of points given on an n-dimensional plane executed using an information processing apparatus, comprising the steps of:
- preparing information from an information carrier corresponding to a distribution of a plurality of points given on an n-dimensional space (where n is an integer not smaller than
2); and
using time development and time reversal of the information carrier to process the prepared information.
1 Assignment
0 Petitions
Accused Products
Abstract
To obtain good approximate solutions of a combinatorial optimization problem such as traveling salesman problem and to enable its processing apparatus in form of massively parallel exclusive devices, an information carrier corresponding to the distribution of a plurality of points given on an n-dimensional space (n is an integer not smaller than 2), and time development and time reversal of the information carrier are used to process the information. The information carrier may be the density of particles or optical intensity corresponding to the distribution of the given points, and a diffusion process of the particles or a defocusing process is used as changes with time. The traveling salesman problem is solved by using this method.
-
Citations
6 Claims
-
1. An information processing method of finding a route minimizing a total length of lines each connecting two points among routes each once passing through all of a plurality of points given on an n-dimensional plane executed using an information processing apparatus, comprising the steps of:
-
preparing information from an information carrier corresponding to a distribution of a plurality of points given on an n-dimensional space (where n is an integer not smaller than
2); and
using time development and time reversal of the information carrier to process the prepared information. - View Dependent Claims (2, 3)
-
-
4. An information processing apparatus for finding a route minimizing a total length of lines each connecting two points among routes each once passing through all of a plurality of points given on an n-dimensional plane, comprising:
-
preparation means for preparing information from an information carrier corresponding to a distribution of a plurality of points given on an n-dimensional space (where n is an integer not smaller than
2), andprocessing means for processing the prepared information using time development and time reversal of the information carrier. - View Dependent Claims (5, 6)
-
Specification