多角形領域の経路問題に対する自己組織化ネットワークの高速化
Speed-up of Self-Organizing Networks for Routing Problems in a Polygonal Domain
多次元尺度構成法を用いて、障害物のある多角形領域での巡回セールスマン問題を解く自己組織化ニューラルネットワークの計算時間を大幅に短縮した。
著者: Miroslav Kulich, Roman Sushkov, Libor Přeučil
分類: cs.RO
原文アブストラクト
Routing problems are optimization problems that consider a set of goals in a graph to be visited by a vehicle (or a fleet of them) in an optimal way, while numerous constraints have to be satisfied. We present a solution based on multidimensional scaling which significantly reduces computational time of a self-organizing neural network solving a typical routing problem -- the Travelling Salesman Problem (TSP) in a polygonal domain, i.e. in a space where obstacles are represented by polygons. The preliminary results show feasibility of the proposed approach and although the results are presented only for TSP, the method is general so it can be used also for other variants of routing problems.
