Combining Heuristic and Utility Function for Fair Train Crew Rostering

Ademir Aparecido Constantino, Candido Ferreira Xavier de Mendonça, Antonio Galvão Novaes, Allainclair Flausino dos Santos

2015

Abstract

In this paper we address the problem of defining a work assignment for train drivers within a monthly planning horizon with even distribution of satisfaction based on a real-would problem. We propose an utility function, in order to measure the individual satisfaction, and a heuristic approach to construct and assign the rosters. In the first phase we apply stated preference methods to devise a utility function. The second phase we apply a heuristic algorithm which constructs and assigns the rosters based on the previous utility function. The heuristic algorithm constructs a cyclic roster in order to find out a minimum number of train drivers required for the job. The cyclic roster generated is divided into different truncated rosters and assigned to each driver in such way the satisfactions should be evenly distributed among all drivers as much as possible. Computational tests are carried out using real data instance of a Brazilian railway company. Our experiments indicated that the proposed method is feasible to reusing the discrepancies between the individual rosters.

References

  1. Ben-Akiva, M. and Lerman, S. R., 1985. Discrete Choice Analysis: Theory and Application to Travel Demand. The Mit Press, Cambridge, Massachusetts.
  2. Benjamin, D. J., Heffetz, O. and Kimball, M. S. 2014. Beyond Happiness and Satisfaction: Toward WellBeing Indices Based on Stated Preference. The American Economic Review, 104(9), pp. 2698-2735.
  3. Bianco, L., Bielli, M., Mingozzi, A., Ricciardelli, S. and Spadoni, M., 1992. A Heuristic Procedure for the Crew Rostering Problem. European Journal of Operational Research, 58(2), 272-283.
  4. Bodin, L., Golden, B., Assad, A. and Ball, M., 1983. Routing and Scheduling of Vehicles and Crews. Computers and Operations Research, 10(2), 127-147.
  5. Caprara, A., Fischetti, M., Toth, P. and Vigo, D., 1998. Modeling and Solving the Crew Rostering Problem. Operatons Research, 46(6), pp. 820-830.
  6. Caprara, A., Focacci, F., Lamma, E., Mello, P., Milano, M., Toth, P. and Vigo, D., 1998. Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem. Software Practice and Experience, 28, 49-76.
  7. Carpaneto G. and Toth P., 1987. 'Primal-Dual Algorithms for the Assignment Problem. Discrete Applied Mathematics, 18, 137-153.
  8. Carraresi, P. and Gallo, G., 1984. A Multi-level Bottleneck Assignment Approach to the Bus Drivers' Rostering Problem. European Journal of Operational Research, 16, pp. 163-173.
  9. Carson, R. T. and Louviere, J. J., 2011. A Common Nomenclature for Stated Preference Elicitation Approaches, Environmental and Resource Economics, 49 (4), pp. 539-559.
  10. EL Moudani, W., Mora-Camino, F., 2000. A fuzzy solution approach for the roster planning problem. Proceeding of 9th IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2000), San Antonio (USA), 7-10 Mai 2000, pp. 346-351.
  11. Ernst, A. H. Jiang, T., Krishnamoorthy, M., Nott, H. and Sier, D., 2000. Rail crew scheduling and rostering: Optimisation Algorithms. Proceeding of 8th International Conference: Computer Aided Scheduling of Public Transport, (Berlin, Germany).
  12. Ernst, A. H. Jiang, T., Krishnamoorthy, M., Nott, H., Owens, B. and Sier, D., 2004. An Anotated Bibliography of Personnel Scheduling and Rostering. Annals of OR, 127, pp. 21-144.
  13. Ernst, A. T., Jiang, H., Krishnamoorthy, M., Nott, H., and Sier, D., 2001. Na Integrated Optimizations Model for Train Crew Management. Annals of OR, 108, pp. 211- 224.
  14. Ernst, A. T., Krishnamoorthy, M. and Dowling, D., 1996. Train Driver Rostering using Simulated Annealing. Technical Report. Division of Mathematics and Statistics, CSIRO, Australia. pp. 1-14.
  15. Glover, F. and McMilla, C., 1986. The General Employee Scheduling Problem: An Integration of MSand AI. Computers and Operations Research, 13(5), 563-573.
  16. Hensher, D. A., 1994. Stated Preference Analysis of Travel Choices: the State of Practice. Transportation, 21(2), pp. 107-133.
  17. Jachnik, J. K., 1981. Attendance and Rostering System. In A. Wren, editor, Computer Scheduling of Public Transport, pp. 337-343. North-Holland Publishing Co.
  18. Khoong, C. M., Lay, H. C. and Chew, L. W., 1994. Automated Manpower Rostering: Techniques and Experience. International Transaction in Operational Research, Vol. 1, pp 353-361.
  19. Krantz, D.H., Tversky, A.,1971. Conjoint measurement analysis of composition rules in psychology. Psychological Review 78(2), pp. 151-169.
  20. Kroes, E. P. and Sheldon, R., 1988. Stated Preference Methods: An Introduction Journal of Transport Economics and Policy, 22(1), pp. 11-25.
  21. Lau, H. C., 1996. Preference-Based Scheduling Via Constraint Satisfaction. Technical Report. Information Technology Institute. Singapore.
  22. Lerman, S. R., and Louviere, J. J., 1978. On the Use of Functional Measurement to Identify the Functional Form of the Utility Expression in Travel Demand Models. Transportation Research Record, 673, pp. 78- 86.
  23. Lin, S., 1965. Computer Solutions of the Traveling Salesman Problem. Bell System Technical Jornal, 44, pp. 2245-2269.
  24. Louviere, J. J., 1988. Conjoint Analysis Modelling of Stated Preferences: a Review of Theory, Methods, Recent Developments and External Validity. Journal of Transport Economics and Policy, 22(1), pp. 93-119.
  25. Mansfield, E., 1985. Microeconomics Theory/ Applications, 5th edn. New York: W.W. Norton.
  26. Mc Lean, R. and Anderson, V. L., 1984. Applied Factorial and Fractional Designs. Marcel Dekker Inc, New York.
  27. Mühlenthaler, M. and Wanka, R., 2014. Fairness in Academic Course Timetabling. Annals of Operations Research, February 14, 2014. doi:10.1007/s10479- 014-1553-2.
  28. Sorevik, T., 1993. Average Case Complexity Analysis of Algorithms for the Linear Assignment Problem. In Proceedings of NOAS 7893, Trondheim.
  29. Tien, J. and Kamiyama, A., 1982. On Manpower Scheduling Algorithms. SIAM Review, 24(3), pp. 275- 287.
  30. Vera Valdes, V. A., 2010. Integrating Crew Scheduling and Rostering Problems. Phd Thesis.University of Bologna.
  31. Xie, L. and Suhl L., 2015. Cyclic and non-cyclic crew rostering problems in public bus transit. OR Spectrum, 37, pp. 99-136.
Download


Paper Citation


in Harvard Style

Aparecido Constantino A., Ferreira Xavier de Mendonça C., Galvão Novaes A. and Flausino dos Santos A. (2015). Combining Heuristic and Utility Function for Fair Train Crew Rostering . In Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-758-096-3, pages 593-602. DOI: 10.5220/0005364505930602


in Bibtex Style

@conference{iceis15,
author={Ademir Aparecido Constantino and Candido Ferreira Xavier de Mendonça and Antonio Galvão Novaes and Allainclair Flausino dos Santos},
title={Combining Heuristic and Utility Function for Fair Train Crew Rostering},
booktitle={Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2015},
pages={593-602},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005364505930602},
isbn={978-989-758-096-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - Combining Heuristic and Utility Function for Fair Train Crew Rostering
SN - 978-989-758-096-3
AU - Aparecido Constantino A.
AU - Ferreira Xavier de Mendonça C.
AU - Galvão Novaes A.
AU - Flausino dos Santos A.
PY - 2015
SP - 593
EP - 602
DO - 10.5220/0005364505930602