{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:38:48Z","timestamp":1761896328360,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2016,6,24]],"date-time":"2016-06-24T00:00:00Z","timestamp":1466726400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004515","name":"Universiti Kebangsaan Malaysia","doi-asserted-by":"publisher","award":["DIP-2014-039"],"award-info":[{"award-number":["DIP-2014-039"]}],"id":[{"id":"10.13039\/501100004515","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00500-016-2225-8","type":"journal-article","created":{"date-parts":[[2016,6,24]],"date-time":"2016-06-24T08:35:58Z","timestamp":1466757358000},"page":"6755-6765","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["An adaptive guided variable neighborhood search based on honey-bee mating optimization algorithm for the course timetabling problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Rafidah Abdul","family":"Aziz","sequence":"first","affiliation":[]},{"given":"Masri","family":"Ayob","sequence":"additional","affiliation":[]},{"given":"Zalinda","family":"Othman","sequence":"additional","affiliation":[]},{"given":"Zulkifli","family":"Ahmad","sequence":"additional","affiliation":[]},{"given":"Nasser R.","family":"Sabar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,24]]},"reference":[{"key":"2225_CR1","doi-asserted-by":"crossref","unstructured":"Abbass HA (2001) MBO: marriage in honey bees optimization-A haplometrosis polygynous swarming approach. In: Proceedings of the 2001 Congress on evolutionary computation, 2001, vol 1. IEEE, pp 207\u2013214","DOI":"10.1109\/CEC.2001.934391"},{"key":"2225_CR2","doi-asserted-by":"crossref","unstructured":"Abdullah S, Turabieh H (2008) Generating university course timetable using genetic algorithms and local search. In: Third international conference on convergence and hybrid information technology, 2008. ICCIT\u201908, vol 1. IEEE, pp 254\u2013260","DOI":"10.1109\/ICCIT.2008.379"},{"key":"2225_CR3","doi-asserted-by":"crossref","unstructured":"Abuhamdah A, Ayob M (2010) Average late acceptance randomized descent algorithm for solving course timetabling problems. In: 2010 international symposium in information technology (ITSim), vol 2. IEEE, pp 748\u2013753","DOI":"10.1109\/ITSIM.2010.5561545"},{"issue":"8","key":"2225_CR4","doi-asserted-by":"crossref","first-page":"3608","DOI":"10.1016\/j.asoc.2013.04.010","volume":"13","author":"S Abdullah","year":"2013","unstructured":"Abdullah S, Alzaqebah M (2013) A hybrid self-adaptive bees algorithm for examination timetabling problems. Appl Soft Comput 13(8):3608\u20133620","journal-title":"Appl Soft Comput"},{"key":"2225_CR5","doi-asserted-by":"crossref","unstructured":"Abdullah S, Burke EK, McCollum B (2007) A hybrid evolutionary approach to the university course timetabling problem. In: IEEE Congress on evolutionary computation, 2007. CEC 2007. IEEE, pp 1764\u20131768","DOI":"10.1109\/CEC.2007.4424686"},{"issue":"1","key":"2225_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-010-0769-z","volume":"194","author":"MA Al-Betar","year":"2012","unstructured":"Al-Betar MA, Khader AT (2012) A harmony search algorithm for university course timetabling. Ann Oper Res 194(1):3\u201331","journal-title":"Ann Oper Res"},{"issue":"6","key":"2225_CR7","doi-asserted-by":"crossref","first-page":"883","DOI":"10.3923\/jas.2013.883.888","volume":"13","author":"RA Aziz","year":"2013","unstructured":"Aziz RA, Ayob M, Othman Z, Sarim HM (2013) Adaptive guided variable neighborhood search. J Appl Sci 13(6):883\u2013888","journal-title":"J Appl Sci"},{"key":"2225_CR8","doi-asserted-by":"crossref","unstructured":"Baykasoglu A, Ozbakir L, Tapkan P (2007) Artificial bee colony algorithm and its application to generalized assignment problem. In: Chan S, Kumar T (eds) Swarm intelligence: focus on ant and particle swarm optimization, pp 113\u2013144","DOI":"10.5772\/5101"},{"issue":"2","key":"2225_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/jncr.2012040101","volume":"3","author":"AL Bolaji","year":"2012","unstructured":"Bolaji AL, Khader AT, Al-Betar MA, Awadallah MA (2012) Artificial bee colony algorithm for solving educational timetabling problems. Int J Nat Comput Res IJNCR 3(2):1\u201321","journal-title":"Int J Nat Comput Res IJNCR"},{"issue":"5","key":"2225_CR10","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/j.jocs.2014.04.002","volume":"5","author":"AL Bolaji","year":"2014","unstructured":"Bolaji AL, Khader AT, Al-Betar MA, Awadallah MA (2014) University course timetabling using hybridized artificial bee colony with hill climbing optimizer. J Comput Sci 5(5):809\u2013818","journal-title":"J Comput Sci"},{"issue":"1","key":"2225_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1515\/jisys-2014-0002","volume":"24","author":"AL Bolaji","year":"2015","unstructured":"Bolaji AL, Khader AT, Al-Betar MA, Awadallah MA (2015) A hybrid nature-inspired artificial bee colony algorithm for uncapacitated examination timetabling problems. J Intell Syst 24(1):37\u201354","journal-title":"J Intell Syst"},{"issue":"7\u20138","key":"2225_CR12","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s00170-007-1132-7","volume":"38","author":"M Fathian","year":"2008","unstructured":"Fathian M, Amiri B (2008) A honeybee-mating approach for cluster analysis. Int J Adv Manuf Technol 38(7\u20138):809\u2013821","journal-title":"Int J Adv Manuf Technol"},{"key":"2225_CR13","doi-asserted-by":"crossref","unstructured":"Fatnassi E, Chebbi O, Chaouachi J (2016) Discrete honeybee mating optimization algorithm for the routing of battery-operated automated guidance electric vehicles in personal rapid transit systems. Swarm Evolut Comput 26:35\u201349","DOI":"10.1016\/j.swevo.2015.08.001"},{"key":"2225_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2014.05.039","volume":"283","author":"CW Fong","year":"2014","unstructured":"Fong CW, Asmuni H, McCollum B, McMullan P, Omatu S (2014) A new hybrid imperialist swarm-based optimization algorithm for university timetabling problems. Inf Sci 283:1\u201321","journal-title":"Inf Sci"},{"issue":"6","key":"2225_CR15","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1109\/TEVC.2015.2411741","volume":"19","author":"CW Fong","year":"2015","unstructured":"Fong CW, Asmuni H, McCollum B (2015) A hybrid swarm-based approach to university timetabling. IEEE Trans Evolut Comput 19(6):870\u2013884","journal-title":"IEEE Trans Evolut Comput"},{"issue":"10","key":"2225_CR16","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf Sci 180(10):2044\u20132064","journal-title":"Inf Sci"},{"issue":"5","key":"2225_CR17","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s11269-005-9001-3","volume":"20","author":"OB Haddad","year":"2006","unstructured":"Haddad OB, Afshar A, Marino MA (2006) Honey-bees mating optimization (HBMO) algorithm: a new heuristic approach for water resources optimization. Water Resour Manag 20(5):661\u2013680","journal-title":"Water Resour Manag"},{"key":"2225_CR18","doi-asserted-by":"crossref","unstructured":"Haddad OB, Ghajarnia N, Solgi M, Lo\u00e1iciga HA, Mari\u00f1o M (2016) A DSS-based honeybee mating optimization (HBMO) algorithm for single- and multi-objective design of water distribution networks. In: Yang X-S, Bekda\u015f G, Nigdeli SM (eds) Metaheuristics and optimization in civil engineering, vol 7. Springer, Berlin, pp 199\u2013233","DOI":"10.1007\/978-3-319-26245-1_10"},{"key":"2225_CR19","doi-asserted-by":"crossref","unstructured":"Jaradat GM, Ayob M (2011) Scatter search for solving the course timetabling problem. In: 2011 3rd conference on data mining and optimization (DMO), 2011. IEEE, pp 213\u2013218","DOI":"10.1109\/DMO.2011.5976530"},{"issue":"5\u20138","key":"2225_CR20","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1007\/s00170-015-7069-3","volume":"80","author":"L Jin","year":"2015","unstructured":"Jin L, Zhang C, Shao X (2015) An effective hybrid honey bee mating optimization algorithm for integrated process planning and scheduling problems. Int J Adv Manuf Technol 80(5\u20138):1253\u20131264. doi: 10.1007\/s00170-015-7069-3","journal-title":"Int J Adv Manuf Technol"},{"key":"2225_CR21","doi-asserted-by":"crossref","unstructured":"Junaedi D, Maulidevi NU (2011) Solving curriculum-based course timetabling problem with artificial bee colony algorithm. In: 2011 first international conference on informatics and computational intelligence (ICI), 2011. IEEE, pp 112\u2013117","DOI":"10.1109\/ICI.2011.28"},{"key":"2225_CR22","doi-asserted-by":"crossref","unstructured":"Kendall G, Bai R, B\u0142azewicz J, De Causmaecker P, Gendreau M, John R, Li J, McCollum B, Pesch E, Qu R, Sabar N (2016) Good laboratory practice for optimization research. J Oper Res Soc 67(4):676\u2013689","DOI":"10.1057\/jors.2015.77"},{"key":"2225_CR23","doi-asserted-by":"crossref","unstructured":"Landa-Silva D, Obit JH (2009) Evolutionary non-linear great deluge for university course timetabling. In: Proceedings of the international conference on hybrid artificial intelligence systems. Springer, Berlin, Heidelberg, pp 269\u2013276","DOI":"10.1007\/978-3-642-02319-4_32"},{"key":"2225_CR24","doi-asserted-by":"crossref","unstructured":"Lara C, Flores JJ, Calder\u00f3n F (2008) Solving a school timetabling problem using a bee algorithm. In: MICAI 2008: advances in artificial intelligence. Springer, pp 664\u2013674","DOI":"10.1007\/978-3-540-88636-5_63"},{"issue":"1","key":"2225_CR25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s11047-009-9136-x","volume":"9","author":"Y Marinakis","year":"2010","unstructured":"Marinakis Y, Marinaki M, Dounias G (2010) Honey bees mating optimization algorithm for large scale vehicle routing problems. Nat Comput 9(1):5\u201327","journal-title":"Nat Comput"},{"key":"2225_CR26","doi-asserted-by":"crossref","unstructured":"Sabar NR, Ayob M (2009) Examination timetabling using scatter search hyper-heuristic. In: 2nd conference on data mining and optimization, 2009. DMO\u201909. IEEE, pp 127\u2013131","DOI":"10.1109\/DMO.2009.5341899"},{"key":"2225_CR27","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.ins.2014.10.045","volume":"314","author":"NR Sabar","year":"2015","unstructured":"Sabar NR, Kendall G (2015) Population based Monte Carlo tree search hyper-heuristic for combinatorial optimization problems. Inf Sci 314:225\u2013239","journal-title":"Inf Sci"},{"issue":"3","key":"2225_CR28","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.ejor.2011.08.006","volume":"216","author":"NR Sabar","year":"2012","unstructured":"Sabar NR, Ayob M, Kendall G, Qu R (2012) A honey-bee mating optimization algorithm for educational timetabling problems. Eur J Oper Res 216(3):533\u2013543","journal-title":"Eur J Oper Res"},{"issue":"6","key":"2225_CR29","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1109\/TEVC.2013.2281527","volume":"17","author":"NR Sabar","year":"2013","unstructured":"Sabar NR, Ayob M, Kendall G, Qu R (2013) Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Trans Evolut Comput 17(6):840\u2013861","journal-title":"IEEE Trans Evolut Comput"},{"issue":"3","key":"2225_CR30","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/TEVC.2014.2319051","volume":"19","author":"NR Sabar","year":"2015","unstructured":"Sabar NR, Ayob M, Kendall G, Qu R (2015) Automatic design of a hyper-heuristic framework with gene expression programming for combinatorial optimization problems. IEEE Trans Evolut Comput 19(3):309\u2013325","journal-title":"IEEE Trans Evolut Comput"},{"key":"2225_CR31","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.ijepes.2014.05.010","volume":"62","author":"H Shayeghi","year":"2014","unstructured":"Shayeghi H, Ghasemi A (2014) A multi objective vector evaluated improved honey bee mating optimization for optimal and robust design of power system stabilizers. Int J Electr Power Energy Syst 62:630\u2013645. doi: 10.1016\/j.ijepes.2014.05.010","journal-title":"Int J Electr Power Energy Syst"},{"key":"2225_CR32","doi-asserted-by":"publisher","unstructured":"Shayeghi H, Moradzadeh M, Ghasemi A, Vandevelde L (2014) Multi-objective design of multi-stage fuzzy stabilizer using modified honey-bee mating optimization. In: 2014 18th international conference system theory, control and computing (ICSTCC), pp 769\u2014772, 17\u201319 Oct 2014. doi: 10.1109\/icstcc.2014.6982511","DOI":"10.1109\/icstcc.2014.6982511"},{"key":"2225_CR33","doi-asserted-by":"crossref","unstructured":"Socha K, Sampels M, Manfrin M (2003) Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. In: Workshops on applications of evolutionary computation. Springer, Berlin, Heidelberg, pp 334\u2013345","DOI":"10.1007\/3-540-36605-9_31"},{"key":"2225_CR34","doi-asserted-by":"crossref","unstructured":"Turabieh H, Abdullah S (2009) Incorporating tabu search into memetic approach for enrolment-based course timetabling problems. In: 2nd conference on data mining and optimization, 2009. DMO\u201909. IEEE, pp 115\u2013119","DOI":"10.1109\/DMO.2009.5341901"},{"key":"2225_CR35","doi-asserted-by":"crossref","unstructured":"Turabieh H, Abdullah S, Mccollum B (2009) Electromagnetism-like mechanism with force decay rate great deluge for the course timetabling problem. In: Proceedings of the international conference on rough sets and knowledge technology. Springer, Berlin, Heidelberg, pp 497\u2013504","DOI":"10.1007\/978-3-642-02962-2_63"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2225-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2225-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2225-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2225-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T21:21:08Z","timestamp":1600809668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2225-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,24]]},"references-count":35,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2225"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2225-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2016,6,24]]}}}