| 摘要 |
PURPOSE:To speedily find a semioptimum solution of the symmetrical route salesman problem by covering all cities on a plane with a square frame which can be divided into squares and dividing it into mini cells one after another, placing representative points as the cities in respective cells, and assigning optimum paths on basic discrete space cells corresponding to the arrangement of the representative points from cells of larger size. CONSTITUTION:When city data 1 are given as the problem, all the cities are covered with the square frame 2 which can be divided into the squares of mXn size first. The square is divided equally by mXn into the mXn mini cells. They are further divided 3 and 4 until proper size. When there are the cities in the mini cells, the representative points 5-7 are placed in their centers irrelevantly to the number of cities. A pattern of courses of basic discrete space cells in a random access memory is applied to information on the cities which are made discrete. Then the semioptimum solution connecting all the cities is found by connecting the actual cities in the smallest fractionated cells. |
