{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:02:19Z","timestamp":1773702139472,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Public Transp"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s12469-009-0013-x","type":"journal-article","created":{"date-parts":[[2009,7,31]],"date-time":"2009-07-31T10:24:43Z","timestamp":1249035883000},"page":"189-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Bi-objective evolutionary heuristics for bus driver rostering"],"prefix":"10.1007","volume":"1","author":[{"given":"Margarida","family":"Moz","sequence":"first","affiliation":[]},{"given":"Ana","family":"Resp\u00edcio","sequence":"additional","affiliation":[]},{"given":"Margarida Vaz","family":"Pato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","volume":"31","author":"U Aickelin","year":"2004","unstructured":"Aickelin U, Dowsland KA (2004) An indirect genetic algorithm for a nurse scheduling problem. Comput Oper Res 31:761\u2013778","journal-title":"Comput Oper Res"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/0377-2217(92)90213-S","volume":"58","author":"L Bianco","year":"1992","unstructured":"Bianco L, Bielli M, Mingozzi MA, Ricciardelli S, Spadoni M (1992) A heuristic procedure for the crew rostering problem. Eur J Oper Res 58:272\u2013283","journal-title":"Eur J Oper Res"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1287\/opre.1040.0110","volume":"52","author":"P Cappanera","year":"2004","unstructured":"Cappanera P, Gallo G (2004) A multicommodity flow approach to the crew rostering problem. Oper Res 52:583\u2013596","journal-title":"Oper Res"},{"key":"13_CR4","first-page":"125","volume":"79","author":"A Caprara","year":"1997","unstructured":"Caprara A, Fischetti M, Toth P, Vigo D, Guida PL (1997) Algorithms for railway crew management. Math Program 79:125\u2013141","journal-title":"Math Program"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1287\/opre.46.6.820","volume":"46","author":"A Caprara","year":"1998","unstructured":"Caprara A, Fischetti M, Toth P, Vigo D (1998) Modeling and solving the crew rostering problem. Oper Res 46:820\u2013830","journal-title":"Oper Res"},{"key":"13_CR6","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-85970-0_1","volume-title":"Computer aided transit scheduling","author":"A Caprara","year":"1999","unstructured":"Caprara A, Fischetti M, Guida PL, Toth P, Vigo D (1999) Solution to large scale railway crew planning problems: the Italian experience. In: Wilson NHM (ed) Computer aided transit scheduling. Lecture notes in economics and mathematical systems, vol 471. Springer, Berlin, pp 1\u201318"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0377-2217(84)90071-7","volume":"16","author":"P Carraresi","year":"1984","unstructured":"Carraresi P, Gallo G (1984) A multilevel bottleneck assignment approach to the bus driver\u2019s rostering problem. Eur J Oper Res 16:163\u2013173","journal-title":"Eur J Oper Res"},{"key":"13_CR8","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-57762-8_17","volume-title":"Computer aided transit scheduling","author":"F Catanas","year":"1995","unstructured":"Catanas F, Paix\u00e3o J (1995) A new approach for the crew rostering problem. In: Daduna J, Branco I, Paix\u00e3o J (eds) Computer aided transit scheduling. Lecture notes in economics and mathematical systems, vol 430. Springer, Berlin, pp 267\u2013277"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1016\/j.ejor.2005.10.008","volume":"177","author":"SCK Chu","year":"2007","unstructured":"Chu SCK (2007) Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport. Eur J Oper Res 177:1764\u20131778","journal-title":"Eur J Oper Res"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.cor.2003.08.017","volume":"32","author":"Y Collette","year":"2005","unstructured":"Collette Y, Siarry P (2005) Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization. Comput Oper Res 32:773\u2013792","journal-title":"Comput Oper Res"},{"key":"13_CR11","volume-title":"Using the CPLEX callable library and CPLEX mixed integer library","author":"CPLEX Manual (version 11)","year":"2007","unstructured":"CPLEX Manual (version 11) (2007) Using the CPLEX callable library and CPLEX mixed integer library. ILOG INC., Incline Village"},{"key":"13_CR12","first-page":"339","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig GB (1954) A comment on Edie\u2019s \u2018Traffic delays at toll booths\u2019. J Oper Res Soc Am 2:339\u2013341","journal-title":"J Oper Res Soc Am"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Dornberger R, Frey L, Hanne T (2008) Single and multiobjective optimization of the train staff planning problem using genetic algorithms. In: Evolutionary computation, 2008. Proceedings of CEC 2008. (IEEE world congress on computational intelligence), pp 970\u2013977","DOI":"10.1109\/CEC.2008.4630914"},{"key":"13_CR14","unstructured":"Emden-Weinert T, Kotas H-G, Speer U (2001) DISSY\u2014a driver rostering system for public transport. Version 1.11, DISSY project of programme ESPRIT"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"A Ernst","year":"2004","unstructured":"Ernst A, Jiang H, Krishnamoorthy M, Sier D (2004) Staff scheduling and rostering: a review of applications, methods and models. Eur J Oper Res 153:3\u201327","journal-title":"Eur J Oper Res"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/B:ANOR.0000019090.39650.32","volume":"127","author":"R Freling","year":"2004","unstructured":"Freling R, Lentink RM, Wagelmans APM (2004) A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm. Ann Oper Res 127:203\u2013222","journal-title":"Ann Oper Res"},{"key":"13_CR17","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"D Goldberg","year":"1989","unstructured":"Goldberg D (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Hartog A, Huisman D, Abbink EJW, Kroon LG (2009) Decision support for crew rostering at NS. Public Transp 1. doi:10.1007\/s12469-009-0009-6","DOI":"10.1007\/s12469-009-0009-6"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:ANOR.0000019091.54417.ca","volume":"127","author":"N Kohl","year":"2004","unstructured":"Kohl N, Karisch SE (2004) Airline crew rostering: problem types, modelling, and optimization. Ann Oper Res 127:223\u2013257","journal-title":"Ann Oper Res"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1057\/palgrave.jors.2602088","volume":"57","author":"M Lezaun","year":"2006","unstructured":"Lezaun M, Perez G, Maza ES (2006) Crew rostering problem in a public transport company. J Oper Res Soc 57:1173\u20131179","journal-title":"J Oper Res Soc"},{"key":"13_CR21","first-page":"19","volume":"33","author":"P Lucic","year":"1999","unstructured":"Lucic P, Teodorovic D (1999) Simulated annealing for the multi-objective aircrew rostering problem. Transp Res A 33:19\u201345","journal-title":"Transp Res A"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10479-007-0216-y","volume":"155","author":"P Lucic","year":"2007","unstructured":"Lucic P, Teodorovic D (2007) Metaheuristics approach to the aircrew rostering problem. Ann Oper Res 155:311\u2013338","journal-title":"Ann Oper Res"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1016\/j.cor.2006.09.001","volume":"35","author":"M Mesquita","year":"2008","unstructured":"Mesquita M, Paias A (2008) Set partitioning\/covering-based approaches for the integrated vehicle and crew scheduling problem. Comput Oper Res 35:1562\u20131575","journal-title":"Comput Oper Res"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Mesquita M, Moz M, Paias A, Paix\u00e3o J, Pato MV, Resp\u00edcio A (2008) Solving public transit scheduling problems. Working paper 1-2008. Centro de Investiga\u00e7\u00e3o Operacional, Universidade de Lisboa, 31 pp (submitted)","DOI":"10.1007\/s12469-008-0005-2"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s12469-008-0005-2","volume":"1","author":"M Mesquita","year":"2009","unstructured":"Mesquita M, Paias A, Resp\u00edcio A (2009) Branching approaches for integrated vehicle and crew scheduling. Public Transp 1:21\u201337","journal-title":"Public Transp"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.cor.2005.03.019","volume":"34","author":"M Moz","year":"2007","unstructured":"Moz M, Pato MV (2007) A genetic algorithm approach to a nurse rerostering problem. Comput Oper Res 34:667\u2013691","journal-title":"Comput Oper Res"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0927-0507(05)80086-6","volume-title":"Operations research in the public sector. Handbooks in operations research and management science","author":"A Odoni","year":"1994","unstructured":"Odoni A, Rousseau J-M, Wilson N (1994) Models in urban and air transportation. In: Pollock S, Rothkopf M, Barnett A (eds) Operations research in the public sector. Handbooks in operations research and management science, vol 6. North-Holland, Amsterdam, pp 107\u2013150"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10732-007-9040-4","volume":"14","author":"MV Pato","year":"2008","unstructured":"Pato MV, Moz M (2008) Solving a bi-objective nurse rerostering problem by using a utopic genetic heuristic. J Heuristics 14:359\u2013374","journal-title":"J Heuristics"},{"key":"13_CR29","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-56423-9_13","volume-title":"Computer aided transit scheduling","author":"D Pedrosa","year":"2001","unstructured":"Pedrosa D, Constantino M (2001) Days-off scheduling in public transport companies. In: Voss S, Daduna J (eds) Computer aided transit scheduling. Lecture notes in economics and mathematical systems, vol 505. Springer, Berlin, pp 215\u2013232"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Portugal R, Louren\u00e7o HR, Paix\u00e3o JP (2009) Driver scheduling problem modelling. Public Transp 1. doi:10.1007\/s12469-008-0007-0","DOI":"10.1007\/s12469-008-0007-0"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-79438-7_7","volume-title":"Adaptative and multilevel metaheuristics","author":"JDL Silva","year":"2008","unstructured":"Silva JDL, Le KN (2008) A simple evolutionary algorithm with self-adaptation for multi-objective nurse scheduling. In: Cotta C, Sevaux M, S\u00f6rensen K (eds) Adaptative and multilevel metaheuristics, vol 136. Springer, Berlin, pp 133\u2013155"},{"key":"13_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-17144-4_4","volume-title":"Metaheuristics for multiobjective optimisation","author":"JDL Silva","year":"2004","unstructured":"Silva JDL, Burke EK, Petrovic S (2004) An introduction to multiobjective metaheuristics for scheduling and timetabling. In: Gandibleux X, Sevaux M, S\u00f6rensen K, T\u2019kindt V (eds) Metaheuristics for multiobjective optimisation. Springer, Berlin, pp 91\u2013129"},{"key":"13_CR33","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/B:ANOR.0000019092.76669.a1","volume":"127","author":"MS Sodhi","year":"2004","unstructured":"Sodhi MS, Norris S (2004) A flexible, fast, and optimal modelling approach applied to crew rostering at London underground. Ann Oper Res 127:259\u2013281","journal-title":"Ann Oper Res"},{"key":"13_CR34","first-page":"95","volume-title":"Evolutionary methods for design, optimisation and control","author":"E Zitzler","year":"2002","unstructured":"Zitzler E, Laumanns M, Thiele L (2002) SPEA2: improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Giannakoglou K, Tsahalis D, Periaux J, Papailiou K, Fogarty T (eds) Evolutionary methods for design, optimisation and control. CIMNE, Barcelona, pp 95\u2013100"}],"container-title":["Public Transport"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-009-0013-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12469-009-0013-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-009-0013-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-009-0013-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T09:51:44Z","timestamp":1619344304000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12469-009-0013-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1007\/s12469-009-0013-x","relation":{},"ISSN":["1866-749X","1613-7159"],"issn-type":[{"value":"1866-749X","type":"print"},{"value":"1613-7159","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8]]},"assertion":[{"value":"1 August 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}