600 research outputs found
Shunting of Passenger Train Units in a Railway Station
In this paper we introduce the problem of shunting passenger trainunits in a railway station. Shunting occurs whenever train units aretemporarily not necessary to operate a given timetable. We discussseveral aspects of this problem and focus on two subproblems. Wepropose mathematical models for these subproblems together with asolution method based on column generation. Furthermore, a newefficient and speedy solution technique for pricing problems in columngeneration algorithms is introduced. Finally, we present computationalresults based on real life instances from Netherlands Railways.logistics;column generation;railway optimization;real world application
Is Equality always desirable?
In this paper, we analyze the trade-off between perceived fairness and perceived attractiveness in crew rostering.
First, we introduce the Fairness-oriented Crew Rostering Problem. In this problem, attractive cyclic rosters have to be constructed, while respecting a pre-specified fairness level. Then, we propose a flexible mathematical formulation, able to exploit problem specific knowledge, and develop an exact Branch-Price-and-Cut solution method.
The solution method combines Branch-and-Bound with column generation, where profitable columns are separated by solving resource constrained shortest path problems with surplus variables. We also derive a set of valid inequalities to tighten the formulation. Finally, we demonstrate the benefit of our approach on practical instances from Netherlands Railways, the largest passenger railway operator in the Netherlands.
We are able to construct the explicit trade-off curve between fairness and attractiveness and show that a sequential approach can lead to suboptimal results. In particular, we show that focusing solely on fairness leads to rosters that are disproportionally less attractive. Furthermore, this decrease in attractiveness is heavily skewed towards the most exible employees. Thus, in order to generate truly fair rosters, the explicit trade-off between fairness and attractiveness should be considered
Operations research in passenger railway transportation
In this paper, we give an overview of state-of-the-art OperationsResearch models and techniques used in passenger railwaytransportation. For each planning phase (strategic, tactical andoperational), we describe the planning problems arising there anddiscuss some models and algorithms to solve them. We do not onlyconsider classical, well-known topics such as timetabling, rollingstock scheduling and crew scheduling, but we also discuss somerecently developed topics as shunting and reliability oftimetables.Finally, we focus on several practical aspects for each of theseproblems at the largest Dutch railway operator, NS Reizigers.passenger railway transportation;operation research;planning problems
The matching relaxation for a class of generalized set partitioning problems
This paper introduces a discrete relaxation for the class of combinatorial
optimization problems which can be described by a set partitioning formulation
under packing constraints. We present two combinatorial relaxations based on
computing maximum weighted matchings in suitable graphs. Besides providing dual
bounds, the relaxations are also used on a variable reduction technique and a
matheuristic. We show how that general method can be tailored to sample
applications, and also perform a successful computational evaluation with
benchmark instances of a problem in maritime logistics.Comment: 33 pages. A preliminary (4-page) version of this paper was presented
at CTW 2016 (Cologne-Twente Workshop on Graphs and Combinatorial
Optimization), with proceedings on Electronic Notes in Discrete Mathematic
Modeling and Solving of Railway Optimization Problems
The main aim of this work is to provide decision makers suitable approaches for solving two crucial planning problems in the railway industry: the locomotive assignment problem and the crew scheduling problem with attendance rates. On the one hand, the focus is on practical usability and the necessary integration and consideration of real-life requirements in the planning process. On the other hand, solution approaches are to be developed, which can provide solutions of sufficiently good quality within a reasonable time by taking all these requirements into account
A decomposition approach to the integrated vehicle-crew-rostering problem
The problem addressed in this paper is the integrated vehicle-crew-rostering problem (VCRP) aiming to define the schedules for the buses and the rosters for the drivers of a public transit company. The VCRP is described by a bi-objective mixed binary linear programming model with one objective function aggregating vehicle and crew scheduling costs and the other the rostering features. The VCRP is solved by a heuristic approach based on Benders decomposition where the master problem is partitioned into daily integrated vehicle-crew scheduling problems and the sub-problem is a rostering problem. Computational experience with data from a bus company in Lisbon shows the ability of the decomposition approach for producing a variety of potentially efficient solutions for the VCRP within low computing times
Crew Planning at Netherlands Railways: Improving Fairness, Attractiveness, and Efficiency
The development and improvement of decision support voor crew planning at Netherlands Railways (NS
- ā¦