<論文>遺伝的アルゴリズムを用いた上限値制約を伴う経路探索の実現に関する検討

概要

論文の詳細を見る
The authors have proposed a method of searching the shortest route via several designated points with a genetic algorithm. By applying this method, this paper proposes a method of searching for the shortest route via the most designated points among the routes whose lengths are less than the upper bound. However, this kind of routing has a drawback of making optimization accuracy deteriorate when using a method of simply screening individuals whose route lengths are more than the upper bound. In order to solving this problem, two new methods are proposed and their validity is verified by several experiments.
2003-03-25