Towards Solving TSPN with Arbitrary Neighborhoods: A Hybrid Solution
- 864 Downloads
As the generalization of TSP (Travelling Salesman Problem), TSPN (TSP with Neighborhoods) is closely related to several important real-world applications. However, TSPN is significantly more challenging than TSP as it is inherently a mixed optimization task containing both combinatorial and continuous components. Different from previous studies where TSPN is either tackled by approximation algorithms or formulated as a mixed integer problem, we present a hybrid framework in which metaheuristics and classical TSP solvers are combined strategically to produce high quality solutions for TSPN with arbitrary neighborhoods. The most distinctive feature of our solution is that it imposes no explicit restriction on the shape and size of neighborhoods, while many existing TSPN solutions require the neighborhoods to be disks or ellipses. Furthermore, various continuous optimization algorithms and TSP solvers can be conveniently adopted as necessary. Experiment results show that, using two off-the-shelf routines and without any specific performance tuning efforts, our method can efficiently solve TSPN instances with up to 25 regions, which are represented by both convex and concave random polygons.
KeywordsTSP TSPN Neighborhood Hybrid Metaheuristic
This work was supported by Natural Science Foundation of Guangdong Province (No. 2014A030310318) and Research Foundation of Shenzhen (No. JCYJ20160301153317415).
- 7.Mitchell, J.: A PTAS for TSP with neighborhoods among fat regions in the plane. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 11–18 (2007)Google Scholar
- 10.Dumitrescu, A., Tóth, C.: Constant-factor approximation for TSP with disks (2016). arXiv:1506.07903v3 [cs.CG]
- 14.Random 2D Polygon Code. http://stackoverflow.com/questions/8997099/algorithm-to-generate-random-2d-polygon
- 15.CMA-ES Source Code. https://www.lri.fr/~hansen/cmaes_inmatlab.html
- 18.Kirk, D., Hwu, W.: Programming Massively Parallel Processors: A Hands-on Approach. Morgan Kaufmann, San Francisco (2012)Google Scholar
- 19.Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of 6th International Conference on Genetic Algorithms, pp. 184–192 (1995)Google Scholar