A new approach to crew scheduling in rapid transit networks

Citations of this article
Mendeley users who have this article in their library.


We propose a new approach for the crew scheduling problem in rapid transit networks. With this approach we try to open a new branch for future research, providing a different way of facing the crew scheduling problem which makes integration with other planning problems easier than the traditional approach based on column generation for solving a set covering/partitioning problem. For solving this new model we develop a Lagrangian relaxation and we take advantage of an ad hoc decomposition based on time- personnel clustering. We present some preliminary computational experiments for real case studies drawn from the main Spanish train operator, RENFE.




Fuentes, M., Cadarso, L., & Marín, Á. (2015). A new approach to crew scheduling in rapid transit networks. In Transportation Research Procedia (Vol. 10, pp. 554–563). Elsevier. https://doi.org/10.1016/j.trpro.2015.09.009

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free