{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:50:51Z","timestamp":1784303451499,"version":"3.55.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031436116","type":"print"},{"value":"9783031436123","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43612-3_23","type":"book-chapter","created":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T03:30:04Z","timestamp":1693971004000},"page":"365-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An Effective Matheuristic Approach for\u00a0Robust Bus Driver Rostering with\u00a0Uncertain Daily Working Hours"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0383-0379","authenticated-orcid":false,"given":"Abtin","family":"Nourmohammadzadeh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"23_CR1","unstructured":"Current traffic situation. https:\/\/www.der-metronom.de\/fahrplan\/aktuelle-verkehrslage\/. Accessed 20 June 2023"},{"key":"23_CR2","unstructured":"New survey reveals shocking shortage of bus drivers. https:\/\/www.unitetheunion.org\/news-events\/news\/2021\/november\/new-survey-reveals-shocking-shortage-of-bus-drivers\/. Accessed 20 June 2023"},{"key":"23_CR3","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-20430-7_29","volume-title":"Computational Management Science","author":"V Barbosa","year":"2016","unstructured":"Barbosa, V., Alvelos, F., Resp\u00edcio, A.: Bus driver rostering by column generation metaheuristics. In: Fonseca, R.J., Weber, G.-W., Telhada, J. (eds.) Computational Management Science. LNEMS, vol. 682, pp. 225\u2013231. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-20430-7_29"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/s0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1\u201313 (1999). https:\/\/doi.org\/10.1016\/s0167-6377(99)00016-4","journal-title":"Oper. Res. Lett."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-52307-6_8","volume-title":"Multiple Hypothesenpr\u00fcfung \/ Multiple Hypotheses Testing","author":"B Bergmann","year":"1988","unstructured":"Bergmann, B., Hommel, G.: Improvements of general multiple test procedures for redundant systems of hypotheses. In: Bauer, P., Hommel, G., Sonnemann, E. (eds.) Multiple Hypothesenpr\u00fcfung \/ Multiple Hypotheses Testing, vol. 70, pp. 100\u2013115. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/978-3-642-52307-6_8"},{"issue":"4","key":"23_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1162\/evco.1996.4.4.361","volume":"4","author":"T Blickle","year":"1996","unstructured":"Blickle, T., Thiele, L.: A comparison of selection schemes used in evolutionary algorithms. Evol. Comput. 4(4), 361\u2013394 (1996). https:\/\/doi.org\/10.1162\/evco.1996.4.4.361","journal-title":"Evol. Comput."},{"key":"23_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/0470072768","volume-title":"Response Surfaces, Mixtures, and Ridge Analyses","author":"GEP Box","year":"2007","unstructured":"Box, G.E.P., Draper, N.R.: Response Surfaces, Mixtures, and Ridge Analyses, 2nd edn. Wiley, Hoboken (2007)","edition":"2"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3\u201318 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s12469-021-00268-y","volume":"13","author":"S Er-Rbib","year":"2021","unstructured":"Er-Rbib, S., Desaulniers, G., Elhallaoui, I., Munroe, P.: Preference-based and cyclic bus driver rostering problem with fixed days off. Public Transp. 13(2), 251\u2013286 (2021). https:\/\/doi.org\/10.1007\/s12469-021-00268-y","journal-title":"Public Transp."},{"key":"23_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s12469-022-00292-6","author":"L Ge","year":"2022","unstructured":"Ge, L., Kliewer, N., Nourmohammadzadeh, A., Vo\u00df, S., Xie, L.: Revisiting the richness of integrated vehicle and crew scheduling. Public Transp. (2022). https:\/\/doi.org\/10.1007\/s12469-022-00292-6","journal-title":"Public Transp."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Ge, L., Nourmohammadzadeh, A., Vo\u00df, S., Xie, L.: Robust optimization for integrated vehicle and crew scheduling based on uncertainty in the main inputs. In: The Fifth Data Science Meets Optimisation Workshop at IJCAI-22. Vienna (2022). https:\/\/sites.google.com\/view\/ijcai2022dso\/. Accessed 30 Apr 2023","DOI":"10.1007\/s12469-022-00292-6"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995 - International Conference on Neural Networks, vol. 4, pp. 1942\u20131948 (1995). https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Kawase, Y., Sumita, H., Fukunaga, T.: Submodular maximization with uncertain knapsack capacity. arxiv (2018). https:\/\/arxiv.org\/pdf\/1803.02565","DOI":"10.1007\/978-3-319-77404-6_48"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"2070","DOI":"10.4028\/www.scientific.net\/AMM.361-363.2070","volume":"361\u2013363","author":"JH Ma","year":"2013","unstructured":"Ma, J.H., Liu, T., Guan, W.: Solving balanced bus crew rostering problem with genetic algorithm. Appl. Mech. Mater. 361\u2013363, 2070\u20132074 (2013). https:\/\/doi.org\/10.4028\/www.scientific.net\/AMM.361-363.2070","journal-title":"Appl. Mech. Mater."},{"key":"23_CR15","series-title":"EURO Advanced Tutorials on Operational Research","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-030-70277-9_2","volume-title":"Matheuristics","author":"V Maniezzo","year":"2021","unstructured":"Maniezzo, V., Boschetti, M.A., St\u00fctzle, T.: Automatic design for matheuristics. In: Matheuristics. EURO Advanced Tutorials on Operational Research, pp. 35\u201357. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-70277-9_2"},{"key":"23_CR16","doi-asserted-by":"publisher","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.): Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1306-7","DOI":"10.1007\/978-1-4419-1306-7"},{"issue":"2","key":"23_CR17","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2015.03.030","volume":"245","author":"M Mesquita","year":"2015","unstructured":"Mesquita, M., Moz, M., Paias, A., Pato, M.: A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern. Eur. J. Oper. Res. 245(2), 423\u2013437 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2015.03.030","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"23_CR18","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10898-010-9645-2","volume":"49","author":"M Minoux","year":"2011","unstructured":"Minoux, M.: On 2-stage robust LP with RHS uncertainty: complexity results and applications. J. Global Optim. 49(3), 521\u2013537 (2011). https:\/\/doi.org\/10.1007\/s10898-010-9645-2","journal-title":"J. Global Optim."},{"issue":"7","key":"23_CR19","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1007\/s11590-011-0341-z","volume":"6","author":"M Minoux","year":"2012","unstructured":"Minoux, M.: Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard. Optim. Lett. 6(7), 1463\u20131475 (2012). https:\/\/doi.org\/10.1007\/s11590-011-0341-z","journal-title":"Optim. Lett."},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s12469-009-0013-x","volume":"1","author":"M Moz","year":"2009","unstructured":"Moz, M., Resp\u00edcio, A., Pato, M.V.: Bi-objective evolutionary heuristics for bus driver rostering. Public Transp. 1(3), 189\u2013210 (2009). https:\/\/doi.org\/10.1007\/s12469-009-0013-x","journal-title":"Public Transp."},{"key":"23_CR21","doi-asserted-by":"publisher","unstructured":"Nurmi, K., Kyng\u00e4s, J., Post, G.: Driver rostering for a Finnish bus transportation company. In: IAENG Transactions on Engineering Technologies, vol. 7, pp. 15\u201335. World Scientific, Singapore and Hackensack NJ (2012). https:\/\/doi.org\/10.1142\/9789814390019_0002","DOI":"10.1142\/9789814390019_0002"},{"issue":"4","key":"23_CR22","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.orl.2010.04.005","volume":"38","author":"OY \u00d6zalt\u0131n","year":"2010","unstructured":"\u00d6zalt\u0131n, O.Y., Prokopyev, O.A., Schaefer, A.J.: The bilevel knapsack problem with stochastic right-hand sides. Oper. Res. Lett. 38(4), 328\u2013333 (2010). https:\/\/doi.org\/10.1016\/j.orl.2010.04.005","journal-title":"Oper. Res. Lett."},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and Surveys in Metaheuristics","author":"\u00c9D Taillard","year":"2002","unstructured":"Taillard, \u00c9.D., Vo\u00df, S.: POPMUSIC \u2013 partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, vol. 15, pp. 613\u2013629. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_27"},{"key":"23_CR24","doi-asserted-by":"publisher","unstructured":"Xie, L., Suhl, L.: A duty-block network approach for an integrated driver rostering problem in public bus transport. In: Longhurst, J., Brebbia, C.A. (eds.) Urban Transport XVIII, pp. 295\u2013306. WIT Transactions on The Built Environment, WIT Press Southampton, UK (2012). https:\/\/doi.org\/10.2495\/UT120261","DOI":"10.2495\/UT120261"},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1016\/j.sbspro.2012.09.783","volume":"54","author":"L Xie","year":"2012","unstructured":"Xie, L., Kliewer, N., Suhl, L.: Integrated driver rostering problem in public bus transit. Procedia. Soc. Behav. Sci. 54, 656\u2013665 (2012)","journal-title":"Procedia. Soc. Behav. Sci."},{"issue":"5","key":"23_CR26","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10732-017-9348-7","volume":"23","author":"L Xie","year":"2017","unstructured":"Xie, L., Merschformann, M., Kliewer, N., Suhl, L.: Metaheuristics approach for solving personalized crew rostering problem in public bus transit. J. Heuristics 23(5), 321\u2013347 (2017). https:\/\/doi.org\/10.1007\/s10732-017-9348-7","journal-title":"J. Heuristics"},{"issue":"1","key":"23_CR27","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00291-014-0364-9","volume":"37","author":"L Xie","year":"2015","unstructured":"Xie, L., Suhl, L.: Cyclic and non-cyclic crew rostering problems in public bus transit. OR Spectrum 37(1), 99\u2013136 (2015). https:\/\/doi.org\/10.1007\/s00291-014-0364-9","journal-title":"OR Spectrum"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43612-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T03:32:43Z","timestamp":1693971163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43612-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436116","9783031436123"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43612-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berlin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccl2023.uni-hamburg.de\/en.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,42","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}