- idUS
- Investigación
- Ciencias
- Matemática Aplicada I
- Ponencias (Matemática Aplicada I)
- Listar Ponencias (Matemática Aplicada I) por autor
Listar Ponencias (Matemática Aplicada I) por autor "Ortega Riejos, Francisco Alonso"
Mostrando ítems 1-5 de 5
-
Ponencia
Algorithm for planning faster routes in urban networks with time-dependant arcs and the possibility of introducing waiting periods at nodes
Ortega Riejos, Francisco Alonso; Marseglia, Guido; Mesa López-Colmenar, Juan Antonio; Piedra de la Cuadra, Ramón (WIT Press, 2022)Navigation systems implemented in mobile devices allow users to search for the shortest routes between pairs of points. ...
-
Ponencia
An Integrated Methodology for the Rapid Transit Network Design
Laporte, Gilbert; Marín, Ángel; Mesa López-Colmenar, Juan Antonio; Ortega Riejos, Francisco Alonso (Springer, 2004)The Rapid Transit System Network Design Problem consists of two intertwined location problems: the determination of ...
-
Ponencia
Analysis of the Parameters of Transfers in Rapid Transit Network Design
García, Ricardo; Garzón Astolfi, Armando; Marín, Ángel; Mesa López-Colmenar, Juan Antonio; Ortega Riejos, Francisco Alonso (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2006)The rapid transit network design problem consists of the location of train alignments and stations in an urban traffic ...
-
Ponencia
Determining Routes for an Auxiliary Fleet in Presence of Emergencies on a Railway Line
Ortega Riejos, Francisco Alonso; Mesa López-Colmenar, Juan Antonio; Pozo Montaño, Miguel Ángel (Springer, 2016)Transportation on-demand represents a mode of transport in which a set of users formulates transport requests between ...
-
Ponencia
Metaheurística GRASP para el diseño de redes de tránsito rápido
Martínez, Francisco Javier; Melián, Belén; Moreno, José A.; Garzón Astolfi, Armando; Mesa López-Colmenar, Juan Antonio; Ortega Riejos, Francisco Alonso (Universidad de Granada, Soft Computing and Intelligent Information Systems Research Group, 2005)En este trabajo se presenta un procedimiento heurístico GRASP para el problema del diseño de redes rápidas de transito ...