Journal ArticleDOI
Scheduling extra freight trains on railway networks
Reads0
Chats0
TLDR
An integer linear programming formulation, that generalizes some formulations already presented for the case of a single railway line, and a Lagrangian heuristic based on this formulation are presented, which are used to introduce as many new freight trains by assigning them timetables that are as close as possible to the ideal ones.Abstract:
We study the problem of freight transportation in railway networks, where both passenger and freight trains are run. While the passenger trains have a prescribed timetable that cannot be changed, freight train operators send the infrastructure manager requests to insert new freight trains. For each freight train, the associated train operator specifies a preferred ideal timetable , which can be modified by the infrastructure manager in order to respect safeness operational constraints. In particular, this modification may correspond to routing the train along a path which is different with respect to the one in the ideal timetable. Roughly speaking, the objective is to introduce as many new freight trains as possible by assigning them timetables that are as close as possible to the ideal ones. For this timetabling problem on a generic railway network, we present an integer linear programming formulation, that generalizes some formulations already presented for the case of a single railway line, and a Lagrangian heuristic based on this formulation. Computational results on real-world instances are reported.read more
Citations
More filters
Journal ArticleDOI
Nominal and robust train timetabling problems
Valentina Cacchiani,Paolo Toth +1 more
TL;DR: An overview of the main works on train timetabling is presented, underlining the differences between models and methods that have been developed to tackle the nominal and the robust versions of the problem.
Journal ArticleDOI
Simultaneous train rerouting and rescheduling on an N-track network: A model reformulation with network-based cumulative flow variables
Lingyun Meng,Xuesong Zhou +1 more
TL;DR: This paper develops an innovative integer programming model for the problem of train dispatching on an N-track network by means of simultaneously rerouting and rescheduling trains by adapting a commonly used big-M method to represent complex “if-then” conditions for train safety headways in a multi-track context.
Journal ArticleDOI
Exact formulations and algorithm for the train timetabling problem with dynamic demand
TL;DR: The advantages of designing a timetable adapted to the demand pattern, as opposed to a regular timetable, are shown and an extensive computational comparison of all linear formulations in terms of size, solution quality and running time is performed.
Journal ArticleDOI
Adjusting a railway timetable in case of partial or complete blockades
Ilse Louwerse,Dennis Huisman +1 more
TL;DR: In this article, the authors focus on adjusting the timetable of a passenger railway operator in case of major disruptions, such as partial and complete blockade of a railway line, and present integer programming formulations and test their models using instances from Netherlands Railways.
Journal ArticleDOI
Scheduling freight trains traveling on complex networks
Shi Mu,Maged Dessouky +1 more
TL;DR: Two algorithms based on the idea of decomposition are developed and are shown to significantly outperform two existing algorithms in terms of railway total train delay.
References
More filters
Journal ArticleDOI
Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
TL;DR: This work shows that the vehicle routing problem can be modeled as the problem of finding a minimum cost K-tree with two K edges incident on the depot and subject to some side constraints that impose vehicle capacity and the requirement that each customer be visited exactly once.
Journal ArticleDOI
Modeling and Solving the Train Timetabling Problem
TL;DR: A graph theoretic formulation for the train timetabling problem using a directed multigraph in which nodes correspond to departures/arrivals at a certain station at a given time instant is proposed, used to derive an integer linear programming model that is relaxed in a Lagrangian way.
Book ChapterDOI
Chapter 2 Time constrained routing and scheduling
TL;DR: The chapter discusses fixed schedule problems and develops in detail the Dantzig-Wolfe decomposition/column generation approach which will then be applied to many of the other problem types.
Book ChapterDOI
Passenger Railway Optimization
TL;DR: This chapter discusses the European situation, where the major part of railway transportation consists of passenger transportation without addressing important problems in cargo transportation—such as car blocking, train makeup, train routing, and empty car distribution.