ALGORITHM FOR CONSTRUCTING ROUTES IN A MOBILE APPLICATION FOR NAVIGATION IN LARGE AREAS OF SERVICE
DOI:
https://doi.org/10.30888/2663-5712.2020-04-01-052Keywords:
navigation, search algorithm, minimum pathAbstract
The article analyzes the algorithms for constructing the shortest path such as Dijkstra's algorithm, Ford's algorithm, width search algorithm.The disadvantages of these algorithms for their application in the mobile application for navigation are identifMetrics
References
Вороновский Г. К., Махотенко К. В., Петрашев С. Н., Сергеев С. А. Генетические алгоритмы, искусственные нейронные сети и проблемы виртуальной реальности. – Х.: ОСНОВА, 1997. – 112 с.
Кормен Т., Лейзерсон Ч., Ривест Р. Алгоритмы: построение и анализ / Пер. с англ. под ред. Шеня А. – М.: МЦНМО: БИНОМ. Лаборатория знаний, 2004. – 2-е изд., стереотип. – 960 с.
Зак Ю. А., Математические модели и алгоритмы построения эффективных маршрутов доставки грузов, РУСАЙНС, М., 2015, 306 с.
Domschke W., Logistik: Transport. Grundlagen lineare Transport- und Umladeprobleme, 5 Auflage, R. Oldenburg Verlag, München–Wien, 2007, 234 pp.
Grünert T., Imich St., Optimierung in Transport, v. 1, Grundlagen, Shaker Verlag, 2005; v. 2, Wege und Touren, Shaker Verlag, 2005.
Bianchessi N., Righini G., “Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery”, Computers & Operations Research, 34:2 (2007), 578–594.
Montano F. A. T., Calvao R. D., “Vehicle Routing Problem with Simultaneous Pick-ap Up and Delivery Service”, Operational Research of India, 39:1 (2002), 19–33.
Montano F. A. T., Calvao R. D., “A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service”, Computers & Operations Research, 33 (2006), 595–619.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 Authors
This work is licensed under a Creative Commons Attribution 4.0 International License.
