2026-03-05T11:36:34Z https://kait.repo.nii.ac.jp/oai

oai:kait.repo.nii.ac.jp:00000821 2025-06-05T05:48:41Z 2:16:41:112

遺伝的アルゴリズムによる巡回セールスマン問題の並列化を考慮した近似解法 An Approximate Solution Considering Parallelism for Traveling Salesman Problem Using Genetic Algorithm 荒木, 智行 Araki, Tomoyuki 山本, 富士男 Yamamoto, Fujio 巽, 久行 Tatsumi, Hisayuki traveling salesman problem genetic algorithm parallelism smoothing method application/pdf It is well known that traveling salesm皿problem(for short. TSP) is one of most important problems for optimization, and almost all optimization problems result in TSP. This paper describes on an effective solution of TSP using genetic algorithm. The features of our method are summarized as follows: (1) By using division and unification method, a large problem is replaced with some small ones. (2) Smoothing method proposed in this paper enables us to obtain a fine approximate solution globally. Accordingly, demerits caused by division and unification method are decreased. (3) Parallel operation is available because all divided problems are independent of each other. 神奈川工科大学 1998-03-20 jpn departmental bulletin paper VoR https://doi.org/10.34411/00000814 http://hdl.handle.net/10368/815 https://kait.repo.nii.ac.jp/records/821 10.34411/00000814 AN10074179 09161902 神奈川工科大学研究報告.B,理工学編 22 95 101 https://kait.repo.nii.ac.jp/record/821/files/kkb-022-016.pdf application/pdf 3.1 MB 2010-02-03