{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:52:05Z","timestamp":1780635125318,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642252549","type":"print"},{"value":"9783642252556","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25255-6_48","type":"book-chapter","created":{"date-parts":[[2011,12,7]],"date-time":"2011-12-07T07:24:03Z","timestamp":1323242643000},"page":"375-382","source":"Crossref","is-referenced-by-count":11,"title":["Hybrid Swarm-Based Optimization Algorithm of GA &amp; VNS for Nurse Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Zebin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhifeng","family":"Hao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Han","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ejor.2009.07.036","volume":"203","author":"E.K. Burke","year":"2010","unstructured":"Burke, E.K., Li, J., Qu, R.: A hybrid model of integer programming and variable neighborhood search. European Journal of Operational Research\u00a0203, 439\u2013484 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"48_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<139::AID-JOS41>3.0.CO;2-2","volume":"3","author":"U. Aickelin","year":"2000","unstructured":"Aickelin, U., Dowsland, K.A.: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling\u00a03(3), 139\u2013153 (2000)","journal-title":"Journal of Scheduling"},{"key":"48_CR3","first-page":"1123","volume":"2","author":"H. Kawanaka","year":"2001","unstructured":"Kawanaka, H., Yamamoto, K., Yoshikawa, T., Shinogi, T., Tsuruoka, S.: Genetic Algorithm with the Constraints for Nurse Scheduling Problem. Evolutionary Computation\u00a02, 1123\u20131130 (2001)","journal-title":"Evolutionary Computation"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Ohki, M., Morimoto, A., Miyake, K.: Nurse Scheduling by Using Cooperative GA with Efficient Mutation and Mountain-Climbing Operators. Intelligent Systems, 164\u2013169 (2006)","DOI":"10.1109\/IS.2006.348411"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Burke, E.: Variable neighborhood search for nurse rostering problems. Metaheuristics: Computer Decision-Making, 153\u2013172 (2003)","DOI":"10.1007\/978-1-4757-4137-7_7"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10732-007-9066-7","volume":"15","author":"M.D. Goodman","year":"2009","unstructured":"Goodman, M.D., Dowsland, K.A., Thompson, J.M.: A grasp-knapsack hybrid for a nurse-scheduling problem. Journal of Heuristics\u00a015, 351\u2013379 (2009)","journal-title":"Journal of Heuristics"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.cor.2005.03.018","volume":"34","author":"W.J. Gutjahr","year":"2007","unstructured":"Gutjahr, W.J., Rauner, M.S.: An ACO algorithm for a dynamic regional nurse-scheduling problem in Austia. Computers & Operations Research\u00a034, 642\u2013666 (2007)","journal-title":"Computers & Operations Research"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10732-007-9013-7","volume":"13","author":"B. Maenhout","year":"2007","unstructured":"Maenhout, B., Vanhoucke, M.: An electromagnetic meta-heuristic for the nurse scheduling problem. Journal of Heuristics\u00a013, 359\u2013385 (2007)","journal-title":"Journal of Heuristics"},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10479-007-0268-z","volume":"159","author":"B. Maenhout","year":"2008","unstructured":"Maenhout, B., Vanhoucke, M.: Comparison and hybridization of crossover operators for the nurse scheduling problem. Annals of Operations Research\u00a0159, 333\u2013353 (2008)","journal-title":"Annals of Operations Research"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations, 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"48_CR11","first-page":"275","volume":"24","author":"J.M. Tien","year":"1982","unstructured":"Tien, J.M., Kamiyama, A.: On manpower scheduling algorithms. Society for Industrial and Applied Mathematics\u00a024, 275\u2013287 (1982)","journal-title":"Society for Industrial and Applied Mathematics"},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighbourhood search. Computers and Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"1999","unstructured":"Hansen, P., Mladenovic, N.: Variable neighbourhood search: Principles and applications. European Journal of Operational Research\u00a0130, 449\u2013467 (1999)","journal-title":"European Journal of Operational Research"},{"key":"48_CR14","unstructured":"Gonz\u00e1les, C.G., P\u00e9rez-Brito, D.: A variable neighbourhood search for solving the linear ordering problem. In: Proceedings of the Fourth Metaheuristics International Conference (MIC), pp. 181\u2013185 (2001)"}],"container-title":["Lecture Notes in Computer Science","Information Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25255-6_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:17:47Z","timestamp":1558297067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25255-6_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642252549","9783642252556"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25255-6_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}