In this paper new approaches for solving dynamic Travelling Salesman Problem (TSP) in conditions of partly unknown input data are given.
[1] Cormen, T., Leiserson, C., Rivest, R., Stein, C. Introduction to Algorithms, third edition. MIT Press, 2009, p. 1292.
[2] Bonabeau, E., Dorigo, M., Theraulaz, G.. Swarm intelligence: From Natural to Artificial Systems. Oxford University Press., 1999, p. 307.
[3] Muliarevych O., Golembo V. New approaches for solving travelling salesman problems using agents swarm intelligence behavior model, // European Cooperation: Scientific Approaches and Applied Technologies. - CLM Consulting Publ., Warsaw 2015, Vol 5(5), pp. 131-143.
[4] Lentin Joseph, Mastering ROS for Robotics Programming. Packt Publishing Ltd, UK, Dec 21, 2015, p. 480.
[5] Golembo, V., Muliarevych, O.. Modification of ant colony method for TSP solving by collective of autonomous agents. Computer systems and networks, Lviv Polytechnic National University Press, no. 717, 2011, pp. 24-30.
[6] E. N. Barron, Game Theory: An Introduction. John Wiley & Sons Publ., Canada, Apr 22, 2013, p. 555.
https://doi.org/10.1002/9781118547168
[7] Helsgaun, K., General k-opt submoves for the Lin-Kernighan TSP heuristic. Mathematical Programming Computation, Springer Verlag Publ., 2009, pp. 119-163.
https://doi.org/10.1007/s12532-009-0004-6
[8] Heidelberg University (from 1995). Discrete and Combinatorial Optimization. Retrieved from http://comopt.ifi.uniheidelberg.de/software/TSPLIB95/