TY - GEN
T1 - Hybrid algorithm of tabu search and integer programming for the railway crew scheduling problem
AU - Guillermo, Cabrera G.
AU - José, Miguel Rubio L.
PY - 2009
Y1 - 2009
N2 - The Crew Scheduling Problem (CSP) is an important problem for the transportation enterprises, especially when crew's cost is increasing. This justifies the researcher's effort in order to create algorithms which obtain good solutions for this kind of problems. Particularly, hybrid algorithms appear as an efficient alternative in order to solve any combinatorial optimization problem. Tabu Search (TS) is a simple metaheuristic which has been applied in many combinatorial problems, obtaining very competitive solutions. Integer Programming (IP), in this case, allows to the TS algorithm to have a good level of diversification, avoiding that it's converge to local optimal solutions. In this article we presents an hybrid algorithm of Tabu Search and Integer Programming which is applied to the both CSP instances obtained from the literature and a real application case in Chile (MERVAL). The hybrid algorithm obtains good solutions in both cases, and obtains an important minimization in the execution time in the MERVAL case.
AB - The Crew Scheduling Problem (CSP) is an important problem for the transportation enterprises, especially when crew's cost is increasing. This justifies the researcher's effort in order to create algorithms which obtain good solutions for this kind of problems. Particularly, hybrid algorithms appear as an efficient alternative in order to solve any combinatorial optimization problem. Tabu Search (TS) is a simple metaheuristic which has been applied in many combinatorial problems, obtaining very competitive solutions. Integer Programming (IP), in this case, allows to the TS algorithm to have a good level of diversification, avoiding that it's converge to local optimal solutions. In this article we presents an hybrid algorithm of Tabu Search and Integer Programming which is applied to the both CSP instances obtained from the literature and a real application case in Chile (MERVAL). The hybrid algorithm obtains good solutions in both cases, and obtains an important minimization in the execution time in the MERVAL case.
KW - Crew scheduling problem
KW - Hybrid algorithms
KW - Integer programming
KW - Tabu search
UR - http://www.scopus.com/inward/record.url?scp=77749280364&partnerID=8YFLogxK
U2 - 10.1109/PACIIA.2009.5406571
DO - 10.1109/PACIIA.2009.5406571
M3 - Conference contribution
AN - SCOPUS:77749280364
SN - 9781424446070
T3 - PACIIA 2009 - 2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications
SP - 413
EP - 416
BT - PACIIA 2009 - 2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications
T2 - 2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications, PACIIA 2009
Y2 - 28 November 2009 through 29 November 2009
ER -