About this Journal Submit a Manuscript Table of Contents
Discrete Dynamics in Nature and Society
Volume 2014 (2014), Article ID 910569, 10 pages
http://dx.doi.org/10.1155/2014/910569
Research Article

Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines

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

Received 18 November 2013; Accepted 1 January 2014; Published 11 March 2014

Academic Editor: Huimin Niu

Copyright © 2014 Zhiqiang Tian. 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. N. Kohl and S. E. Karisch, “Airline crew rostering: problem types, modeling, and optimization,” Annals of Operations Research, vol. 127, no. 1–4, pp. 223–257, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. A. M. Cohn and C. Barnhart, “Improving crew scheduling by incorporating key maintenance routing decisions,” Operations Research, vol. 51, no. 3, pp. 387–396, 2003. View at Zentralblatt MATH · View at MathSciNet
  3. S. Jütte and U. W. Thonemann, “Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems,” European Journal of Operational Research, vol. 219, no. 2, pp. 214–223, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. C. Barnhart, L. Hatay, and E. L. Johnson, “Deadhead selection for the long-haul crew pairing problem,” Operations Research, vol. 43, no. 3, pp. 491–495, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. G. W. Graves, R. D. McBride, I. Gershkoff, D. Anderson, and D. Mahidhara, “Flight crew scheduling,” Management Science, vol. 39, no. 6, pp. 736–745, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. A. T. Ernst, H. Jiang, M. Krishnamoorthy, and D. Sier, “Staff scheduling and rostering: a review of applications, methods and models,” European Journal of Operational Research, vol. 153, no. 1, pp. 3–27, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. T. Emden-Weinert, H. Kotas, and U. Speer, “DISSY-A Driver Scheduling System for Public Transport. Version 1.0,” 2001, http://wenku.baidu.com/view/4e960e0d76c66137ee06196d.html.
  8. M. Gamache, F. Soumis, G. Marquis, and J. Desrosiers, “Column generation approach for large-scale aircrew rostering problems,” Operations Research, vol. 47, no. 2, pp. 247–262, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. S. C. K. Chu, “Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong International Airport,” European Journal of Operational Research, vol. 177, no. 3, pp. 1764–1778, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. J. Desrosiers, A. Lasry, D. McInnis, M. M. Solomon, and F. Soumis, “Air transat uses ALTITUDE to manage its aircraft routing, crew pairing, and work assignment,” Interfaces, vol. 30, no. 2, pp. 41–53, 2000.
  11. B. Maenhout and M. Vanhoucke, “A hybrid scatter search heuristic for personalized crew rostering in the airline industry,” European Journal of Operational Research, vol. 206, no. 1, pp. 155–167, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. F.-Y. Chu, Z.-Q. Tian, and S.-Q. Ni, “Model and algorithm for formulation of the single cycle crew rostering plans of high-speed railway,” Journal of the China Railway Society, vol. 34, no. 7, pp. 1–9, 2012.
  13. A. Corominas, R. Pastor, and E. Rodríguez, “Rotational allocation of tasks to multifunctional workers in a service industry,” International Journal of Production Economics, vol. 103, no. 1, pp. 3–9, 2006. View at Publisher · View at Google Scholar · View at Scopus
  14. A. N. Avramidis, W. Chan, and P. L'Ecuyer, “Staffing multi-skill call centers via search methods and a performance approximation,” IIE Transactions, vol. 41, no. 6, pp. 483–497, 2009. View at Publisher · View at Google Scholar · View at Scopus
  15. J. Buhr, “Four methods for monthly crew assignment-a comparison of efficiency,” in Proceedings of the AGIFORS Symposium, vol. 18, pp. 403–430, 1978.
  16. N. Beaumont, “Using mixed integer programming to design employee rosters,” The Journal of the Operational Research Society, vol. 48, no. 6, pp. 585–590, 1997. View at Zentralblatt MATH · View at Scopus
  17. D. M. Ryan, “The solution of massive generalized set partitioning problems in air crew rostering,” The Journal of the Operational Research Society, vol. 43, pp. 459–467, 1992.
  18. 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 Publisher · View at Google Scholar · View at Scopus
  19. P. Lučić and D. Teodorović, “Simulated annealing for the multi-objective aircrew rostering problem,” Transportation Research A, vol. 33, pp. 19–45, 1999.
  20. 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 Zentralblatt MATH · View at Scopus
  21. 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. View at Publisher · View at Google Scholar
  22. B. Santosa, A. Sunarto, and A. Rahman, “Using differential evolution method to solve crew rostering problem,” Applied Mathematics, vol. 1, no. 4, pp. 316–325, 2010. View at Publisher · View at Google Scholar
  23. A. Monfroglio, “Hybrid genetic algorithms for a rostering problem,” Software Practices Expert, vol. 26, no. 7, pp. 851–862, 1996.
  24. Z. Tian and H. Niu, “Modeling and algorithms of the crew rostering problem with given cycle on high-speed railway lines,” Mathematical Problems in Engineering, vol. 2012, Article ID 214607, 15 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. H. Niu and M. Zhang, “An optimization to schedule train operations with phase-regular framework for intercity rail lines,” Discrete Dynamics in Nature and Society, vol. 2012, Article ID 549374, 13 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  26. H. Niu and X. Zhou, “Optimizing urban rail timetable under time-dependent demand and oversaturated conditions,” Transportation Research C, vol. 36, pp. 212–230, 2013. View at Publisher · View at Google Scholar
  27. M. Dell'Amico and S. Martello, “Bounds for the cardinality constrained PCmax problem,” Journal of Scheduling, vol. 4, no. 3, pp. 123–138, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. K. R. Baker, Introduction to Sequencing and Scheduling, John Wiley & Sons, New York, NY, USA, 1974.
  29. R. L. Graham, “Bounds on multiprocessing timing anomalies,” SIAM Journal on Applied Mathematics, vol. 17, no. 2, pp. 416–429, 1969. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. H. Kellerer and G. Woeginger, “A tight bound for 3-partitioning,” Discrete Applied Mathematics, vol. 45, no. 3, pp. 249–259, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  31. 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