2026-06-02T05:57:19Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/341352026-02-03T12:29:19Zcom_10630_2254col_10630_37959

00925njm 22002777a 4500 dc Camero, Andrés author Arellano-Verdejo, Javier author Cintrano López, Christian author Alba-Torres, Enrique author 2017-06 Finding the shortest path between two places is a well known problem in road traveling. While most of the work done up to this moment is focused on algorithmics, efficiently managing the information has received significantly less attention. Nevertheless, real world problems like road map routing present a challenge due to the impact that the immense size of the map has over the temporal complexity of the routing algorithms. In this work we propose a strategy for efficiently computing the shortest path in real road maps based on data managing: the tile map partitioning. To recreate a real scenario, we implemented a routing system and we tested our strategy using the road map of the Province of Málaga, Spain. Using a Differential Evolution we found the optimal tile size and prove that significant time reductions can be achieved by using the tile map partitioning. A. Camero, J. Arellano-Verdejo, C. Cintrano and E. Alba, "Tile map size optimization for real world routing by using differential evolution," 2017 IEEE Congress on Evolutionary Computation (CEC), Donostia, Spain, 2017, pp. 1482-1488, doi: 10.1109/CEC.2017.7969478 https://hdl.handle.net/10630/34135 Optimización Computación evolutiva Programación heurística Tile map size optimization for real world routing by using differential evolution