Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-27101-9_31 | ADVANCES IN ARTIFICIAL INTELLIGENCE AND ITS APPLICATIONS, MICAI 2015, PT II |
Keywords | Field | DocType |
Tabu search,Territorial design,Traveling salesman problem | Mathematical optimization,Contiguity,Exact algorithm,Computer science,Compact space,Travelling salesman problem,Artificial intelligence,Partition (number theory),Optimization problem,Machine learning,Tabu search,Metaheuristic | Conference |
Volume | ISSN | Citations |
9414 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 1 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| María Beatríz Bernábe Loranca | 1 | 0 | 2.03 |
| Rogelio Gonzalez Velazquez | 2 | 3 | 5.17 |
| Martín Estrada Analco | 3 | 0 | 1.01 |
| Alejandro Fuentes-penna | 4 | 4 | 7.61 |
| Ocotlán Díaz-Parra | 5 | 22 | 12.83 |
| Abraham Sánchez López | 6 | 12 | 10.54 |