Train routing in shunting yards using Answer Set Programming

•Formulation of a complex routing problem using Answer Set Programming (ASP).•First ever application of ASP to the train routing problem at shunting yards.•A numerical study illustrates feasibility, advantages and limitations of this new approach. We use Answer Set Programming (ASP), a modern method...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Expert systems with applications Ročník 42; číslo 21; s. 7292 - 7302
Hlavní autoři: Adlbrecht, Jan-Alexander, Hüttler, Benno, Ilo, Nikola, Gronalt, Manfred
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 30.11.2015
Témata:
Answer Set Programming
Construction
Decision support systems
Expert systems
Flexibility
Optimisation
Optimization
Programming
Shunting yard
Tracking
Tradeoffs
Train routing
Shunting yard
Train routing
Answer Set Programming
Optimisation
ISSN:0957-4174, 1873-6793
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Formulation of a complex routing problem using Answer Set Programming (ASP).•First ever application of ASP to the train routing problem at shunting yards.•A numerical study illustrates feasibility, advantages and limitations of this new approach. We use Answer Set Programming (ASP), a modern method for knowledge representation and reasoning, to build a fully automated decision support system for routing of trains in shunting yards. The system leverages the knowledge of experienced shunting yard operators and yields optimal, consistent and transparent routing decisions. In addition, the system remains easily adaptable to new expert knowledge that may become available in the future. We embedded this routing system into a simulation environment and conducted a study in order to investigate and confirm the validity and limits of this new approach. The study is based on the track layout and legal regularities of an actual shunting yard and therefore ensures the applicability to real world problem instances. The results confirm that ASP can be used to solve complex routing problems, but cannot yet match the solving speed of proprietary and custom fit algorithms. Therefore the suitability of ASP to solve complex routing problems is subject to the trade-off between transparency, adaptability and flexibility vs. speed.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2015.05.044