Abstract
The purpose of this research is to develop two manpower supply planning models and a solution algorithm for mass rapid transit carriage maintenance under mixed deterministic and stochastic demands. These models are formulated as mixed integer programs that are characterized as NP-hard. We employ problem decomposition techniques, coupled with the CPLEX mathematical programming solver, to develop an algorithm that is capable of efficiently solving the problems. The models and the method used currently in actual operations are evaluated by a simulation-based evaluation method. Finally, we perform a case study using real operating data from a Taiwan MRT maintenance facility. The preliminary results are good, showing that the models could be useful for planning carriage maintenance manpower supply.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Change history
03 November 2017
In the original article (Chen et al. 2010), the authors inadvertently did not reference their previous work to which this article (Chen et al. 2010) is related. The reference list has been updated with the addition of Chen et al. (2008) to reflect this. The authors apologize for any inconvenience they might have caused.
References
Ahmed, S., & Shapiro, A. (2002). The sample average approximation method for stochastic programs with integer recourse. Optimization online, http://www.optimization-online.org.
Alfares, H. K. (1998). An efficient two-phase algorithm for cyclic days-off scheduling. Computers and Operations Research, 25, 913–923.
Aykin, T. (2000). A comparative evaluation of modeling approaches to the labor shift scheduling problem. European Journal of Operational Research, 125, 381–397.
Beaumont, N. (1997). Scheduling staff using mixed integer programming. European Journal of Operational Research, 98, 473–484.
Bechtold, S. E., Brusco, M. J., & Showalter, M. J. (1991). A comparative evaluation of labor tour scheduling method. Decision Sciences, 22, 683–699.
Birge, J. R., & Louveaux, F. (1997). Introduction to stochastic programming. New York: Springer.
Blyton, P., & Morris, J. (1992). HRM and the limits of flexibility. In P. Blyton, & P. Turnbull (Eds.), Reassessing human resource management (pp. 116–130).
Brusco, M. J. (1998). Solving personnel tour scheduling problems using the dual all-integer cutting plane. IIE Transaction, 30, 835–844.
Brusco, M. J., & Johns, T. R. (1995). Improving the dispersion of surplus labor in personnel scheduling solutions. Computers and Industrial Engineering, 28, 745–754.
Brusco, M. J., & Johns, T. R. (1996). A sequential integer programming method for discontinuous labor tour scheduling. European Journal of Operational Research, 95, 537–548.
Caprara, A., Fischetti, M., Toth, P., Vigo, D., & Guida, P. L. (1997). Algorithms for railway crew management. Mathematical Programming, 79, 125–141.
Carøe, C. C., & Schultz, R. (1999). Dual decomposition in stochastic integer programming. Operations Research Letters, 24, 37–45.
Du, Y., & Hall, R. (1997). Fleet sizing and empty equipment redistribution for center-terminal transportation networks. Management Science, 43, 145–157.
Dupačová, J., Gröwe-Kuska, N., & Römisch, W. (2003). Scenario reduction in stochastic programming. Mathematical Programming, 95, 493–511.
Easton, F. F., & Rossin, D. F. (1991). Equivalent alternate solutions for the tour scheduling problem. Decision Sciences, 22, 985–1007.
Ermoliev, Y. M., & Gaivoronski, A. A. (1992). Stochastic quasigradient methods for optimization of discrete event systems. Annals of Operations Research, 39, 1–39.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman.
Higgins, A. (1998). Scheduling of railway track maintenance activities and crews. Journal of the Operational Research Society, 49, 1026–1033.
Higle, J. L., & Sen, S. (1991). Stochastic decomposition: an algorithm for two-stage linear programs with recourse. Mathematics of Operations Research, 16, 650–669.
Infanger, G. (1994). Planning under uncertainty: solving large-scale stochastic linear programs. Danvers: Boyd and Fraser.
Kaut, M., & Wallace, S. W. (2007). Evaluation of scenario-generation methods for stochastic programming. Pacific Journal of Optimization, 3, 257–271.
Kenyon, S., & Morton, D. P. (2003). Stochastic vehicle routing with random travel times. Transportation Science, 37, 69–82.
Langerman, J. J., & Ehlers, E. M. (1997). Agent-based airline scheduling. Computers and Industrial Engineering, 33, 849–852.
Lau, H. C. (1996). On the complexity of manpower shift scheduling. Computers and Industrial Engineering, 23, 93–102.
List, G. F., Wood, B., Nozick, L. K., Turnquist, M. A., Jones, D. A., Kjeldgaard, E. A., & Lawton, C. R. (2003). Robust optimization for fleet planning under uncertainty. Transportation Research Part E, 39, 209–227.
Morris, J. G., & Showalter, M. J. (1983). Simple approaches to shift, days-off and tour scheduling problems. Management Science, 29, 942–950.
Mulvey, J. M., & Ruszczyński, A. (1995). A new scenario decomposition method for large-scale stochastic optimization. Operations Research, 43, 477–490.
Narasimhan, R. (1996). An algorithm for single shift scheduling of hierarchical workforce. European Journal of Operational Research, 96, 113–121.
Rockafellar, R. T., & Wets, R. J. B. (1991). Scenarios and policy aggregation in optimization under uncertainty. Mathematics of Operations Research, 16(1), 119–147.
Römisch, W., & Heitsch, H. (2003). Scenario reduction algorithms in stochastic programming. Computational Optimization and Applications, 24, 187–206.
Ruszczyński, A., & Shapiro, A. (2003). Stochastic programming. Amsterdam: Elsevier.
Ryan, D. M. (1992). The solution of massive generalized set partitioning problem in aircrew rostering. Journal of the Operational Research Society, 43, 459–467.
Shapiro, A., Dentcheva, D., & Ruszczyński, A. (2009). Lectures on stochastic programming: modeling and theory. Philadelphia: SIAM.
Teodorović, D., & Lučić, P. (1998). A fuzzy set theory approach to the aircrew rostering problem. Fuzzy Set and System, 95, 261–271.
Yan, S., & Tu, Y. P. (2002). A network model for airline cabin crew scheduling. European Journal of Operational Research, 140, 531–540.
Yan, S., Shieh, W., & Chen, M. (2002). A simulation framework for evaluating airport gate assignments. Transportation Research Part A, 36, 885–898.
Yan, S., Yang, D. H., & Chen, S. H. (2004). Airline short-term maintenance manpower supply planning. Transportation Research Part A, 38, 615–642.
Yan, S., Chen, C. H., & Chen, C. K. (2006a). Long-term manpower supply planning for air cargo terminals. Journal of Air Transport Management, 12, 175–181.
Yan, S., Chen, C. K., & Chen, C. H. (2006b). Cargo terminal shift setting and manpower supplying in short-term operations. Journal of Marine Science and Technology, 14, 109–118.
Yan, S., Chi, C. J., & Tang, C. H. (2006c). Inter-City bus routing and timetable setting under stochastic demands. Transportation Research Part A, 40, 572–586.
Yan, S., Chen, C. H., & Chen, C. K. (2008a). Short-term shift setting and manpower supplying under stochastic demands for air cargo terminals. Transportation, 35, 425–444.
Yan, S., Chen, C. H., & Chen, M. (2008b). The manpower supply planning and shift setting for mass rapid transit carriage maintenance in short-term operations. Journal of Marine Science and Technology, 16, 301–307.
Author information
Authors and Affiliations
Corresponding author
Additional information
A correction to this article is available online at https://doi.org/10.1007/s10479-017-2703-0.
Rights and permissions
About this article
Cite this article
Chen, CH., Yan, S. & Chen, M. Short-term manpower planning for MRT carriage maintenance under mixed deterministic and stochastic demands. Ann Oper Res 181, 67–88 (2010). https://doi.org/10.1007/s10479-010-0689-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0689-y