Ponencia
Algorithm for planning faster routes in urban networks with time-dependant arcs and the possibility of introducing waiting periods at nodes
Autor/es | Ortega Riejos, Francisco Alonso
Marseglia, Guido Mesa López-Colmenar, Juan Antonio Piedra de la Cuadra, Ramón |
Coordinador/Director | Passerini, Giorgio
Ricci, Stefano |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI) |
Fecha de publicación | 2022 |
Fecha de depósito | 2023-10-13 |
Publicado en |
|
ISBN/ISSN | 1746-4498 1743-3509 |
Resumen | Navigation systems implemented in mobile devices allow users to search for the shortest routes between pairs of points. Many of the existing commercial products assume in a simplified way that the travel time to cross each ... Navigation systems implemented in mobile devices allow users to search for the shortest routes between pairs of points. Many of the existing commercial products assume in a simplified way that the travel time to cross each arc of a road network is fixed, once a starting time has been established. However, the real travel time along a road section within cities depends on many factors that are related to traffic congestion, weather conditions, possible incidents, etc., and consequently, it depends on the time. As can easily be shown, determining the shortest itineraries in a network whose arcs are time-dependent can result in a diversity of optimal routes for a same origin–destination pair based on different departure times. Assuming the availability of the estimated data of the time required to travel along each section of the street network, once the departure time has been previously set, we propose in this work an efficient algorithm for obtaining faster routes on time-dependent arcs, in such a way that the sum of driving times is minimized, which in parallel allows improving fuel consumption and reducing associated polluting emissions. The possibility of introducing waiting periods in the nodes to optimize the total time spent on the trip has also been considered in the design of the proposed procedure. An experimental evaluation is carried out to show the effectiveness of the provided algorithm. |
Agencias financiadoras | Ministerio de Ciencia e Innovación (MICIN). España European Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER) |
Identificador del proyecto | PID2019-106205GB-I00 |
Cita | Ortega Riejos, F.A., Marseglia, G., Mesa López-Colmenar, J.A. y Piedra de la Cuadra, R. (2022). Algorithm for planning faster routes in urban networks with time-dependant arcs and the possibility of introducing waiting periods at nodes. En 28th International Conference on Urban and Maritime Transport and the Environment, UMT 2022 (25-36), WIT Press. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Algorithm for planning faster ... | 488.1Kb | [PDF] | Ver/ | |