IEEJ Transactions on Electronics, Information and Systems
Online ISSN : 1348-8155
Print ISSN : 0385-4221
ISSN-L : 0385-4221
<Systems, Instrument, Control>
Application of Column Generation for Train-set Scheduling Problems with Regular Maintenance Constraints
Akiyoshi OhnoTatsushi NishiMasahiro InuiguchiSatoru TakahashiKenji Ueda
Author information
JOURNALS RESTRICTED ACCESS

2012 Volume 132 Issue 1 Pages 151-159

Details
Abstract

In this paper, we propose a column generation for the train-set scheduling problem with regular maintenance constraints. The problem is to allocate the minimum train-set to the train operations required to operate a given train timetable. In the proposed method, a tight lower bound can be obtained from the continuous relaxation for Dantzig-Wolfe reformulation by column generation. The subproblem for the column generation is an elementary shortest path problem with resource constraints. A labeling algorithm is applied to solve the subproblem. In order to reduce the computational effort for solving subproblems, a new state space relaxation of the subproblem is developed in the labeling algorithm. An upper bound is computed by a heuristic algorithm. Computational results demonstrate the effectiveness of the proposed method.

Information related to the author
© 2012 by the Institute of Electrical Engineers of Japan
Previous article Next article
feedback
Top