{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:28:11Z","timestamp":1725863291685},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319449524"},{"type":"electronic","value":"9783319449531"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_40","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"636-649","source":"Crossref","is-referenced-by-count":2,"title":["Using Constraint Programming for the Urban Transit Crew Rescheduling Problem"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Lorca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Prud\u2019homme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lien","family":"Questel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beno\u00eet","family":"Rottembourg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"40_CR1","unstructured":"Beldiceanu, N., Carlsson, M., Flener, P., Lorca, X., Pearson, J., Petit, T., Prud\u2019Homme, C.: A modelling pearl with sortedness constraints. In: Gottlob, G., Sutcliffe, G., Voronkov, A., (eds.), GCAI 2015, Global Conference on Artificial Intelligence, vol. 36. EPiC Series in Computing, pp. 27\u201341. EasyChair (2015)"},{"issue":"1\u20134","key":"40_CR2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98(1\u20134), 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"40_CR3","first-page":"175","volume":"10","author":"S Chen","year":"2013","unstructured":"Chen, S., Shen, Y.: An improved column generation algorithm for crew scheduling problems. J. Inf. Comput. Sci. 10(1), 175\u2013183 (2013)","journal-title":"J. Inf. Comput. Sci."},{"volume-title":"Column Generation","year":"2006","key":"40_CR4","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.): Column Generation, vol. 5. Springer Science & Business Media, Heidelberg (2006)"},{"issue":"1","key":"40_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"M Desrochers","year":"1989","unstructured":"Desrochers, M., Soumis, F.: A column generation approach to the urban transit crew scheduling problem. Transp. Sci. 23(1), 1\u201313 (1989)","journal-title":"Transp. Sci."},{"issue":"3","key":"40_CR6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3), 216\u2013229 (2004)","journal-title":"Networks"},{"key":"40_CR7","unstructured":"Forsyth, P., Wren, A.: An ant system for bus driver scheduling (1997)"},{"issue":"3","key":"40_CR8","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/PL00013356","volume":"23","author":"B Franck","year":"2001","unstructured":"Franck, B., Neumann, K., Schwindt, C.: Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR-Spektrum 23(3), 297\u2013324 (2001)","journal-title":"OR-Spektrum"},{"key":"40_CR9","unstructured":"Gent, I.P., Jefferson, C., Miguel, I., Nightingale, P.: Data structures for generalised arc consistency for extensional constraints. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 22\u201326 July 2007, Vancouver, British Columbia, Canada, pp. 191\u2013197. AAAI Press (2007)"},{"key":"40_CR10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","volume":"6730","author":"S Irnich","year":"2005","unstructured":"Irnich, S., Desaulniers, G., et al.: Shortest path problems with resource constraints. Column Gener. 6730, 33\u201365 (2005)","journal-title":"Column Gener."},{"key":"40_CR11","unstructured":"Jacquet-Lagr\u00e8zel, \u00c9.: Horaires de chauffeurs de bus. Gestion de production et ressources humaines: m\u00e9thodes deplanification dans les syst\u00e8mes productifs, p. 287 (2005)"},{"issue":"3","key":"40_CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/trsc.35.3.331.10147","volume":"35","author":"HR Louren\u00e7o","year":"2001","unstructured":"Louren\u00e7o, H.R., Paix\u00e3o, J.P., Portugal, R.: Multiobjective metaheuristics for the bus driver scheduling problem. Transportation Sci. 35(3), 331\u2013343 (2001)","journal-title":"Transportation Sci."},{"key":"40_CR13","unstructured":"Perron, L.: Fast restart policies and large neighborhood search. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2003)"},{"key":"40_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/978-3-540-30201-8_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G Pesant","year":"2004","unstructured":"Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482\u2013495. Springer, Heidelberg (2004)"},{"key":"40_CR15","unstructured":"Prud\u2019homme, C., Fages, J.-G., Lorca, X.: Choco Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S (2015)"},{"key":"40_CR16","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31 - August 4, 1994, vol. 1, pp. 362\u2013367. AAAI Press\/The MIT Press (1994)"},{"key":"40_CR17","unstructured":"R\u00e9gin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, AAAI 1996, IAAI 1996, Portland, Oregon, 4-8 August 1996, vol. 1, pp. 209\u2013215. AAAI Press\/The MIT Press (1996)"},{"key":"40_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"Paul Shaw","year":"1998","unstructured":"Shaw, Paul: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, Michael J., Puget, Jean-Fran\u00e7ois (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"40_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-642-56423-9_7","volume-title":"Computer-Aided Scheduling of Public Transport","author":"Y Shen","year":"2001","unstructured":"Shen, Y., Kwan, R.S.K.: Tabu search for driver scheduling. In: Vo\u00df, S., Daduna, J.R. (eds.) Computer-Aided Scheduling of Public Transport, vol. 505, pp. 121\u2013135. Springer, Heidelberg (2001)"},{"issue":"4","key":"40_CR20","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1590\/2238-1031.jtl.v8n4a9","volume":"8","author":"GP Silva","year":"2014","unstructured":"Silva, G.P., Reis, A.F.S.: A study of different metaheuristics to solve the urban transit crew scheduling problem. J. Transport Lit. 8(4), 227\u2013251 (2014)","journal-title":"J. Transport Lit."},{"key":"40_CR21","series-title":"Lecture Notes in Computer Science","first-page":"293","volume-title":"Practical Aspects of Declarative Languages","author":"TH Yunes","year":"2000","unstructured":"Yunes, T.H., Moura, A.V., de Souza, C.C.: A hybrid approach for solving large scale crew scheduling problems. In: Pontelli, E., Santos Costa, V. (eds.) PADL 2000. LNCS, vol. 1753, pp. 293\u2013307. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:07:54Z","timestamp":1498324074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}