2026-03-13T11:53:50Z https://fit.repo.nii.ac.jp/oai

oai:fit.repo.nii.ac.jp:00000449 2023-05-15T13:47:34Z 256:257:300

ジコ ソシキカ マップホウ ニヨル ジュンカイ セールスマン モンダイ ノ カイホウ ２ 自己組織化マップ法による巡回セールスマン問題の解法Ⅱ Semi-Optimum Solution of Traveling Salesman Problem by Self-Organizing MapsⅡ 西見, 康平 2124 加藤, 友彦 2126 traveling salesman problem NP-complete problem self-organizing map traveling salesman problem NP-complete problem self-organizing map application/pdf 論文(Article) The traveling salesman problem is one of the most difficult problems in optimization problems. In this study we improve the method of B. Angeniol et al.based on the self-organizing maps (SOM) by T.Kohonen in several points. We apply the present method systematically to 100-, 500-, 1000-, 5000-, 11849-city problem. The result shows that the computing time is proportional to approximately the square of the number of cities. That is,the present method gives a polynomial algorithm, though within the limits of semi-optimum solutions, for the traveling salesman problem that is one of the representative problems of the NP complete problem. departmental bulletin paper 福岡工業大学 2009-09-28 VoR application/pdf 福岡工業大学研究論集 1 42 11 17 02876620 AN10036974 https://fit.repo.nii.ac.jp/record/449/files/11478-985_p11加藤　友彦.pdf http://hdl.handle.net/11478/985 https://fit.repo.nii.ac.jp/records/449 jpn