Tsp in partitioning with tabu search

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9414, pp. 407–421). Springer Verlag. https://doi.org/10.1007/978-3-319-27101-9_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free