{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:56:21Z","timestamp":1742982981767,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319618234"},{"type":"electronic","value":"9783319618241"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-61824-1_37","type":"book-chapter","created":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T02:12:38Z","timestamp":1498183958000},"page":"337-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimization of Office-Space Allocation Problem Using Artificial Bee Colony Algorithm"],"prefix":"10.1007","author":[{"given":"Asaju La\u2019aro","family":"Bolaji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ikechi","family":"Michael","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bamidele","family":"Shola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,24]]},"reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-77345-0_1","volume-title":"Practice and Theory of Automated Timetabling VI","author":"B McCollum","year":"2007","unstructured":"McCollum, B.: A perspective on bridging the gap between theory and practice in university timetabling. In: Burke, E.K., Rudov\u00e1, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 3\u201323. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-77345-0_1"},{"issue":"9","key":"37_CR2","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1287\/mnsc.25.9.895","volume":"25","author":"L Ritzman","year":"1979","unstructured":"Ritzman, L., Bradford, J., Jacobs, R.: A multiple objective approach to space planning for academic facilities. Manag. Sci. 25(9), 895\u2013906 (1979)","journal-title":"Manag. Sci."},{"issue":"4","key":"37_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/inte.22.4.95","volume":"22","author":"CO Benjamin","year":"1992","unstructured":"Benjamin, C.O., Ehie, I.C., Omurtag, Y.: Planning facilities at the university of missouri-rolla. Interfaces 22(4), 95\u2013105 (1992)","journal-title":"Interfaces"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/j.endm.2010.05.073","volume":"36","author":"\u00d6 \u00dclker","year":"2010","unstructured":"\u00dclker, \u00d6., Landa-Silva, D.: A 0\/1 integer programming model for the office space allocation problem. Electron. Notes Discrete Math. 36, 575\u2013582 (2010)","journal-title":"Electron. Notes Discrete Math."},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-44629-X_16","volume-title":"Practice and Theory of Automated Timetabling III","author":"EK Burke","year":"2001","unstructured":"Burke, E.K., Cowling, P., Landa Silva, J.D., McCollum, B.: Three methods to automate the space allocation process in UK universities. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 254\u2013273. Springer, Heidelberg (2001). doi:10.1007\/3-540-44629-X_16"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-12139-5_13","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"R Lopes","year":"2010","unstructured":"Lopes, R., Girimonte, D.: The office-space-allocation problem in strongly hierarchized organizations. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 143\u2013153. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-12139-5_13"},{"issue":"4598","key":"37_CR7","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., et al.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"\u00dclker, \u00d6., Landa-Silva, D.: Evolutionary local search for solving the office space allocation problem. In: 2012 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2012)","DOI":"10.1109\/CEC.2012.6253009"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Awadallah, M.A., Khader, A.T., Al-Betar, M.A., Woon, P.C.: Office-space-allocation problem using harmony search algorithm. In: Neural Information Processing, Springer 365\u2013374(2012)","DOI":"10.1007\/978-3-642-34481-7_45"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/0-387-25383-1_6","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"EK Burke","year":"2005","unstructured":"Burke, E.K., Silva, J.D.L., Soubeiga, E.: Multi-objective hyper-heuristic approaches for space allocation and timetabling. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, vol. 32, pp. 129\u2013158. Springer US, New York (2005). doi:10.1007\/0-387-25383-1_6"},{"key":"37_CR11","unstructured":"Burke, E., Cowling, P., Silva, J.L.: Hybrid population-based metaheuristic approaches for the space allocation problem. In: Proceedings of the 2001 Congress on Evolutionary Computation, 2001, vol. 1, 232\u2013239. IEEE (2001)"},{"key":"37_CR12","unstructured":"Burke, E., Cowling, P., Landa Silva, J., Petrovic, S.: Combining hybrid metaheuristics and populations for the multiobjective optimisation of space allocation problems. In: Proceedings of the 2001 Genetic and Evolutionary Computation Conference (GECCO 2001), 1252\u20131259 (2001)"},{"issue":"5","key":"37_CR13","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.jocs.2014.04.002","volume":"5","author":"AL Bolaji","year":"2014","unstructured":"Bolaji, A.L., Khader, A.T., Al-Betar, M.A., Awadallah, M.A.: University course timetabling using hybridized artificial bee colony with hill climbing optimizer. J. Comput. Sci. 5(5), 809\u2013818 (2014)","journal-title":"J. Comput. Sci."},{"issue":"1","key":"37_CR14","first-page":"37","volume":"24","author":"AL Bolaji","year":"2015","unstructured":"Bolaji, A.L., Khader, A.T., Al-Betar, M.A., Awadallah, M.A.: A hybrid nature-inspired artificial bee colony algorithm for uncapacitated examination timetabling problems. J. Intell. Syst. 24(1), 37\u201354 (2015)","journal-title":"J. Intell. Syst."},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1016\/j.asoc.2015.07.004","volume":"35","author":"MA Awadallah","year":"2015","unstructured":"Awadallah, M.A., Bolaji, A.L., Al-Betar, M.A.: A hybrid artificial bee colony for a nurse rostering problem. Appl. Soft Comput. 35, 726\u2013739 (2015)","journal-title":"Appl. Soft Comput."},{"key":"37_CR16","unstructured":"Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report TR06, Erciyes University Press, Erciyes (2005)"},{"issue":"2","key":"37_CR17","first-page":"434","volume":"47","author":"AL Bolaji","year":"2013","unstructured":"Bolaji, A.L., Khader, A.T., Al-Betar, M.A., Awadallah, M.A.: Artificial bee colony, its variants and applications: a survey. J. Theor. Appl. Inform. Technol. (JATIT) 47(2), 434\u2013459 (2013)","journal-title":"J. Theor. Appl. Inform. Technol. (JATIT)"},{"key":"37_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2012","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42, 21\u201357 (2012)","journal-title":"Artif. Intell. Rev."},{"key":"37_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-61794-9_62","volume-title":"Practice and Theory of Automated Timetabling","author":"D Corne","year":"1996","unstructured":"Corne, D., Ross, P.: Peckish initialisation strategies for evolutionary timetabling. In: Burke, E., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 227\u2013240. Springer, Heidelberg (1996). doi:10.1007\/3-540-61794-9_62"},{"issue":"2","key":"37_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jncr.2012040101","volume":"3","author":"AL Bolaji","year":"2012","unstructured":"Bolaji, A.L., Khader, A.T., Al-Betar, M.A., Awadallah, M.A.: Artificial bee colony algorithm for solving educational timetabling problems. Int. J. Natural Comput. Res. 3(2), 1\u201321 (2012)","journal-title":"Int. J. Natural Comput. Res."},{"issue":"4","key":"37_CR21","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1287\/ijoc.1060.0200","volume":"19","author":"D Landa-Silva","year":"2007","unstructured":"Landa-Silva, D., Burke, E.K.: Asynchronous cooperative local search for the office-space-allocation problem. INFORMS J. Comput. 19(4), 575\u2013587 (2007)","journal-title":"INFORMS J. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61824-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:12:49Z","timestamp":1709827969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-61824-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319618234","9783319618241"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61824-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"24 June 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fukuoka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-si.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}