<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Javier Macias-Guarasa</style></author><author><style face="normal" font="default" size="100%">San Segundo, Ruben</style></author><author><style face="normal" font="default" size="100%">Juan Manuel Montero</style></author><author><style face="normal" font="default" size="100%">Javier Ferreiros</style></author><author><style face="normal" font="default" size="100%">Ricardo Cordoba</style></author><author><style face="normal" font="default" size="100%">Fernando Fernandez</style></author><author><style face="normal" font="default" size="100%">Luis Fernando D'Haro</style></author><author><style face="normal" font="default" size="100%">Jose Manuel Pardo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Adapting a Search Algorithm for the Spanish Railway Network</style></title><secondary-title><style face="normal" font="default" size="100%">Transportation Planning and Technology</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">connecting matrices</style></keyword><keyword><style  face="normal" font="default" size="100%">journey option search</style></keyword><keyword><style  face="normal" font="default" size="100%">railway</style></keyword><keyword><style  face="normal" font="default" size="100%">Search algorithm</style></keyword><keyword><style  face="normal" font="default" size="100%">train routing</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">02/2006</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.informaworld.com/smpp/content~content=a743854633~db=all~order=page</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">https://geintra-uah.org/system/files/PaperPublicado-gtpt158497_2.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Taylor &amp; Francis Journals</style></publisher><pub-location><style face="normal" font="default" size="100%">Reino Unido de Gran Bretaña e Irlanda del Norte</style></pub-location><volume><style face="normal" font="default" size="100%">29</style></volume><pages><style face="normal" font="default" size="100%">25-42</style></pages><language><style face="normal" font="default" size="100%">English</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This article describes a search algorithm adapted to the Spanish&lt;br /&gt;
Railway Network for generating as many traveling options as possible between&lt;br /&gt;
two railway stations. This algorithm (Warshall&amp;rsquo;s algorithm) uses connecting&lt;br /&gt;
matrices to find all possible railway journeys. The Spanish Railway Company&lt;br /&gt;
has imposed severe restrictions: less than 1 second per query in a 600Mhz&lt;br /&gt;
processor PC with 32Mb RAM and 150Mb hard disk free memory. The final&lt;br /&gt;
average time for a simple query is around 0.25 seconds and the whole memory&lt;br /&gt;
consumption is 127Mb. The final implementation has been divided into 3&lt;br /&gt;
modules. In the first module, we store additional information in the connecting&lt;br /&gt;
matrices to accelerate the later search, proposing several strategies for reducing&lt;br /&gt;
thier size. The journey option calculation module accesses the matrix information&lt;br /&gt;
and composes the traveling options. Finally, in the filtering module we&lt;br /&gt;
describe the selection criteria considering the algorithm embedded in a general&lt;br /&gt;
information service.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue><accession-num><style face="normal" font="default" size="100%">0.156</style></accession-num><call-num><style face="normal" font="default" size="100%">TRANSPORT. SCI. &amp; TECHN.</style></call-num></record></records></xml>