Self-Organizing Map for the Curvature-Constrained Traveling Salesman Problem
In this paper, we consider a challenging variant of the traveling salesman problem (TSP) where it is requested to determine the shortest closed curvature-constrained path to visit a set of given locations. The problem is called the Dubins traveling salesman problem in literature and its main difficulty arises from the fact that it is necessary to determine the sequence of visits to the locations together with particular headings of the vehicle at the locations. We propose to apply principles of unsupervised learning of the self-organizing map to simultaneously determine the sequence of the visits together with the headings. A feasibility of the proposed approach is supported by an extensive evaluation and comparison to existing solutions. The presented results indicate that the proposed approach provides competitive solutions to existing heuristics, especially in dense problems, where the optimal sequence of the visits cannot be determined as a solution of the Euclidean TSP.
- 2.Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Concorde tsp solver (2003). [cited 22 Jan 2016]Google Scholar
- 4.Cook, W.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press (2012)Google Scholar
- 12.Savla, K., Frazzoli, E., Bullo, F.: On the point-to-point and traveling salesperson problems for Dubins’ vehicle. In: Proceedings of the American Control Conference, pp. 786–791. IEEE (2005)Google Scholar
- 14.Váňa, P., Faigl, J.: On the dubins traveling salesman problem with neighborhoods. In: International Conference on Intelligent Robots and Systems, pp. 4029–4034 (2015)Google Scholar
- 15.Yu, X., Hung, J.: A genetic algorithm for the dubins traveling salesman problem. In: IEEE International Symposium on Industrial Electronics, pp. 1256–1261 (2012)Google Scholar