Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 214607, 15 pages
http://dx.doi.org/10.1155/2012/214607
Research Article

Modeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway Lines

School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, China

Received 18 June 2012; Revised 6 September 2012; Accepted 7 September 2012

Academic Editor: Wuhong Wang

Copyright © 2012 Zhiqiang Tian and Huimin Niu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Buhr, “Four methods for monthly crew assignment-a comparison of efficiency,” in Proceedings of the AGIFORS Symposium, vol. 18, pp. 403–430, 1978.
  2. B. Nicoletti, “Automatic crew rostering,” Transportation Science, vol. 9, no. 1, pp. 33–42, 1975. View at Google Scholar · View at Scopus
  3. D. Teodorović and P. Lučić, “A fuzzy set theory approach to the aircrew rostering problem,” Fuzzy Sets and Systems, vol. 95, no. 3, pp. 261–271, 1998. View at Google Scholar · View at Scopus
  4. R. Moore, J. Evans, and H. Noo, “Computerized tailored blocking,” in Proceedings of the AGIFORS Symposium, vol. 18, pp. 343–361, 1978.
  5. J. Byrne, “A preferential bidding system for technical aircrew,” Proceedings of the AGIFORS Symposium, vol. 28, pp. 87–99, 1988. View at Google Scholar
  6. P. Lučić and D. Teodorović, “Simulated annealing for the multi-objective aircrew rostering problem,” Transportation Research A, vol. 33, no. 1, pp. 19–45, 1999. View at Google Scholar · View at Scopus
  7. H. Dawid, J. König, and C. Strauss, “An enhanced rostering model for airline crews,” Computers and Operations Research, vol. 28, no. 7, pp. 671–688, 2001. View at Publisher · View at Google Scholar · View at Scopus
  8. A. Monfroglio, “Hybrid genetic algorithms for a rostering problem,” Software: Practice and Experience, vol. 26, no. 7, pp. 851–862, 1996. View at Google Scholar · View at Scopus
  9. A. Ernst, M. Krishnamoorthy, and D. Dowling, “Train crew rostering using simulated annealing,” in Proceedings of the International Conference on Optimization: Techniques and Applications (ICOTA '98), Perth, Australia, 1998.
  10. D. M. Ryan, “The solution of massive generalized set partitioning problems in air crew rostering,” Journal of the Operational Research Society, vol. 43, pp. 459–467, 1992. View at Google Scholar
  11. M. Gamache and F. Soumis, “A method for optimally solving the rostering problem,” Cahier Du GERAD, G-90-40 H3T 1V6, Ecole des Hautes Etudes Commerciales, Montreal, Canada, 1993. View at Google Scholar
  12. M. Dorigo and L. M. Gambardella, “Ant colonies for the travelling salesman problem,” BioSystems, vol. 43, no. 2, pp. 73–81, 1997. View at Publisher · View at Google Scholar · View at Scopus
  13. F. D. Croce, R. Tadei, and G. Volta, “A genetic algorithm for the job shop problem,” Computers and Operations Research, vol. 22, no. 1, pp. 15–24, 1995. View at Google Scholar · View at Scopus
  14. M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 26, no. 1, pp. 29–41, 1996. View at Google Scholar · View at Scopus
  15. M. Desrochers and F. Soumis, “A column generation approach to the urban transit crew scheduling problem,” Transportation Science, vol. 23, no. 1, pp. 1–14, 1989. View at Google Scholar