English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Railway crew pairing optimization

Bengtsson, L., Galia, R., Gustafsson, T., Hjorring, C., & Kohl, N. (2007). Railway crew pairing optimization. In F. Geraets (Ed.), Algorithmic methods for railway optimization (pp. 126-144).

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-000D-04C2-3 Version Permalink: https://hdl.handle.net/21.11116/0000-000D-0517-4
Genre: Conference Paper

Files

show Files
hide Files
:
978-3-540-74247-0_6.pdf (Publisher version), 491KB
 
File Permalink:
-
Name:
978-3-540-74247-0_6.pdf
Description:
Archivkopie - Scan aus Bibliotheksbestand
OA-Status:
Visibility:
Restricted (Max Planck Institute for Meteorology, MHMT; )
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
2007
Copyright Info:
© Springer
License:
-

Locators

show

Creators

show
hide
 Creators:
Bengtsson, Lennart1, 2, Author
Galia, Rastislav, Author
Gustafsson, Tomas, Author
Hjorring, Curt, Author
Kohl, Niklas, Author
Affiliations:
1External Organizations, ou_persistent22              
2External Author, MPI for Meteorology, Max Planck Society, ou_3185415              

Content

show
hide
Free keywords: -
 Abstract: The use of automatic crew planning tools within the railway industry is
now becoming wide-spread, thanks to new algorithm development and faster
computers. An example is the large European railway Deutsche Balm, which
is using a commercial crew planning system developed by Jeppesen
(formerly Carmen Systems). This paper focuses on the crew pairing
problem that arises at major railways. Even though it is similar to the
well-studied airline crew pairing problem, the size and complexity of
the railway operation necessitates tailored optimization techniques. We
show that a column generation approach to the pairing problem, which
combines resource constraints, k-shortest path enumeration and label
merging techniques, is able to heuristically solve a 7,000 leg pairing
problem in less than a day.

Details

show
hide
Language(s): eng - English
 Dates: 2007
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: WOS:000252099600006
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithmic methods for railway optimization
Source Genre: Proceedings
 Creator(s):
Geraets, F, Editor
Affiliations:
-
Publ. Info: -
Pages: - Volume / Issue: 4359 Sequence Number: - Start / End Page: 126 - 144 Identifier: ISBN: 978-3-540-74245-6

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -