A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Multi-Path Routing Algorithm for Inclusive Mobility in an Urban Environment
The concept of smart city is frequently used nowa-days to refer to the level of integration of cities with citizen services. Mobility and navigation are some examples. When considering disabled users, in a temporary or permanent way, the challenges to provide such services in an efficient way are even bigger. This paper is an extension of a previous work where a mobile application to recommend the most suitable route for citizens was implemented with both Dijkstra and A -Star algorithms. The presented work describes a multi-path approach considering the user might want to choose several destinations in the mobile application and obtain the most suitable route that goes through all of them. Results are presented using the Genetic and the Simulated Annealing Algorithms. Both were evaluated with 100 runs and 2, 4, 8 and 16 destinations. The average algorithm execution time, standard deviation, median value, maximum and minimum execution times were assessed. The Simulated Annealing Algorithm presented better results and always suggested the shorter, or equal, path when comparing to the Genetic Algorithm.
Multi-Path Routing Algorithm for Inclusive Mobility in an Urban Environment
The concept of smart city is frequently used nowa-days to refer to the level of integration of cities with citizen services. Mobility and navigation are some examples. When considering disabled users, in a temporary or permanent way, the challenges to provide such services in an efficient way are even bigger. This paper is an extension of a previous work where a mobile application to recommend the most suitable route for citizens was implemented with both Dijkstra and A -Star algorithms. The presented work describes a multi-path approach considering the user might want to choose several destinations in the mobile application and obtain the most suitable route that goes through all of them. Results are presented using the Genetic and the Simulated Annealing Algorithms. Both were evaluated with 100 runs and 2, 4, 8 and 16 destinations. The average algorithm execution time, standard deviation, median value, maximum and minimum execution times were assessed. The Simulated Annealing Algorithm presented better results and always suggested the shorter, or equal, path when comparing to the Genetic Algorithm.
Multi-Path Routing Algorithm for Inclusive Mobility in an Urban Environment
Machado, Hugo (author) / Paiva, Sara (author) / Pereira, Ana I. (author)
2022-09-26
403780 byte
Conference paper
Electronic Resource
English
Path creation for urban mobility transitions
| Online Contents | 2015
Safe and Inclusive Pedestrian Routes in Complex Urban Environment
| Springer Verlag | 2025
Urban Ecological Infrastructure: An inclusive concept for the non-built urban environment
| BASE | 2019
Urban Ecological Infrastructure: An inclusive concept for the non-built urban environment
| BASE | 2019