{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:46:27Z","timestamp":1762443987281},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s10732-005-2220-1","type":"journal-article","created":{"date-parts":[[2005,9,4]],"date-time":"2005-09-04T12:24:56Z","timestamp":1125836696000},"page":"351-367","source":"Crossref","is-referenced-by-count":29,"title":["A Self-Adjusting Algorithm for Driver Scheduling"],"prefix":"10.1007","volume":"11","author":[{"given":"Jingpeng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2220_CR1","first-page":"25","volume":"79","author":"A. Caprara","year":"1997","unstructured":"Caprara, A., M. Fischetti, P. Toth, D. Vigo, and P.L. Guida. (1997). \u201cAlgorithms for Railway Crew Management.\u201d Mathematical Programming 79, 25\u2013141.","journal-title":"Mathematical Programming"},{"key":"2220_CR2","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1057\/palgrave.jors.2600728","volume":"50","author":"L. Cavique","year":"1999","unstructured":"Cavique, L., C. Rego, and I. Themido. (1999). \u201cSubgraph Ejection Chains and Tabu Search for the Crew Scheduling Problem.\u201d European Journal of Operational Research 50, 608\u2013616.","journal-title":"European Journal of Operational Research"},{"key":"2220_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V. (1979). \u201cA Greedy Heuristic for the Set-Covering Problem.\u201d Mathematics of Operations Research 4, 233\u2013235.","journal-title":"Mathematics of Operations Research"},{"key":"2220_CR4","doi-asserted-by":"crossref","unstructured":"Clement, R. and A. Wren. (1995). \u201cGreedy Genetic Algorithms, Optimising Mutations and Bus Driver Scheduling.\u201d In J.R. Daduna, et al. (eds.), Computer-Aided Transit Scheduling. Springer Verlag, pp. 213\u2013235.","DOI":"10.1007\/978-3-642-57762-8_14"},{"key":"2220_CR5","unstructured":"Curtis, S.D. (2000). \u201cConstraint Satisfaction Approaches to Bus Driver Scheduling.\u201d Doctoral Thesis, University of Leeds, England."},{"key":"2220_CR6","doi-asserted-by":"crossref","unstructured":"Fores, S., L. Proll, and A. Wren. (1999). \u201cAn Improved ILP System for Driver Scheduling.\u201d In N.H.M. Wilson, (ed.), Proceeding of the Seventh International Workshop on Computer-Aided Scheduling of Public Transport, Spring-Verlag, pp. 43\u201361.","DOI":"10.1007\/978-3-642-85970-0_3"},{"key":"2220_CR7","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1057\/palgrave.jors.2601271","volume":"53","author":"S. Fores","year":"2002","unstructured":"Fores, S., L. Proll, and A. Wren. (2002). \u201cTRACS II: A Hybrid IP\/Heuristic Driver Scheduling System for Public Transport.\u201d Journal of the Operational Research Society 53, 1093\u20131100.","journal-title":"Journal of the Operational Research Society"},{"key":"2220_CR8","unstructured":"Forsyth, P. and A. Wren. (1997). \u201cAn Ant System for Driver Scheduling.\u201d Technical Report 97.25, School of Computing, University of Leeds."},{"key":"2220_CR9","doi-asserted-by":"crossref","unstructured":"Gonzalez Hernandez, L.F. and D.W. Corne. (1996). \u201cEvolutionary Divide and Conquer of the Set Covering Problem.\u201d In T.C. Fogarty (ed.), Evolutionary Computing, Springer, pp. 198\u2013208.","DOI":"10.1007\/BFb0032784"},{"key":"2220_CR10","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1109\/43.88926","volume":"10","author":"R.M. Kling","year":"1991","unstructured":"Kling, R.M. and P. Banerjee. (1991). \u201cEmpirical and Theoretical Studies of the Simulated Evolution Method Applied to Standard Cell Placement.\u201d IEEE Transaction on Computer-Aided Design 10, 1303\u20131315.","journal-title":"IEEE Transaction on Computer-Aided Design"},{"key":"2220_CR11","volume-title":"Fuzzy Sets and Fuzzy Logic: Theory and Applications","author":"G.J. Klir","year":"1995","unstructured":"Klir, G.J. and B. Yuan. (1995). Fuzzy Sets and Fuzzy Logic: Theory and Applications. New Jersey: Prentice Hall."},{"key":"2220_CR12","doi-asserted-by":"crossref","unstructured":"Kwan, A.S.K., R.S.K. Kwan, M.E. Parker, and A. Wren. (1999). \u201cProducing Train Driver Schedules under Different Operating Strategies.\u201d In N.H.M. Wilson (ed.), Computer-Aided Transit Scheduling, Springer-Verlag, pp. 129\u2013154.","DOI":"10.1007\/978-3-642-85970-0_7"},{"key":"2220_CR13","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1162\/10636560152642869","volume":"9","author":"R.S.K. Kwan","year":"2001","unstructured":"Kwan, R.S.K., A.S.K. Kwan, and A. Wren. (2001). \u201cEvolutionary Driver Scheduling with Relief Chains.\u201d Evolutionary Computation 9, 445\u2013460.","journal-title":"Evolutionary Computation"},{"key":"2220_CR14","doi-asserted-by":"crossref","unstructured":"Kwan, R.S.K. and A. Wren. (1996). \u201cHybrid Genetic Algorithms for Bus Driver Scheduling.\u201d In I. Bianco and P. Toth (eds.), Advanced Methods in Transportation Analysis, Springer-Verlag, pp. 609\u2013619.","DOI":"10.1007\/978-3-642-85256-5_27"},{"key":"2220_CR15","unstructured":"Layfield, C.J., B.M. Smith, and A. Wren. (1999). \u201cBus Relief Opportunity Selection Using Constraint Programming.\u201d Practical Application of Constraint Technologies and Logic Programming Conference. The Practical Application Company Ltd., pp. 537\u2013552."},{"key":"2220_CR16","unstructured":"Li, J. and R.S.K. Kwan. (2001). \u201cA Fuzzy Simulated Evolution Algorithm for the Driver Scheduling Problem.\u201d In Proceedings of the 2001 Congress on Evolutionary Computation. IEEE Press, pp. 1115\u20131122."},{"key":"2220_CR17","unstructured":"Li, J. (2002). \u201cFuzzy Evolutionary Approach for Bus and Rail Driver Scheduling.\u201d Doctoral Thesis, University of Leeds, England."},{"key":"2220_CR18","unstructured":"Li, J. and R.S.K. Kwan. (2002). \u201cA Fuzzy Evolutionary Approach with Taguchi Parameter Setting for the Set Covering Problem.\u201d In Proceedings of 2002 Congress on Evolutionary Computation. (CEC2002), IEEE Press, pp. 1203\u20131208."},{"issue":"(2)","key":"2220_CR19","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/S0377-2217(02)00564-7","volume":"147","author":"J. Li","year":"2003","unstructured":"Li, J. and R.S.K. Kwan. (2003). \u201cA Fuzzy Genetic Algorithm for Driver Scheduling.\u201d European Journal of Operational Research 147(2), 334\u2013344.","journal-title":"European Journal of Operational Research"},{"issue":"(3)","key":"2220_CR20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/B:JMMA.0000038619.69509.bf","volume":"3","author":"J. Li","year":"2004","unstructured":"Li, J. and R.S.K. Kwan. (2004). \u201cA Meta-Heuristic with Orthogonal Experiment for the Set Covering Problem.\u201d Journal of Mathematical Modelling and Algorithms 3(3), 263\u2013283.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"2220_CR21","doi-asserted-by":"crossref","unstructured":"Meilton, M. (2001). \u201cSelecting and Implementing a Computer Aided Scheduling System for a Large Bus Company.\u201d In S. Vo\u00df and J.R. Daduna (eds.), Computer-Aided Scheduling of Public, Transport, Springer Verlag, pp. 203\u2013214.","DOI":"10.1007\/978-3-642-56423-9_12"},{"key":"2220_CR22","unstructured":"Rayward-Smith, V.J., I. Osman, C.R. Reeves, and G.D. Smith, (eds.). (1996). Modern Heuristic Search Methods. Wiley."},{"key":"2220_CR23","doi-asserted-by":"crossref","unstructured":"Shen, Y. and R.S.K. Kwan. (2001). \u201cTabu Search for Driver Scheduling.\u201d In S. Vo\u00df and J.R. Daduna (eds.), Computer-Aided Scheduling of Public Transport, Springer-Verlag, pp. 121\u2013135.","DOI":"10.1007\/978-3-642-56423-9_7"},{"key":"2220_CR24","doi-asserted-by":"crossref","unstructured":"Vo\u00df, S. and J.R. Daduna, (eds.). (2001). \u201cComputer-Aided Scheduling of Public Transport.\u201d In Proceedings of the 8th International Workshop on Computer-Aided Scheduling of Public Transport, Springer-Verlag.","DOI":"10.1007\/978-3-642-56423-9"},{"key":"2220_CR25","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1023\/A:1024854522373","volume":"6","author":"A. Wren","year":"2003","unstructured":"Wren, A., S. Fores, A.S.K. Kwan, R.S.K. Kwan, M. Parker, and L. Proll. (2003). \u201cA Flexible System for Scheduling Drivers.\u201d Journal of Scheduling 6, 437\u2013455.","journal-title":"Journal of Scheduling"},{"key":"2220_CR26","doi-asserted-by":"crossref","unstructured":"Wren, A. and J.M. Rousseau. (1995). \u201cBus Driver Scheduling\u2014an Overview.\u201d In J.R. Daduna, I. Branco, and J.M.P. Paixao (eds.), Computer-Aided Scheduling of Public Transport, Springer-Verlag, pp. 173\u2013187.","DOI":"10.1007\/978-3-642-57762-8_12"},{"key":"2220_CR27","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(93)E0022-L","volume":"22","author":"A. Wren","year":"1995","unstructured":"Wren, A. and D.O. Wren. (1995). \u201cA Genetic Algorithm for Public Transport Driver Scheduling.\u201d Computers and Operations Research 22, 101\u2013110.","journal-title":"Computers and Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-2220-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-005-2220-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-2220-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:26Z","timestamp":1559256866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-005-2220-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["2220"],"URL":"https:\/\/doi.org\/10.1007\/s10732-005-2220-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}