Soft Computing

, Volume 21, Issue 22, pp 6755–6765 | Cite as

An adaptive guided variable neighborhood search based on honey-bee mating optimization algorithm for the course timetabling problem

  • Rafidah Abdul Aziz
  • Masri Ayob
  • Zalinda Othman
  • Zulkifli Ahmad
  • Nasser R. Sabar
Methodologies and Application
  • 159 Downloads

Abstract

A standard honey-bee mating optimization algorithm (HBMO) utilizes the steepest descent local search algorithm as a worker. The steepest descent algorithm has the advantage of being simple to understand, fast and is easy to implement. However, it can easily trapped in a local optimum and subsequently restrict the performance of HBMO. Furthermore, the type of neighborhood structures that are used within the local search algorithm might impact on the performance of algorithm. This work aimed to enhance the performance of HBMO by using an adaptive guided variable neighborhood search (AGVNS) as a worker. The AGVNS algorithm is a variant of variable neighborhood search algorithm that incorporates some problem-specific knowledge and utilizes an adaptive learning mechanism to find the most suitable neighborhood structure during the searching process. In order to evaluate the effectiveness of the proposed algorithm, the Socha course timetabling dataset has been chosen as the tested domain problem. The results demonstrated that the performance of the proposed algorithm is comparable to other approaches in the literature. Indeed, the proposed algorithm obtained the best results as compared to other approaches on some instances. These results indicate the effectiveness of combining HBMO and AGVNS for solving course timetabling problems, hence demonstrated that the AGVNS can enhance the performance of HBMO.

Keywords

Honey-bee mating optimization Course timetabling problem Adaptive guided variable neighborhood search 

References

  1. 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–214Google Scholar
  2. 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’08, vol 1. IEEE, pp 254–260Google Scholar
  3. 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–753Google Scholar
  4. Abdullah S, Alzaqebah M (2013) A hybrid self-adaptive bees algorithm for examination timetabling problems. Appl Soft Comput 13(8):3608–3620CrossRefGoogle Scholar
  5. 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–1768Google Scholar
  6. Al-Betar MA, Khader AT (2012) A harmony search algorithm for university course timetabling. Ann Oper Res 194(1):3–31MathSciNetCrossRefMATHGoogle Scholar
  7. Aziz RA, Ayob M, Othman Z, Sarim HM (2013) Adaptive guided variable neighborhood search. J Appl Sci 13(6):883–888CrossRefGoogle Scholar
  8. 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–144Google Scholar
  9. 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–21CrossRefGoogle Scholar
  10. 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–818CrossRefGoogle Scholar
  11. 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–54Google Scholar
  12. Fathian M, Amiri B (2008) A honeybee-mating approach for cluster analysis. Int J Adv Manuf Technol 38(7–8):809–821CrossRefGoogle Scholar
  13. 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–49Google Scholar
  14. 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–21CrossRefGoogle Scholar
  15. Fong CW, Asmuni H, McCollum B (2015) A hybrid swarm-based approach to university timetabling. IEEE Trans Evolut Comput 19(6):870–884CrossRefGoogle Scholar
  16. García S, Fernández 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–2064CrossRefGoogle Scholar
  17. 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–680CrossRefGoogle Scholar
  18. Haddad OB, Ghajarnia N, Solgi M, Loáiciga HA, Mariño 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ş G, Nigdeli SM (eds) Metaheuristics and optimization in civil engineering, vol 7. Springer, Berlin, pp 199–233Google Scholar
  19. 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–218Google Scholar
  20. 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–8):1253–1264. doi:10.1007/s00170-015-7069-3 CrossRefGoogle Scholar
  21. 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–117Google Scholar
  22. Kendall G, Bai R, Błazewicz 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–689Google Scholar
  23. 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–276Google Scholar
  24. Lara C, Flores JJ, Calderón F (2008) Solving a school timetabling problem using a bee algorithm. In: MICAI 2008: advances in artificial intelligence. Springer, pp 664–674Google Scholar
  25. Marinakis Y, Marinaki M, Dounias G (2010) Honey bees mating optimization algorithm for large scale vehicle routing problems. Nat Comput 9(1):5–27MathSciNetCrossRefMATHGoogle Scholar
  26. Sabar NR, Ayob M (2009) Examination timetabling using scatter search hyper-heuristic. In: 2nd conference on data mining and optimization, 2009. DMO’09. IEEE, pp 127–131Google Scholar
  27. Sabar NR, Kendall G (2015) Population based Monte Carlo tree search hyper-heuristic for combinatorial optimization problems. Inf Sci 314:225–239CrossRefGoogle Scholar
  28. 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–543MathSciNetCrossRefGoogle Scholar
  29. Sabar NR, Ayob M, Kendall G, Qu R (2013) Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Trans Evolut Comput 17(6):840–861CrossRefGoogle Scholar
  30. 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–325CrossRefGoogle Scholar
  31. 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–645. doi:10.1016/j.ijepes.2014.05.010 CrossRefGoogle Scholar
  32. 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—772, 17–19 Oct 2014. doi:10.1109/icstcc.2014.6982511
  33. 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–345Google Scholar
  34. 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’09. IEEE, pp 115–119Google Scholar
  35. 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–504Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Rafidah Abdul Aziz
    • 1
  • Masri Ayob
    • 1
  • Zalinda Othman
    • 1
  • Zulkifli Ahmad
    • 2
  • Nasser R. Sabar
    • 1
  1. 1.Data Mining and Optimization Research Group, Centre of Artificial Intelligence TechnologyUniversiti Kebangsaan Malaysia (UKM)BangiMalaysia
  2. 2.School of Linguistics and Language Studies, Faculty of Social Sciences and HumanitiesUniversiti Kebangsaan Malaysia (UKM)BangiMalaysia

Personalised recommendations