{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T15:54:20Z","timestamp":1775318060149,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030059828","type":"print"},{"value":"9783030059835","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T00:00:00Z","timestamp":1545091200000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-05983-5_14","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T07:27:46Z","timestamp":1545031666000},"page":"180-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adaptation of Late Acceptance Hill Climbing Algorithm for Optimizing the Office-Space Allocation Problem"],"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":[[2018,12,18]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1018947117526","volume":"92","author":"H Kellerer","year":"1999","unstructured":"Kellerer, H., Pferschy, U.: Cardinality constrained bin-packing problems. Ann. Oper. Res. 92, 335\u2013348 (1999)","journal-title":"Ann. Oper. Res."},{"key":"14_CR2","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). https:\/\/doi.org\/10.1007\/978-3-540-77345-0_1"},{"key":"14_CR3","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. Not. Discrete Math. 36, 575\u2013582 (2010)","journal-title":"Electron. Not. Discrete Math."},{"issue":"4","key":"14_CR4","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"},{"issue":"9","key":"14_CR5","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."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-642-34481-7_45","volume-title":"Neural Information Processing","author":"MA Awadallah","year":"2012","unstructured":"Awadallah, M.A., Khader, A.T., Al-Betar, M.A., Woon, P.C.: Office-space-allocation problem using harmony search algorithm. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds.) ICONIP 2012. LNCS, vol. 7664, pp. 365\u2013374. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34481-7_45"},{"key":"14_CR7","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). https:\/\/doi.org\/10.1007\/3-540-44629-X_16"},{"key":"14_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":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-319-61824-1_37","volume-title":"Advances in Swarm Intelligence","author":"AL Bolaji","year":"2017","unstructured":"Bolaji, A.L., Michael, I., Shola, P.B.: Optimization of office-space allocation problem using artificial bee colony algorithm. In: Tan, Y., Takagi, H., Shi, Y. (eds.) ICSI 2017. LNCS, vol. 10385, pp. 337\u2013346. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61824-1_37"},{"issue":"4598","key":"14_CR10","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":"14_CR11","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). https:\/\/doi.org\/10.1007\/978-3-642-12139-5_13"},{"key":"14_CR12","doi-asserted-by":"crossref","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, vol. 1, pp. 232\u2013239. IEEE (2001)","DOI":"10.1109\/CEC.2001.934394"},{"key":"14_CR13","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, pp. 1252\u20131259 (2001)"},{"key":"14_CR14","series-title":"Operations Research\/Computer Science Interfaces Series","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. ORCS, vol. 32, pp. 129\u2013158. Springer, Boston (2005). https:\/\/doi.org\/10.1007\/0-387-25383-1_6"},{"key":"14_CR15","unstructured":"Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for exam timetabling problems. In: PATAT 2008 Conference, Montreal, Canada (2008)"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10845-013-0770-x","volume":"26","author":"B Yuan","year":"2015","unstructured":"Yuan, B., Zhang, C., Shao, X.: A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints. J. Intell. Manuf. 26(1), 159\u2013168 (2015)","journal-title":"J. Intell. Manuf."},{"issue":"1","key":"14_CR17","first-page":"192","volume":"10","author":"A Abuhamdah","year":"2010","unstructured":"Abuhamdah, A.: Experimental result of late acceptance randomized descent algorithm for solving course timetabling problems. Int. J. Comput. Sci. Netw. Secur. 10(1), 192\u2013200 (2010)","journal-title":"Int. J. Comput. Sci. Netw. Secur."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-7908-2362-2_23","volume-title":"Logistik Management","author":"J Verstichel","year":"2009","unstructured":"Verstichel, J., Berghe, G.V.: A late acceptance algorithm for the lock scheduling problem. In: Vo\u00df, S., Pahl, J., Schwarze, S. (eds.) Logistik Management, pp. 457\u2013478. Springer, Heidelberg (2009)"},{"key":"14_CR19","unstructured":"Tierney, K.: Late acceptance hill climbing for the liner shippingfleet repositioning problem. In: Proceedings of the 14th EU\/MEWorkshop, pp. 21\u201327 (2013)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-41019-2_13","volume-title":"Computational Logistics","author":"A Goerler","year":"2013","unstructured":"Goerler, A., Schulte, F., Vo\u00df, S.: An application of late acceptance hill-climbing to the traveling purchaser problem. In: Pacino, D., Vo\u00df, S., Jensen, R.M. (eds.) ICCL 2013. LNCS, vol. 8197, pp. 173\u2013183. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41019-2_13"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.knosys.2018.01.017","volume":"145","author":"AL Bolaji","year":"2018","unstructured":"Bolaji, A.L., Bamigbola, A.F., Shola, P.B.: Late acceptance hill climbing algorithm for solving patient admission scheduling problem. Knowl.-Based Syst. 145, 197\u2013206 (2018)","journal-title":"Knowl.-Based Syst."},{"issue":"3","key":"14_CR22","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10951-013-0352-y","volume":"17","author":"M Alzaqebah","year":"2014","unstructured":"Alzaqebah, M., Abdullah, S.: An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling. J. Sched. 17(3), 249\u2013262 (2014)","journal-title":"J. Sched."},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., Bykov, Y., Birben, M., Burke, E.K.: Examination timetabling using late acceptance hyper-heuristics. In: IEEE Congress on Evolutionary Computation, CEC 2009, pp. 997\u20131004. IEEE (2009)","DOI":"10.1109\/CEC.2009.4983054"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Jackson, W.G., Ozcan, E., Drake, J.H.: Late acceptance-based selection hyper-heuristics for cross-domain heuristic search. In: 2013 13th UK Workshop on Computational Intelligence, UKCI, pp. 228\u2013235. IEEE (2013)","DOI":"10.1109\/UKCI.2013.6651310"},{"issue":"4","key":"14_CR25","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","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05983-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T14:57:28Z","timestamp":1775314648000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05983-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,18]]},"ISBN":["9783030059828","9783030059835"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05983-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,18]]},"assertion":[{"value":"18 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Hybrid Metaheuristics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Concepci\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hm2019.ing.udec.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}