Skip to main content

A Multi-objective Simulated Annealing for Bus Driver Rostering

  • Conference paper
  • First Online:
Bio-Inspired Computing -- Theories and Applications (BIC-TA 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 562))

Included in the following conference series:

Abstract

This paper presents a Multi-Objective Simulated Annealing (MOSA) approach for noncyclic bus driver rostering. A heuristic is first devised to construct an initial solution. Next, a SA-based feasibility repairing algorithm is designed to make the solution feasible. Finally, a SA-based non-dominated solution generating algorithm is devised to find the Pareto front based on the feasible solution. Differing from previous work on the problem, the MOSA provides two options to handle user preferences: one with a weighted-sum evaluation function encouraging moves towards users’ predefined preferences, and another with a domination-based evaluation function encouraging moves towards a more diversified Pareto set. Moreover, the MOSA employs three strategies, i.e. incremental evaluation, neighbourhood pruning and biased elite solution restart strategy, to make the search more efficient and effective. Experiments show that the MOSA can produce a large number of solutions that reconcile contradictory objectives rapidly, and the strategies can enhance the computational efficiency and search capability.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Shen, Y., Xia, J.: Integrated bus transit scheduling for the Beijing bus group based on a unified mode of operation. Int. Trans. Oper. Res. 16(2), 227–242 (2009)

    Article  MATH  Google Scholar 

  2. Shen, Y., Xu, J., Zeng, Z.: Public transit planning and scheduling based on AVL data in China. Int. Trans. Oper. Res., 1–23 (2015). doi:10.1111/itor.12164

  3. Shen, Y., Peng, K., Chen, K., Li, J.: Evolutionary crew scheduling with adaptive chromosomes. Transp. Res. Part B 56, 174–185 (2013)

    Article  Google Scholar 

  4. Moz, M., Respício, A., Pato, M.V.: Bi-objective evolutionary heuristics for bus driver rostering. Public Transp. 1(3), 189–210 (2009)

    Article  MATH  Google Scholar 

  5. Mesquita, M., Moz, M., Paias, A., Paixão, J., Pato, M., Respício, A.: A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters. J. Sched. 14(4), 319–334 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Respício, A., Moz, M., Margarida, V.P.: Enhanced genetic algorithms for a bi-objective bus driver rostering problem: a computational study. Int. Trans. Oper. Res. 20(4), 443–470 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Xie, L., Suhl, L.: Cyclic and non-cyclic crew rostering problems in public bus transit. OR Spectrum 37(1), 99–136 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. Odoni, A., Rousseau, J., Wilson, N.: Models in urban and air transportation. In: Pollock, S., Rothkopf, M., Barnett, A. (eds.) Handbooks in Operations Research and Management Science, pp. 107–150. North-Holland, Amsterdam (1994)

    Google Scholar 

  9. Emden-Weinert, T., Kotas, H., Speer, U.: DISSY - a driver rostering system for public transport. DISSY project of programme ESPRIT, pp. 1–30 (2001)

    Google Scholar 

  10. Pedrosa, D., Constantino, M.: Days-off scheduling in public transport companies. In: Voss, S., Daduna, J. (eds.) Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, vol. 505, pp. 215–232. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Xie, L., Kliewer, N., Suhl, L.: Integrated driver rostering problem in public bus transit. Procedia-Soc. Behav. Sci. 54, 656–665 (2012)

    Article  Google Scholar 

  12. Respício, A., Moz, M., Margarida, P.V.: A memetic algorithm for a bi-objective bus driver rostering problem. Centro de Investigação Operacional, Universidade de Lisboa, Working paper 13, pp. 1–25 (2007)

    Google Scholar 

  13. Nurmi, K., Kyngäs, J., Post, G.: Driver rostering for bus transit companies. Eng. Lett. 19(2), 125–132 (2011)

    Google Scholar 

  14. Xie, L.: Metaheuristics approach for solving multi-objective crew rostering problem in public transit. Decision Support & Operations Research Lab, University of Paderborn, Working paper, WP1306, pp. 1–23 (2013)

    Google Scholar 

  15. Mesquita, M., Moz, M., Paias, A., Pato, M.: A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern. Eur. J. Oper. Res. 229(2), 318–331 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Catanas, F., Paixão, J.M.P.: A new approach for the crew rostering problem. In: Daduna, J.R., Branco, I., Paixão, J.M.P. (eds.) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol. 430, pp. 267–277. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  17. Torres-Jimenez, J., Izquierdo-Marquez, I., Garcia-Robledo, A., Gonzalez-Gomez, A., Bernal, J., Kacker, R.N.: A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs. Inf. Sci. 303, 33–49 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  18. Yu, V.F., Lin, S.: A simulated annealing heuristic for the open location-routing problem. Comput. Oper. Res. 62, 184–196 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  19. Burke, E.K., Li, J., Qu, R.: A Pareto-based search methodology for multi-objective nurse scheduling. Ann. Oper. Res. 196(1), 91–109 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  20. Luc̆ić, P., Teodorović, D.: Metaheuristics approach to the aircrew rostering problem. Ann. Oper. Res. 155(1), 311–338 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  21. Hoos, H.H., StĂĽtzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)

    MATH  Google Scholar 

  22. Liang, Y., Lo, M.: Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm. J. Heuristics 16(3), 511–535 (2010)

    Article  MATH  Google Scholar 

  23. Suman, B., Hoda, N., Jha, S.: Orthogonal simulated annealing for multiobjective optimization. Comput. Chem. Eng. 34(10), 1618–1631 (2010)

    Article  Google Scholar 

Download references

Acknowledgments

The work was supported by the National Natural Science Foundation of China (Grant No. 70971044 and 71171087) and the Major Program of National Social Science Foundation of China (Grant No. 13&ZD175).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yindong Shen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peng, K., Shen, Y., Li, J. (2015). A Multi-objective Simulated Annealing for Bus Driver Rostering. In: Gong, M., Linqiang, P., Tao, S., Tang, K., Zhang, X. (eds) Bio-Inspired Computing -- Theories and Applications. BIC-TA 2015. Communications in Computer and Information Science, vol 562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49014-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49014-3_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49013-6

  • Online ISBN: 978-3-662-49014-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics