Conflict Resolving

We consider the problem of planning the annual timetable for all freight trains in Germany simultaneously. That is, for each train, construct a slot through the network such that no two slots of different trains have a conflict. We denote this task by the Train Path Assignment Problem (TPAP) and con...

Full description

Saved in:
Bibliographic details
Main Author: Reisch, Julian
Großmann, Peter
Pöhle, Daniel
Kliewer, Natalia
Format: Web Resource
Language: English
Place of publication: 2020
Data of publication: 2020
Bibliography: 10.1016/j.ejor.2021.01.006
Online Access: available in Bonn?
Database: Dokumentenserver der FU Berlin
Database information Databases - DBIS