Abstract
Solving Territorial Design problems implies grouping territorial units into k of groups with compactness and/or contiguity restrictions. However each group formed is often treated in accordance to a conflict of interest; one of them is the routing problem. In this work grouping geographical units is also known as classification by partitions, which is a well-known high complexity problem. This complexity requires reaching approximated partitioning solutions of the territory in a reasonable computing time; therefore we have chosen the tabu search metaheuristic because it has achieved very efficient results in several optimization problems. Once tabu search has returned a solution, we apply an exact algorithm to the elements of the partition, which solves a routing problem.
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
Lenstra, K., Rinnooy Kan, A.H.: Complexity of vehicle routing and scheduling problems. 11(2), 221–227 (1981)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Kalcsics, J., Nickel, S., Schröder, M.: Toward a unified territorial design approach: applications, algorithms, and GIS integration. TOP 13(1), 1–56 (2005)
Zoltners, A., Sinha, P.: Towards a unified territory alignment: a review and model. Manage. Sci. 29, 1237–1256 (1983)
Bação, F., Lobo, F., Painho, V.: Applying genetic algorithms to zone design. In: Soft Computing - A Fusion of Foundations, Methodologies and Applications vol. 9, no. 5, pp. 341–348. Springer, Berlin, Heidelberg (2005). ISSN 1432-7643
Mehrotra, A., Johnson, A., Nemhause, E.: An optimization based heuristic for political districting. Manage. Sci. 44(8), 1100–1114 (1998)
Openshaw, S., Rao, L.: Algorithms for reengineering 1991 Census geography. Environ. Plann. A 27, 425–446 (1995)
Altman, M.: The computational complexity of automated redistricting: is automation the answer? Rutgers Comput. Technol. Law J. 23(1), 81–142 (1997)
Correa, E.S., Steiner, M.T., Freitas, A.A., Carnieri, C.: A genetic algorithm for the P-median problem. In: Proceeding Genetic and Evolutionary Computation Conference, pp. 1268–1275 (2001)
Bernábe, B., Osorio, L., Espinosa, R., Ramirez, R., Aceves, R.: A comparative study of simulated annealing and variable neighborhood search for the geographic clustering problem. In: The 2009 International Conference on Data Mining, pp. 595–599 (2009)
Martí, R.: Procedimientos metaheurísticos en optimización combinatoria. Tech. rep., Departamento de Estadística e Investigación Operativa, Facultad de Matematicas, Universidad de Valencia (2002)
Edleston, O.S., Bartlett, L.M.: A tabu search algorithm applied to the staffing roster problem of Leicestershire police force. J. Oper. Res. Soc. 63(1), 489–496 (2012)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Hansen, P., Mladenovic, N., Pérez, M.: Variable Neighbourhood Search. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial. Number 19, pp. 77–92 (2003). ISSN 1137-3601
Kaufman, L., Rousseeuw, P.: Clustering by means of medoids. Statistical Data Analysis based on the L1 Norm, North-Holland, Amsterdam, pp. 405–416 (1987)
Bernábe-Loranca, B., Pinto, D., Olivares-Benitez, E., Ramirez Rodríguez, J., Martínez-Flores, J.: Simulated annealing and variable neighborhood search hybrid metaheuristic for the geographic clustering. In: Fourth International Workshop of Knowledge Discovery, Knowledge Management and Decision Making, EUREKA 2013, vol. 5, pp. 140–147 (2013). ISSN 1951-6851
Loranca, M.B.B., Velázquez, R.G.: Integración de un sistema de información geográfica para algoritmos de particionamiento. In: Research in Computing Science Avances en la Ingeniería del Lenguaje y Conocimiento, vol. 88, pp. 31–44 (2014). ISSN 1870-4069
Desrochers, M., Laporte, G.: Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 10, 27–36 (1991)
Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 231–247 (1992)
Elizondo, M., Aceves, R.: Strategy of solution for the inventory routing problem based on separable cross decomposition. J. Appl. Res. Technol. 3(2), 139–149 (2005)
Rincón-García, E.A., Gutiérrez-Andrade, M.A., de-los-Cobos-Silva, S.G., Lara-Velázquez, P., Mora-Gutiérrez, R.A., Ponsich, A.S.: A multiobjective algorithm for redistricting. J. Appl. Res. Technol. 324–330 (2012)
Bernábe, B., Guillén, C.: Búsqueda de entorno variable multiobjetivo para resolver el problema de particionamiento de datos espaciales con características poblacionales. Computación y Sistemas 16(3), 335–347 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bernábe-Loranca, M.B., Velázquez, R.G., Analco, M.E., Penna, A.F., Parra, O.D., López, A.S. (2015). TSP in Partitioning with Tabu Search. In: Pichardo Lagunas, O., Herrera Alcántara, O., Arroyo Figueroa, G. (eds) Advances in Artificial Intelligence and Its Applications. MICAI 2015. Lecture Notes in Computer Science(), vol 9414. Springer, Cham. https://doi.org/10.1007/978-3-319-27101-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-27101-9_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27100-2
Online ISBN: 978-3-319-27101-9
eBook Packages: Computer ScienceComputer Science (R0)