書誌事項
- タイトル別名
-
- A Decomposition Approach to Railway Crew Rostering Problems for Fair Labor Condition
- ロウドウ ジョウケン ノ コウヘイカ オ モクテキ ト シタ テツドウ ジョウムカツ コウバン サクセイ モンダイ ニ タイスル ブンカイホウ
この論文をさがす
抄録
The railway crew rostering problem aims to find an optimal assignment and cyclic sequence of crew duties to a set of rosters satisfying several labor conditions. We propose a novel decomposition approach to solve the railway crew rostering problem with the objective of fair labor condition in order to reduce the computational effort. The proposed method decomposes the original problem into two levels. The upper level master problem determines an assignment of crew duties to the set of rosters without sequencing, and the lower level subproblem generates a feasible cyclic sequence of crew duties including several resting times. Three types of effective cuts are proposed to reduce the feasible search space to tighten the gap between the solutions of the two level problems. Computational results demonstrate the effectiveness of the proposed method compared with that of the constrainted programming technique. <br>
収録刊行物
-
- システム制御情報学会論文誌
-
システム制御情報学会論文誌 25 (10), 272-280, 2012
一般社団法人 システム制御情報学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390001205165357184
-
- NII論文ID
- 10031140171
-
- NII書誌ID
- AN1013280X
-
- ISSN
- 2185811X
- 13425668
-
- NDL書誌ID
- 023997797
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可