Modelling and Solving a Train Path Assignment Model

Karl Nachtigall () and Jens Opitz ()
Additional contact information
Karl Nachtigall: Dresden University of Technology
Jens Opitz: Dresden University of Technology

A chapter in Operations Research Proceedings 2014, 2016, pp 423-428 from Springer

Abstract: Abstract We introduceNachtigall, Karl a binary linear modelOpitz, Jens for solving the train path assignment problem. For each train request a train path has to be constructed from a set of predefined path parts within a time-space network. For each possible path we use a binary decision variable to indicate, whether the path is used by the train request. Track and halting capacity constraints are taken into account. We discuss different objective functions, like maximizing revenue or maximizing total train path quality. The problem is solved by using column generation within a branch and price approach. This paper gives some modeling and implementation details and presents computational results from real world instances.

Keywords: Train Paths; Train Requests; Time-space Network; Real-world Instances; Fractional Decision Variables (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:oprchp:978-3-319-28697-6_59

Ordering information: This item can be ordered from
http://www.springer.com/9783319286976

DOI: 10.1007/978-3-319-28697-6_59

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().