Abstract
This paper proposes a platform both for parallelism of self-organizing map (SOM) and the 2-opt algorithm to large scale 2-Dimensional Euclidean traveling salesman problems. This platform makes these two algorithms working in a massively parallel way on graphical processing unit (GPU). Advantages of this platform include its flexibly topology preserving network, its fine parallel granularity and it allows maximum (N / 3) 2-opt optimization moves to be executed with O(N) complexity within one tour orientation and does not cut the integral tour. The parallel technique follows data decomposition and decentralized control. We test this optimization method on large TSPLIB instances, experiments show that the acceleration factor we obtained makes the proposed method competitive, and allows for further increasing for very large TSP instances along with the quantity increase of physical cores in GPU systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Kohonen, T.: The self-organizing map. Proc. IEEE 78(9), 1464–1480 (1990)
Angeniol, B., Vaubois, G.D.L.C., Le Texier, J.-Y.: Self-organizing feature maps and the travelling salesman problem. Neural Netw. 1(4), 289–293 (1988)
Modares, A., Somhom, S., Enkawa, T.: A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems. Int. Trans. Oper. Res. 6(6), 591–606 (1999)
Bai, Y., Zhang, W., Jin, Z.: An new self-organizing maps strategy for solving the traveling salesman problem. Chaos, Solitons Fractals 28(4), 1082–1089 (2006)
Créput, J.-C., Koukam, A.: A memetic neural network for the Euclidean traveling salesman problem. Neurocomputing 72(4), 1250–1264 (2009)
Brocki, Ł., Koržinek, D.: Kohonen self-organizing map for the traveling salesperson problem. In: Jabłoński, R., Turkowski, M., Szewczyk, R. (eds.) Recent Advances in Mechatronics, pp. 116–119. Springer, Heidelberg (2007)
Mann, R. Haykin, S.: A parallel implementation of Kohonen’s feature maps on the warp systolic computer (1990)
Wu, C.-H., Hodges, R.E., Wang, C.-J.: Parallelizing the self-organizing feature map on multiprocessor systems. Parallel Comput. 17(6), 821–832 (1991)
Ienne, P., Thiran, P., Vassilas, N.: Modified self-organizing feature map algorithms for efficient digital hardware implementation. IEEE Trans. Neural Netw. 8(2), 315–330 (1997)
Lawrence, R.D., Almasi, G.S., Rushmeier, H.E.: A scalable parallel algorithm for self-organizing maps with applications to sparse data mining problems. Data Min. Knowl. Disc. 3(2), 171–195 (1999)
Valova, I., Szer, D., Gueorguieva, N., Buer, A.: A parallel growing architecture for self-organizing maps with unsupervised learning. Neurocomputing 68, 177–195 (2005)
Richardson, T., Winer, E.: Extending parallelization of the self-organizing map by combining data and network partitioned methods. Adv. Eng. Softw. 88, 1–7 (2015)
Qiao, W., Créput, J.-C.: Stereo matching by using self-distributed segmentation and massively parallel GPU computing. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2016. LNCS, vol. 9693, pp. 723–733. Springer, Cham (2016). doi:10.1007/978-3-319-39384-1_64
Verhoeven, M., Aarts, E.H., Swinkels, P.: A parallel 2-opt algorithm for the traveling salesman problem. Future Gener. Comput. Syst. 11(2), 175–182 (1995)
Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and its Variations, pp. 369–443. Springer, Heidelberg (2007)
Rocki, K., Suda, R.: Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem. In: 2012 International Conference on High Performance Computing and Simulation (HPCS), pp. 489–495. IEEE (2012)
Van Luong, T., Melab, N., Talbi, E.-G.: GPU computing for parallel local search metaheuristic algorithms. IEEE Trans. Comput. 62(1), 173–185 (2013)
Zhang, N., Wang, H., Creput, J.-C., Moreau, J., Ruichek, Y.: Cellular GPU model for structured mesh generation and its application to the stereo-matching disparity map. In: 2013 IEEE International Symposium on Multimedia (ISM), pp. 53–60. IEEE (2013)
Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. Local Search Comb. Optim. 1, 215–310 (1997)
Karp, R.M.: Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane. Math. Oper. Res. 2(3), 209–224 (1977)
Wang, H., Zhang, N., Créput, J.-C.: A massive parallel cellular GPU implementation of neural network to large scale Euclidean TSP. In: Castro, F., Gelbukh, A., González, M. (eds.) MICAI 2013. LNCS, vol. 8266, pp. 118–129. Springer, Heidelberg (2013). doi:10.1007/978-3-642-45111-9_10
Bentley, J.L., Weide, B.W., Yao, A.C.: Optimal expected-time algorithms for closest point problems. ACM Trans. Math. Softw. (TOMS) 6(4), 563–580 (1980)
Rajasekaran, S.: On the Euclidean minimum spanning tree problem. Comput. Lett. 1(1) (2004)
CUDA C Programming Guide: CUDA toolkit documentation
Acknowledgments
This paper is together sponsored by China Scholarship Council (CSC) and LE2I UBFC.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Qiao, Wb., Créput, Jc. (2017). Massive Parallel Self-organizing Map and 2-Opt on GPU to Large Scale TSP. In: Rojas, I., Joya, G., Catala, A. (eds) Advances in Computational Intelligence. IWANN 2017. Lecture Notes in Computer Science(), vol 10305. Springer, Cham. https://doi.org/10.1007/978-3-319-59153-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-59153-7_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59152-0
Online ISBN: 978-3-319-59153-7
eBook Packages: Computer ScienceComputer Science (R0)