TY - JOUR
T1 - An application of wedelin's method to railway crew scheduling problem
AU - Miura, Rei
AU - Imaizumi, Jun
AU - Fukumura, Naoto
AU - Morito, Susumu
PY - 2009
Y1 - 2009
N2 - So many scheduling problems arise in railway industries. One of the typical scheduling problems is Crew Scheduling Problem. Much attention has been paid to this problem by a lot of researchers, but many studies have not been done to the problems in railway industries in Japan. In this paper, we consider a railway crew scheduling problem in Japan. The problem can be formulated into Set Covering Problem (SCP). In SCP, a row corresponds to a trip representing a minimal task and a column corresponds to a pairing representing a sequence of trips performed by a certain crew. Many algorithms have been developed and proposed for it. On the other hand, in practical use, it is important to investigate how these algorithms behave and work on a certain problem. Therefore, we focus on Wedelin's algorithm, which is based on Lagrange relaxation and is known as one of the high performance algorithms for SCP, and mainly examine the basic idea of this algorithm. Furthermore, we show effectiveness of this procedure through computational experiments on instances from Japanese railway.
AB - So many scheduling problems arise in railway industries. One of the typical scheduling problems is Crew Scheduling Problem. Much attention has been paid to this problem by a lot of researchers, but many studies have not been done to the problems in railway industries in Japan. In this paper, we consider a railway crew scheduling problem in Japan. The problem can be formulated into Set Covering Problem (SCP). In SCP, a row corresponds to a trip representing a minimal task and a column corresponds to a pairing representing a sequence of trips performed by a certain crew. Many algorithms have been developed and proposed for it. On the other hand, in practical use, it is important to investigate how these algorithms behave and work on a certain problem. Therefore, we focus on Wedelin's algorithm, which is based on Lagrange relaxation and is known as one of the high performance algorithms for SCP, and mainly examine the basic idea of this algorithm. Furthermore, we show effectiveness of this procedure through computational experiments on instances from Japanese railway.
KW - Crew scheduling problem
KW - Heuristic
KW - Mathematical programming
KW - Performance evaluation by computational experiments
KW - Railway
UR - http://www.scopus.com/inward/record.url?scp=70450216485&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70450216485&partnerID=8YFLogxK
U2 - 10.1541/ieejeiss.129.1958
DO - 10.1541/ieejeiss.129.1958
M3 - Article
AN - SCOPUS:70450216485
VL - 129
SP - 1958
EP - 1967
JO - IEEJ Transactions on Electronics, Information and Systems
JF - IEEJ Transactions on Electronics, Information and Systems
SN - 0385-4221
IS - 10
ER -