Adapting a Search Algorithm for the Spanish Railway Network
J. Macías-Guarasa,
R. San-Segundo,
J.M. Montero,
J. Ferreiros,
R. Córdoba,
F. Fernández,
L.F. D'Haro and
J.M. Pardo
Transportation Planning and Technology, 2005, vol. 29, issue 1, 25-42
Abstract:
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.
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/03081060600585145 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:transp:v:29:y:2005:i:1:p:25-42
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/GTPT20
DOI: 10.1080/03081060600585145
Access Statistics for this article
Transportation Planning and Technology is currently edited by Dr. David Gillingwater
More articles in Transportation Planning and Technology from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().