Speed-up of Self-Organizing Networks for Routing Problems in a Polygonal Domain Article Swipe

MAKE IMPACT

Miroslav Kulich , Roman Sushkov , Libor Přeučil · YOU? · · 2017 · Open Access · · DOI: https://doi.org/10.48550/arxiv.1707.09809

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.

Type

preprint

Language

en

Landing Page

http://arxiv.org/abs/1707.09809

PDF

https://arxiv.org/pdf/1707.09809

OA Status

green

Cited By

1

References

4

Related Works

10

OpenAlex ID

https://openalex.org/W2739638682

Raw OpenAlex JSON