UDC 004.023
ABOUT THE ALGORITHMS OF TRAVELLING SALESMAN PROBLEM SOLUTION ON THE INTERNET
V. M. Kureichik, Dr. Sc. (Tech.), full professor, Senior Researcher, Department of Computer aided design; Institute of Computer Technologies and Information Security (ICTIS), Southern Federal University (SFedU), Taganrog, Russia; This email address is being protected from spambots. You need JavaScript enabled to view it.
Y. A. Logunova, postgraduate student, Department of Computer aided design; Institute of Computer Technologies and Information Security (ICTIS), Southern Federal University (SFedU), Taganrog, Russia; This email address is being protected from spambots. You need JavaScript enabled to view it.
This article discusses one of the well-known combinatorial optimization NP-difficult problem: «The Traveling Salesman Problem». Varieties of this task are found quite often in practice. The purpose of this work is to consider the traveling salesman problem in the context of intelligent information and computing systems on the Internet. Developers often face the problem of solving the traveling salesman problem with time windows in practice, when they are designing Web-based applications. Heuristic methods are often used to solve it. In this paper, a bioinspired algorithm is considered, which is based on the an ant colony behavior. Modifications are based on the nonlinearity of the sigmoid function. Note that for conducting an experiment on the Internet, a mobile application was developed, which is based on a modified algorithm. The research result is the traveling salesman route built in a reasonable time, taking into account time windows. Heuristics based on the agitation method are also proposed to select the best solution of the problem under consideration on the Internet.
Key words: Internet, Traveling Salesman Problem with time Windows, intelligent system, web application, bioinspired algorithms, ant colony algorithm.