Abstract
This article presents a novel genetic algorithm designed for the solution of the Crew Scheduling Problem (CSP) in the rail-freight industry. CSP is the task of assigning drivers to a sequence of train trips while ensuring that no driver’s schedule exceeds the permitted working hours, that each driver starts and finishes their day’s work at the same location, and that no train routes are left without a driver. Real-life CSPs are extremely complex due to the large number of trips, opportunities to use other means of transportation, and numerous government regulations and trade union agreements. CSP is usually modelled as a set-covering problem and solved with linear programming methods. However, the sheer volume of data makes the application of conventional techniques computationally expensive, while existing genetic algorithms often struggle to handle the large number of constraints. A genetic algorithm is presented that overcomes these challenges by using an indirect chromosome representation and decoding procedure. Experiments using real schedules on the UK national rail network show that the algorithm provides an effective solution within a faster timeframe than alternative approaches.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barnhart, C., Hatay, L., Johnson, E.L.: Deadhead selection for the long-haul crew pairing problem. Oper. Res. 43(3), 491–499 (1995)
Drexl, M., Prescott-Gagnon, E.: Labelling algorithms for the elementary shortest path problem with resource constraints considering EU drivers’ rules. Log. Res. 2(2), 79–96 (2010)
Duck, V., Wesselmann, F., Suhl, L.: Implementing a branch and price and cut method for the airline crew pairing optimization problem. Pub. Transp. 3(1), 43–64 (2011)
Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(3), 316–329 (1998)
Derigs, U., Malcherek, D., Schafer, S.: Supporting strategic crew management at passenger railway model, method and system. Pub. Transp. 2(4), 307–334 (2010)
Niederer, M.: Optimization of Swissair’s crew scheduling by heuristic methods using integer linear programming models. In: AGIFORS Symposium (1966)
Levine, D.: Application of a hybrid genetic algorithm to airline crew scheduling. Comp. Oper. Res. 23(6), 547–558 (1996)
Santos, A.G., Mateus, G.R.: General hybrid column generation algorithm for crew scheduling problems using genetic algorithm. In: Proceedings of the 2009 Congress on Evolutionary Computation, pp. 1799–1806 (2009)
Zeren, B., Özkol, I.: An improved genetic algorithm for crew pairing optimization. J. Intell. Learn. Sys. Appl. 4(1), 70–80 (2012)
Souai, N., Teghem, J.: Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem. Eur. J. Oper Res. 199(3), 674–683 (2009)
Park, T., Ryu, K.: Crew pairing optimization by a genetic algorithm with unexpressed genes. J. Intell. Manuf. 17(4), 375–383 (2006)
Kornilakis, H., Stamatopoulos, P.: Crew pairing optimization with genetic algorithms. In: Methods and Applications of Artificial Intelligence, pp. 109–120. Springer, Berlin (2002)
Kwan, R.K., Wren, A., Kwan, A.K.: Hybrid genetic algorithms for scheduling bus and train drivers. In: Proceedings of the 2000 Congress on Evolutionary Computation, vol. 1, pp. 282–292 (2000)
Costa, L., Santo, I.E., Oliveira, P.: An adaptive constraint handling technique for evolutionary algorithms. Optimization. 62(2), 241–253 (2013)
Barnhart, C., Hatay, L., Johnson, E.L.: Deadhead selection for the long-haul crew pairing problem. Oper. Res. 43(3), 491–499 (1995)
Ozdemir, H.T., Mohan, C.K.: Flight graph based genetic algorithm for crew scheduling in airlines. Inf. Sci. 133(3–4), 165–173 (2001)
Hopgood, A.A.: Intelligent systems for engineers and scientists, 3rd edn. CRC Press, Boca Raton (2012)
Coello, A.C.: An updated survey of GA-based multiobjective optimization techniques. ACM (2000). doi:10.1145/358923.358929
Gopalakrishnan, B., Johnson, E.L.: Airline crew scheduling: state-of-the-art. Ann. Oper. Res. 140, 305–337 (2005)
Acknowledgments
This research has been supported by Sheffield Business School at Sheffield Hallam University. The authors would like to thank DB-Schenker Rail (UK) for the provision of data and information about real-world crew scheduling operations.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Khmeleva, E., Hopgood, A.A., Tipi, L., Shahidan, M. (2014). Rail-Freight Crew Scheduling with a Genetic Algorithm. In: Bramer, M., Petridis, M. (eds) Research and Development in Intelligent Systems XXXI. SGAI 2014. Springer, Cham. https://doi.org/10.1007/978-3-319-12069-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-12069-0_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12068-3
Online ISBN: 978-3-319-12069-0
eBook Packages: Computer ScienceComputer Science (R0)