Abstract
Generalized Traveling Salesman Problem (GTSP) is a well-known combinatorial optimization problem having numerous applications in operations research. For a given edge-weighted graph and a partition of its nodeset onto k (disjoint) clusters it is required to find a minimum cost cyclic tour visiting all the clusters once. The problem is strongly NP-hard even in the Euclidean plane provided the number of clusters is a part of the instance. Recently we proposed efficient optimal algorithms for GTSP based on quasi- and pseudo-pyramidal tours. As a consequence, we proved polynomial time solvability of the Euclidean GTSP in Grid Clusters defined by a grid of height at most 2. In this short paper, we show how to extend this result to the case defined by grids of an arbitrary fixed height.
This research was supported by Russian Science Foundation, grant no. 14-11-00109.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
We call it EGTSP-GC(h).
References
Bhattacharya, B., Ćustić, A., Rafiey, A., Rafiey, A., Sokol, V.: Approximation algorithms for generalized MST and TSP in grid clusters. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 110–125. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-26626-8_9
Feremans, C., Grigoriev, A., Sitters, R.: The geometric generalized minimum spanning tree problem with grid clustering. 4OR 4(4), 319–329 (2006). https://doi.org/10.1007/s10288-006-0012-6
Fischetti, M., González, J.J.S., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378–394 (1997). https://doi.org/10.1287/opre.45.3.378
Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Springer, US, Boston (2007)
Khachai, M.Y., Neznakhina, E.D.: Approximation schemes for the generalized traveling salesman problem. Proc. Steklov Inst. Math. 299(1), 97–105 (2017). https://doi.org/10.1134/S0081543817090127
Khachay, M., Neznakhina, K.: Towards a PTAS for the generalized TSP in grid cluster. AIP Conf. Proc. 1776(1), 050003 (2016). https://doi.org/10.1063/1.4965324
Khachay, M., Pankratov, V., Khachay, D.: Attainable best guarantee for the accuracy of \(k\)-medians clustering in \([0,1]\). In: CEUR Workshop Proceedings 1987, pp. 322–327 (2017). urn:nbn:de:0074-1987-8
Khachay, M., Neznakhina, K.: Generalized pyramidal tours for the generalized traveling salesman problem. Lecture Notes in Computer Science, vol. 10627, pp. 265–277. Springer International Publishing, Cham (2017). https://doi.org/10.1007/978-3-319-71150-8_23
Khachay, M., Neznakhina, K.: Polynomial time solvable subclass of the generalized traveling salesman problem on grid clusters. In: van der Aalst, W.M.P., Ignatov, D.I., Khachay, M., Kuznetsov, S.O., Lempitsky, V., Lomazova, I.A., Loukachevitch, N., Napoli, A., Panchenko, A., Pardalos, P.M., Savchenko, A.V., Wasserman, S. (eds.) AIST 2017. LNCS, vol. 10716, pp. 346–355. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73013-4_32
Papadimitriou, C.: Euclidean TSP is NP-complete. Theoret. Comput. Sci. 4, 237–244 (1977)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Khachay, M., Neznakhina, K. (2019). Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters. In: Battiti, R., Brunato, M., Kotsireas, I., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 12 2018. Lecture Notes in Computer Science(), vol 11353. Springer, Cham. https://doi.org/10.1007/978-3-030-05348-2_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-05348-2_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05347-5
Online ISBN: 978-3-030-05348-2
eBook Packages: Computer ScienceComputer Science (R0)