Column generation with dual inequalities for railway crew scheduling problems

Tatsushi Nishi, Yuki Muroi, Masahiro Inuiguchi

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

The railway crew scheduling problem is to determine an optimal crew assignment for the railway timetable data by minimizing the required number of crew members in order to satisfy the set covering constraints. Column generation is one of the optimization methods that can solve the problem efficiently. In order to improve the convergence of column generation, we propose dual inequalities for a Dantzig-Wolfe decomposition of railway crew scheduling problems to reduce the number of replications in the column generation procedure. The dual inequalities are generated from the characteristic of the given railway timetable data. Computational results demonstrate the effectiveness of the proposed method compared with the conventional column generation for an actual railway timetable data.

Original languageEnglish
Pages (from-to)25-42
Number of pages18
JournalPublic Transport
Volume3
Issue number1
DOIs
Publication statusPublished - Feb 2011
Externally publishedYes

Keywords

  • Column generation
  • Combinatorial optimization
  • Dual inequality
  • Railway crew scheduling
  • Set covering problem

ASJC Scopus subject areas

  • Information Systems
  • Transportation
  • Mechanical Engineering
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Column generation with dual inequalities for railway crew scheduling problems'. Together they form a unique fingerprint.

  • Cite this