Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience

نویسندگان

  • Alberto Caprara
  • Matteo Fischetti
  • Pier Luigi Guida
  • Paolo Toth
چکیده

Crew scheduling is a very well known problem which has been historically associated with airlines and mass transit companies; recently also railway applications have come on the scene. This now happens especially in Europe, where deregulation and privatization issues are forcing a reorganization of the rail industry and better productivity and eecient services are strongly required by the market and the public ownership. Therefore, this sector is showing an increasing interest in Operations Research and Management Science. Railway crew planning represents a hard problem due to both the dimensions and the operational/regulation constraints involved. This paper gives an account of the development of a new crew planning system set up by Ferrovie dello Stato SpA (the Italian railway company) in cooperation with the University of Bologna. 1 European railways: a new scenario The European railways are being reshaped by a new phase of their historical life cycle, where privatization and deregulation are the underlining themes of the sector. This also follows general European Union (EU) policy directives concerning the separation of the railway system into separate enterprises: infrastructure or track management companies, and transport or train operating companies. The infrastructure company should retain state control in the rail business through natural monopoly or government regulations and investments. On the other hand, train operations should give rise to a number of independent and more business-oriented companies, which have access to the infrastructure via a market mechanism such as payment of track fees. This represents a major change from the traditional status of the European railways, usually regarded as totally state-owned and vertically-integrated industries. Although this scenario takes diierent forms in various European countries, it is nevertheless established as the current trend and long-term objective of the railway industry. (However, some protected segments, such as regional and local services with social interest , may not be aaected by these objectives.) The new rail policy, which has close 1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Mathematical Models for Railway Crew Scheduling Problem

Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...

متن کامل

Algorithms for railway crew management

Crew management is concerned with building the work schedules of crews needed to cover a planned timetable. This is a well-known problem in Operations Research and has been historically associated with airlines and mass-transit companies. More recently, railway applications have also come on the scene, especially in Europe. In practice, the overall crew management problem is decomposed into two...

متن کامل

A Comprehensive Approach for Railway Crew Scheduling Problem (Case Study: Iranian Railway Network)

The aim of this study is to propose a comprehensive approach for handling the crew scheduling problem in the railway systems. In this approach, the information of different railway trips are considered as input and the problem is divided to three separated phases. In phase I, we generate all feasible sequences of the trips, which are named as the pairings. A depth-first search algorithm is deve...

متن کامل

Solving railway line planning problems using a decomposition algorithm

The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....

متن کامل

A Heuristic Method for the Set Covering Problem

We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm was initially designed for solving very large scale SCP instances, involving up to 5,000 rows and 1,000,000 columns, arising from crew scheduling in the Italian Railway Company, Ferrovie dello Stato SpA. In 1994 Ferrovie dello Stato SpA, jointly with the Italian Operational Research Society, org...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997