{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:07:46Z","timestamp":1761293266641,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319184753"},{"type":"electronic","value":"9783319184760"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18476-0_27","type":"book-chapter","created":{"date-parts":[[2015,4,25]],"date-time":"2015-04-25T09:40:25Z","timestamp":1429954825000},"page":"267-276","source":"Crossref","is-referenced-by-count":4,"title":["A Timetabling Applied Case Solved with Ant Colony Optimization"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franklin","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Abuhamdah, A., Ayob, M., Kendall, G., Sabar, N.: Population based local search for university course timetabling problems. Applied Intelligence, 1\u201310 (2013)","DOI":"10.1007\/s10489-013-0444-6"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Babaei, H., Karimpour, J., Hadidi, A.: A survey of approaches for university course timetabling problem. Computers and Industrial Engineering (2014) (in press)","DOI":"10.1016\/j.cie.2014.11.010"},{"key":"27_CR3","unstructured":"Blum, C., Dorigo, M.: Hc-aco: the hyper-cube framework for ant colony optimization. In: Proc. MIC 2001-Metaheuristics Int. Conf., pp. 399\u2013403 (2001)"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"34","author":"C. Blum","year":"2004","unstructured":"Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. Trans. Sys. Man Cyber. Part B\u00a034(2), 1161\u20131172 (2004)","journal-title":"Trans. Sys. Man Cyber. Part B"},{"key":"27_CR5","unstructured":"Blum, C., Roli, A., Dorigo, M.: Hc-aco: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics\u2013Part B, 399\u2013403 (2001)"},{"key":"27_CR6","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-22098-2_112","volume-title":"HCI International 2011 \u2013 Posters\u2019 Extended Abstracts","author":"B. Crawford","year":"2011","unstructured":"Crawford, B., Soto, R., Castro, C., Monfroy, E.: Extensible CP-based autonomous search. In: Stephanidis, C. (ed.) Posters, Part I, HCII 2011. CCIS, vol.\u00a0173, pp. 561\u2013565. Springer, Heidelberg (2011)"},{"key":"27_CR7","first-page":"11","volume-title":"New Ideas in Optimization","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G.: The ant colony optimization meta-heuristic. In: New Ideas in Optimization, pp. 11\u201332. McGraw-Hill Ltd., UK (1999)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation (1997)","DOI":"10.1109\/4235.585892"},{"key":"27_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, USA (2004)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-44629-X_2","volume-title":"Practice and Theory of Automated Timetabling III","author":"H.M.M. ten Eikelder","year":"2001","unstructured":"ten Eikelder, H.M.M., Willemen, R.J.: Some complexity aspects of secondary school timetabling problems. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 18\u201327. Springer, Heidelberg (2001)"},{"key":"27_CR11","series-title":"IFIP","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-0-387-34747-9_25","volume-title":"Artificial Intelligence in Theory and Practice","author":"F. Johnson","year":"2006","unstructured":"Johnson, F., Crawford, B., Palma, W.: Hypercube framework for ACO applied to timetabling. In: Bramer, M. (ed.) Artificial Intelligence in Theory and Practice. IFIP, vol.\u00a0217, pp. 237\u2013246. Springer, Boston (2006)"},{"key":"27_CR12","unstructured":"Paechter, B.: Course timetabling evonet summer school (2001), \n                    http:\/\/evonet.dcs.napier.ac.uk\/summerschool2001\/problems.html"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/BFb0056928","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"B. Paechter","year":"1998","unstructured":"Paechter, B., Rankin, R.C., Cumming, A., Fogarty, T.C.: Timetabling the classes of an entire university with an evolutionary algorithm. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 865\u2013874. Springer, Heidelberg (1998)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45724-0_1","volume-title":"Ant Algorithms","author":"K. Socha","year":"2002","unstructured":"Socha, K., Knowles, J., Sampels, M.: A $\\cal{MAX-MIN}$ ant system for the university course timetabling problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) ANTS 2002. LNCS, vol.\u00a02463, pp. 1\u201313. Springer, Heidelberg (2002)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-642-31137-6_46","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2012","author":"R. Soto","year":"2012","unstructured":"Soto, R., Crawford, B., Monfroy, E., Bustos, V.: Using autonomous search for generating good enumeration strategy blends in constraint programming. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part III. LNCS, vol.\u00a07335, pp. 607\u2013617. Springer, Heidelberg (2012)"},{"issue":"9","key":"27_CR16","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: Max-min ant system. Future Gener. Comput. Syst.\u00a016(9), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."}],"container-title":["Advances in Intelligent Systems and Computing","Artificial Intelligence Perspectives and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18476-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T07:49:38Z","timestamp":1676447378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18476-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319184753","9783319184760"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18476-0_27","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}