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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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
Shen, Y., Peng, K., Chen, K., Li, J.: Evolutionary crew scheduling with adaptive chromosomes. Transp. Res. Part B 56, 174–185 (2013)
Moz, M., RespĂcio, A., Pato, M.V.: Bi-objective evolutionary heuristics for bus driver rostering. Public Transp. 1(3), 189–210 (2009)
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)
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)
Xie, L., Suhl, L.: Cyclic and non-cyclic crew rostering problems in public bus transit. OR Spectrum 37(1), 99–136 (2015)
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)
Emden-Weinert, T., Kotas, H., Speer, U.: DISSY - a driver rostering system for public transport. DISSY project of programme ESPRIT, pp. 1–30 (2001)
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)
Xie, L., Kliewer, N., Suhl, L.: Integrated driver rostering problem in public bus transit. Procedia-Soc. Behav. Sci. 54, 656–665 (2012)
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)
Nurmi, K., Kyngäs, J., Post, G.: Driver rostering for bus transit companies. Eng. Lett. 19(2), 125–132 (2011)
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)
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)
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)
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)
Yu, V.F., Lin, S.: A simulated annealing heuristic for the open location-routing problem. Comput. Oper. Res. 62, 184–196 (2015)
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)
Luc̆ić, P., Teodorović, D.: Metaheuristics approach to the aircrew rostering problem. Ann. Oper. Res. 155(1), 311–338 (2007)
Hoos, H.H., StĂĽtzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)
Liang, Y., Lo, M.: Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm. J. Heuristics 16(3), 511–535 (2010)
Suman, B., Hoda, N., Jha, S.: Orthogonal simulated annealing for multiobjective optimization. Comput. Chem. Eng. 34(10), 1618–1631 (2010)
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
Corresponding author
Editor information
Editors and Affiliations
Rights 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)