Geintra

Departamento de electronica Universidad de Alcala

Líneas de investigación

Accede a información sobre la estructura de la actividad investigadora de Geintra.

Trabaja con nosotros

Accede a nuestra oferta actual de becas, tesis doctorales, contratos y trabajos fin de carrera.

Contacta con el grupo

Si desea contactar con nosotros, puede usar varios medios.

    Adapting a Search Algorithm for the Spanish Railway Network

    TítuloAdapting a Search Algorithm for the Spanish Railway Network
    Tipo de publicaciónJournal Article
    Año de publicación2006
    AutoresMacias-Guarasa, J, San-Segundo, R, Montero, JM, Ferreiros, J, Cordoba, R, Fernandez, F, D'Haro, LF, Pardo, JM
    Idioma de publicaciónEnglish
    Revista académicaTransportation Planning and Technology
    Volumen29
    Número1
    Páginas25-42
    Fecha de publicación02/2006
    Lugar de publicaciónReino Unido de Gran Bretaña e Irlanda del Norte
    EditorialTaylor & Francis Journals
    Rank in category19/22
    JCR CategoryTRANSPORT. SCI. & TECHN.
    Palabras claveconnecting matrices, journey option search, railway, Search algorithm, train routing
    JCR Impact Factor0.156
    ISSN0308-1060
    URLhttp://www.informaworld.com/smpp/content~content=a743854633~db=all~order=page
    DOI10.1080/03081060600585145
    Resumen

    This article describes a search algorithm adapted to the Spanish
    Railway Network for generating as many traveling options as possible between
    two railway stations. This algorithm (Warshall’s algorithm) uses connecting
    matrices to find all possible railway journeys. The Spanish Railway Company
    has imposed severe restrictions: less than 1 second per query in a 600Mhz
    processor PC with 32Mb RAM and 150Mb hard disk free memory. The final
    average time for a simple query is around 0.25 seconds and the whole memory
    consumption is 127Mb. The final implementation has been divided into 3
    modules. In the first module, we store additional information in the connecting
    matrices to accelerate the later search, proposing several strategies for reducing
    thier size. The journey option calculation module accesses the matrix information
    and composes the traveling options. Finally, in the filtering module we
    describe the selection criteria considering the algorithm embedded in a general
    information service.

    AdjuntoTamaño
    PaperPublicado-gtpt158497.pdf330.99 KB

    Geintra © 2008-2015

    Diseño web por Hazhistoria