Determination of the optimal set of methods for iterative improvement of the reference route

• Опубліковано в: PROBLEMS IN PROGRAMMING
• Дата: 2025
• Випуск: 3
• Сторінки: 19-28
• ISSN: 1727-4907
• Автори та афіліації: E.M. Derevianko — Institute of Software Systems NAS of Ukraine; V.L. Shevchenko — Institute of Software Systems NAS of Ukraine
• Автори: Derevianko, E.M., Shevchenko, V.L.
• Формат: Стаття
• Мова: Українська
• Опубліковано: PROBLEMS IN PROGRAMMING 2025
• Теми: traveling salesman problem; route; route cost; reference solution; computational procedure; model; optimization; iterative method; UDC 004.4:004.942
• Онлайн доступ: https://pp.isofts.kiev.ua/index.php/ojs1/article/view/855
• Назва журналу: Problems in programming

The article solves the problem of a traveling salesman for planning a flight of an unmanned aerial vehicle in the conditions of eliminating the consequences of an emergency. An approach is considered that uses a combination of the nearest point method to create a reference solution and a number of m...