Abstract
This paper presents an algorithm for a crew pairing optimization, which is an essential part of crew scheduling. The algorithm first generates many pairings and then finds their best subset by a genetic algorithm which incorporates unexpressed genes. The genetic algorithm used employs greedy crossover and mutation operators specially designed to work with chromosomes of set-oriented representation. As a means of overcoming the premature convergence problem caused by greedy genetic operators, the chromosome is made up of an expressed part and an unexpressed part. The presented method was tested on real crew scheduling data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bodin, L., Golden, B., Assad, A., Ball, M.: Routing and scheduling of vehicles and crews: the state of the art. Computers and Operations Research 10, 63–211 (1983)
Caparara, A., Fischetti, M., Guida, P.L., Toth, P., Vigo, D.: Solution of large-scale railway crew planning problems: The Italian experience. Technical Report OR-97-9, DEIS University of Bologna (1997)
Beasly, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94, 392–404 (1996)
Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch and price: Column generation for huge integer programs. Operations Research 46, 316–329 (1998)
Hwang, J., Kang, C.S., Ryu, K.R., Han, Y., Choi, H.R.: A Hybrid of Tabu Search and Integer Programming for Subway Crew Scheduling Optimization. In: IASTED-ASC, pp. 72–77 (2002)
Park, T., Ryu, K.R.: Exploiting Unexpressed Genes for Solving Large-Scaled Maximal Covering Problems. In: Zhang, C., Guesgen, H.W., Yeap, W.-K. (eds.) PRICAI 2004. LNCS, vol. 3157, pp. 342–351. Springer, Heidelberg (2004)
Crawford, K.D., Hoelting, C.J., Wainwright, R.L., Schoenefeld, D.A.: A study of fixed-length subset recombination. In: Foundations of Genetic Algorithm 4 (1996)
Radcliffe, N.J.: Genetic set recombination. In: Foundations of Genetic Algorithms 2, vol. 2. Morgan Kaufmann, San Francisco (1993)
Mahfoud, S.W.: Crowding and preselection revisited. In: Proceedings Second Conference Parallel Problem Solving from Nature (1992)
Goldberg, D.E., Richardson, J.: Genetic algorithm with sharing for multimodal function optimization. In: Proceedings of the Second International conference on Genetic Algorithm, pp. 41–49 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, T., Ryu, K.R. (2006). Solving a Large-Scaled Crew Pairing Problem by Using a Genetic Algorithm. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_26
Download citation
DOI: https://doi.org/10.1007/11779568_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35453-6
Online ISBN: 978-3-540-35454-3
eBook Packages: Computer ScienceComputer Science (R0)