 A computer algebra approach to the design of routes and the study of their compatibility in a railway interlockingEugenio Roanes-Lozano, Eugenio Roanes-Macı́as and Luis M. Laita Mathematics and Computers in Simulation (MATCOM), 2002, vol. 58, issue 3, 203-214 Abstract: A railway interlocking is a device that supervises train operation (signaling and position of switches) authorization and prevents conflicting actions from being authorized. An expert system for route selection in a railway interlocking is presented, that is independent of the station topology. It is Maple-based and uses lists (it performs a kind of adapted knowledge extraction and verification). Given the track arrangement, it can determine all routes that begin in a given section and all routes that are an extension of a given route (in both cases it is possible to ask what routes end at a given section). Routes can be classified according to number of sections and, given a time estimate for crossing each section, timing for each route can be calculated. Therefore, the program makes it possible to optimize the route according to different criteria. Moreover, thanks to the chosen data structure, decision making on the compatibility of a proposed route is straightforward. Keywords: Railway routes; Railway interlockings; Expert systems; Computer algebra systems (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:58:y:2002:i:3:p:203-214 Access Statistics for this article Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.