University course timetabling using a hybrid harmony search metaheuristic algorithm

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 42, Issue 5, 2012, Pages 664-681

  Al Betar, Mohammed Azmi ^a,b   Khader, Ahamad Tajudin ^a   Zaman, Munir ^a  

^a SCHOOL OF PHYSICS   (Malaysia)

^b AL ZAYTOONAH UNIVERSITY OF JORDAN   (Jordan)

Author keywords

Harmony search; hill climbing; memetic computing; optimization; particle swarm optimization (PSO); timetabling

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; DATA SETS; EXPLORATION AND EXPLOITATION; GLOBAL SEARCH; HARMONY SEARCH; HARMONY SEARCH ALGORITHMS; HILL CLIMBING; KEY FEATURE; LARGE DATASETS; MEMETIC COMPUTING; META HEURISTIC ALGORITHM; METAHEURISTIC; OPTIMAL SOLUTIONS; SEARCH SPACES; TIME SLOTS; TIMETABLING; UNIVERSITY COURSE; UNIVERSITY COURSE TIMETABLING-PROBLEMS;

COMBINATORIAL OPTIMIZATION; LEARNING ALGORITHMS; OPTIMIZATION; SCHEDULING;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 84865471072     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2011.2174356     Document Type: Article

References (77)

1. R. Lewis, "A survey of metaheuristic-based techniques for university timetabling problems," OR Spectrum, vol. 30, pp. 167-190, 2008.
2. E. K. Burke, D. deWerra, and J. Kingston, "Applications to timetabling," in Handbook of Graph Theory, J. L. Gross and J. Yellen, Eds. London, U.K.: CRC Press, 2004, pp. 445-474.
3. C. Blum and A. Roli, "Metaheuristics in combinatorial optimization: Overview and conceptual comparison," ACM Comput. Surv., vol. 35, no. 3, pp. 268-308, 2003.
4. Y.-S. Ong, M.-H. Lim, N. Zhu, and K.-W. Wong, "Classification of adaptive memetic algorithms: A comparative study," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 36, no. 1, pp. 141-152, Feb. 2006. (Pubitemid 43174148)
5. J. Tang, M. Lim, and Y.-S. Ong, "Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems," Soft Comput.-Fusion Found., Methodol. Appl., vol. 11, pp. 873-888, 2007. (Pubitemid 46637827)
6. S. Handoko, C. K. Kwoh, and Y.-S. Ong, "Feasibility structure modeling: An effective chaperone for constrained memetic algorithms," IEEE Trans. Evol. Comput., vol. 14, no. 5, pp. 740-758, Oct. 2010.
7. Y. S. Ong and A. Keane, "Meta-lamarckian learning in memetic algorithms," IEEE Trans. Evol. Comput., vol. 8, no. 2, pp. 99-110, Apr. 2004.
8. Q. H. Nguyen, Y.-S. Ong, and M. H. Lim, "A probabilistic memetic framework," IEEE Trans. Evol. Comput., vol. 13, no. 3, pp. 604-623, Jun. 2009.
9. R. Meuth, M.-H. Lim, Y.-S. Ong, and D. Wunsch, "A proposition on memes and meta-memes in computing for higher-order learning," Memetic Comput., vol. 1, pp. 85-100, 2009.
10. N. Q. Huy, O. Y. Soon, L. M. Hiot, and N. Krasnogor, "Adaptive cellular memetic algorithms," Evol. Comput., vol. 17, no. 2, pp. 231-256, 2009.
11. Z.W. Geem, J. H. Kim, and G. V. Loganathan, "A new heuristic optimization algorithm: Harmony search," Simulation, vol. 76, no. 2, pp. 60-68, 2001. (Pubitemid 32543074)
12. M. Mahdavi, M. Fesanghary, and E. Damangir, "An improved harmony search algorithm for solving optimization problems," Appl. Math. Comput., vol. 188, no. 2, pp. 1567-1579, 2007. (Pubitemid 46710046)
13. Z. W. Geem, "Novel derivative of harmony search algorithm for discrete design variables," Appl. Math. Comput., vol. 199, no. 1, pp. 223-230, 2008. (Pubitemid 351508326)
14. G. G. Roy, P. Chakraborty, and S. Das, "Designing fractional-order piλdμ controller using differential harmony search algorithm," Int. J. Bio-Inspired Comput., vol. 2, no. 5, pp. 303-309, 2010.
15. B. K. Panigrahi, V. R. Pandi, S. Das, and Z. Cui, "Dynamic economic load dispatch with wind energy using modified harmony search," Int. J. Bio-Inspired Comput., vol. 2, no. 3/4, pp. 303-309, 2010.
16. G. Ingram and T. Zhang, "Overview of applications and developments in the harmony search algorithm," in Music-Inspired Harmony Search Algorithm, Z. W. Geem, Ed. Berlin, Germany: Springer-Verlag, 2009, pp. 15-37.
17. Z. W. Geem, "Harmony search in water pump switching problem," in Advances in Natural Computation (Lecture Notes in Computer Science vol. 3612), K. C. L.Wang and Y. Ong, Eds. Berlin, Germany: Springer-Verlag, 2005, pp. 751-760. (Pubitemid 41449643)
18. M. A. Al Betar, A. T. Khader, and J. J. Thomas, "A combination of metaheuristic components based on harmony search for the uncapacitated examination timetabling," presented at the Proc. 8th Int. Conf. Practice Theory Automat. Timetabling, Belfast, Northern Ireland, Aug. 2010.
19. M. A. Al-Betar, A. T. Khader, and F. Nadi, "Selection mechanisms in memory consideration for examination timetabling with harmony search," presented at the Proc. Genetic and Evolutionary Computation Conf., Portland, OR, Jul. 2010.
20. X.-S. Yang, "Harmony search as a metaheuristic algorithm," in Music-Inspired Harmony Search Algorithm, Z.W.Geem, Ed. Berlin,Germany: Springer-Verlag, 2009, pp. 1-14.
21. M. G. H. Omran and M. Mahdavi, "Global-best harmony search," Appl. Math. Comput., vol. 198, no. 2, pp. 643-656, 2008. (Pubitemid 351400737)
22. V. R. Pandi, B. K. Panigrahi, R. C. Bansal, S. Das, and A. Mohapatra, "Economic load dispatch using hybrid swarm intelligence based harmony search algorithm," Electr. Power Compon. Syst., vol. 39, no. 8, pp. 751-767, 2011.
23. P. Chakraborty, G. G. Roy, S. Das, D. Jain, and A. Abraham, "An improved harmony search algorithm with differential mutation operator," IFundamenta Informaticae, vol. 95, no. 4, pp. 401-426, 2009.
24. S. Zhao, P. N. Suganthan, and S. Das, "Dynamic multi-swarm particle swarm optimizer with sub-regional harmony search," in Proc. IEEE Congr. Evol. Comput., Barcelona, Spain, 2010, pp. 1-8.
25. O. Alia and R. Mandava, "The variants of the harmony search algorithm: An overview," Artif. Intell. Rev., vol. 36, pp. 49-68, 2011.
26. S. Das, A. Mukhopadhyay, A. Roy, A. Abraham, and B. K. Panigrahi, "Exploratory power of the harmony search algorithm: Analysis and improvements for global numerical optimization," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 41, no. 1, pp. 89-106, Feb. 2011.
27. B. K. Panigrahi, V. R. Pandi, S. Das, and A. Abraham, "Population variance harmony search algorithm to solve optimal power flow with non-smooth cost function," in Recent Advances In Harmony Search Algorithm (Studies in Computational Intelligence vol. 270), Z. W. Geem, Ed. Berlin, Germany: Springer-Verlag, 2010, pp. 65-75.
28. M. A. Al-Betar and A. T. Khader, "A harmony search algorithm for university course timetabling," Ann. Operat. Res., pp. 1-29. DOI: 10.1016/j.amc.2011.11.095.
29. K. Socha, J. Knowles, and M. Samples, "A max-min ant system for the university course timetabling problem," in ANTS (Lecture Notes in Computer Science, vol. 2463). Berlin,Germany: Springer-Verlag, 2002, pp. 1-13.
30. M. A. Al-Betar,A. T.Khader, and I.Y. Liao, "Aharmony search algorithm with multi-pitch adjusting rate for university course timetabling," in Recent Advances In Harmony Search Algorithm (Studies in Computational Intelligence vol. 270), Z. W. Geem, Ed. Berlin, Germany: Springer-Verlag, 2010, pp. 147-162.
31. E. K. Burke and S. Petrovic, "Recent research directions in automated timetabling," Eur. J. Operat. Res., vol. 140, no. 2, pp. 266-280, 2002. (Pubitemid 34435033)
32. S. Abdullah, E. K. Burke, and B. McColum, "An investigation of variable neighbourhood search for university course timetabling," in Proc. 2nd Multidisciplinary Int. Conf. Schedul.: Theory Appl., New York, G. Kendall, L. Lei, and M. Pinedo, Eds., Jul. 18-21, 2005, pp. 413-427.
33. H. Asmuni, E. K. Burke, and J. M. Garibaldi, "Fuzzy multiple heuristic ordering for course timetabling," in Proc. 5th United Kingdom Workshop Comput. Intell. (UKCI), 2005, pp. 302-309.
34. P. McMullan, "An extended implementation of the great deluge algorithm for course timetabling," in Proc. 7th Int. Conf. Computational Science, Part I, 2007, pp. 538-545. (Pubitemid 350269688)
35. J. Obit, D. Landa-Silva, D. Ouelhadj, and M. Sevaux, "Non-linear great deluge with learning mechanism for solving the course timetabling problem," in Proc. 8th Metaheuris-tics Int. Conf., 2009, p. 10.
36. H. Turabieh, S. Abdullah, and B. McCollum, "Electromagnetism-like mechanism with force decay rate great deluge for the course timetabling problem," in Proc. Rough Sets Knowl. Technol., 2009, pp. 497-504.
37. S. Abdullah, E.K.Burke, and B. McCollum, "Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem," in Proc. Metaheuristic, 2007, pp. 153-169.
38. M. R. Malim, A. T. Khader, and A. Mustafa, "Artificial immune algorithms for university timetabling," in Proc. 6th Int. Conf. Pract. Theory Automated Timetabling, Brno, Czech Republic, Aug. 2006, pp. 234-245.
39. R. Lewis and B. Paechter, "New crossover operators for timetabling with evolutionary algorithms," in Proc. 5th Int. Conf. Recent Adv. Soft Comput., Nottingham, England, 2004, pp. 189-194.
40. R. Lewis and B. Paechter, "Application of the grouping genetic algorithm to university course timetabling," in Evolutionary Computation in Combinatorial Optimization (EvoCop) (Lecture Notes in Computer Science vol. 3448), G. Raidl and J. Gottlieb, Eds. Berlin, Germany: Springer-Verlag, 2005, pp. 144-153. (Pubitemid 41273996)
41. Y.-S. Ong, M. Lim, and X. Chen, "Memetic computation-Past, present & future[research frontier]," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 24-31, May 2010.
42. R. Qu, E. K. Burke, B. McCollum, L. T. G. Merlot, and S. Y. Lee, "A survey of search methodologies and automated system development for examination timetabling," J. Schedul., vol. 12, no. 1, pp. 55-89, 2009.
43. M. Fesanghary,M.Mahdavi,M.Minary-Jolandan, and Y. Alizadeh, "Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems," Comput. Methods Appl. Mech. Eng., vol. 197, no. 33-40, pp. 3080-3091, 2008.
44. E. K. Burke and J. D. Landa Silva, "The design of memetic algorithms for scheduling and timetabling problems," in Recent Advances in Memetic Algorithms and Related Search Technologies (Studies in Fuzziness and Soft Computing vol. 166). New York: Springer-Verlag, 2004, pp. 289-312.
45. E. K. Burke, J. P. Newall, and R. F. Weare, "A memetic algorithm for university exam timetabling," in Proc. 1st Int. Conf. Practice and Theory of Automated Timetabling (PATAT1995) (Lecture Notes in Computer Science vol. 1153), E. Burke and P. Ross, Eds. Berlin, Germany: Springer-Verlag, 1996, pp. 241-250. (Pubitemid 126141971)
46. E. K. Burke and J. P. Newall, "A multistage evolutionary algorithm for the timetable problem," IEEE Trans. Evol. Comput., vol. 3, no. 1, pp. 63-74, Apr. 1999.
47. S. Abdullah, E. K. Burke, and B. McCollum, "A hybrid evolutionary approach to the university course timetabling problem," in Proc. IEEE Congr. Evol. Comput., Singapore, Sep. 2007, pp. 1764-1768.
48. O. Rossi-Doria and B. Paechter, "A memetic algorithm for university course timetabling," presented at the Combinatorial Optimisation (CO'2004), School of Computing, Napier Univ., Scotland, 2004.
49. S. Abdullah and H. Turabieh, "Generating university course timetable using genetic algorithm and local search," in Proc. 3rd Int. Conf. Converg. Hybrid Inf. Technol., 2008, pp. 254-260.
50. S. Jat and S. Yang, "A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling," J. Schedul., vol. 14, no. 6, pp. 617-637, 2010. DOI:10.1007/s10951-010-0202-0.
51. S. Yang and S. N. Jat, "Genetic algorithms with guided and local search strategies for university course timetabling," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 41, no. 1, pp. 93-106, Jan. 2010.
52. D. Landa-Silva and J. H. Obit, "Evolutionary non-linear great deluge for university course timetabling," in Hybrid Artificial Intelligence Systems Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence vol. 5572), E. Corchado, X. Wu, E. Oja, E. Hristozov, and T. Jedlovcnik, Eds. Berlin, Germany: Springer-Verlag, 2009, pp. 269-276.
53. M.Ayob andG. Jaradat, "Hybrid ant colony systems for course timetabling problems," in Proc. 2nd Conf. Data Mining Optimization, Oct. 27-28, 2009, pp. 120-126.
54. E. K. Burke, G. Kendall, and E. Soubeiga, "A tabu-search hyperheuristic for timetabling and rostering," J. Heurist., vol. 9, no. 6, pp. 451-470, 2003.
55. E. K. Burke, B. McCollum, A. Meisels, S. Petrovic, and R. Qu, "A graphbased hyper-heuristic for educational timetabling problems," Eur. J. Oper. Res., vol. 176, no. 1, pp. 177-192, 2007. (Pubitemid 44442718)
56. M. W. Carter and G. Laporte, "Recent developments in practical course timetabling," in The Practice and Theory of Automated Timetabling (Lecture Notes in Computer Science vol. 1408), B. E. K and C. M, Eds. Berlin, Germany: Springer-Verlag, 1997, pp. 3-19.
57. Z.W. Geem, "Particle-swarm harmony search for water network design," Eng. Optim., vol. 41, no. 4, pp. 297-311, 2009.
58. O. Rossi-Doria, C. Blum, J. Knowles, M. Sampels, K. Socha, and B. Paechter, "A local search for the timetabling problem," in Proc. 4th Int. Conf. Pract. Theory Automat. Timetabling, Gent, Belgium, 2002, pp. 124-127.
59. B. McCollum, A. Schaerf, B. Paechter, P.McMullan, R. Lewis, A. Parkes, L. Di Gaspero, R. Qu, and E. K. Burke, "Setting the research agenda in automated timetabling: The second international timetabling competition," Informs J. Comput., vol. 22, no. 1, pp. 120-130, Jan. 2010. DOI:10.1287/ijoc. 1090.0320.
60. M. Chiarandini,M. Birattari, K. Socha, and O. Rossi-Doria, "An effective hybrid algorithm for university course timetabling," J. Schedul., vol. 9, no. 5, pp. 403-432, 2006.
61. B. McCollum, "University timetabling: Bridging the gap between research and practice," in Proc. 5th Int. Conf. Practice and Theory of Automated Timetabling, 2006, pp. 15-35.
62. M. Tuga, R. Berretta, and A. Mendes, "A hybrid simulated annealing with Kempe chain neighborhood for the university timetabling problem," in Proc. 6th IEEE/ACIS Int. Conf. Comput. Inf. Sci., 2007, pp. 400-405.
63. M. Al-Betar, A. Khader, and T. Gani, "A harmony search algorithm for university course timetabling," presented at the 7th Int. Conf. Practice Theory Automat. Timetabling, Montreal, Canada, Aug. 2008.
64. D. Landa-Silva and J. H. Obit, "Great deluge with non-linear decay rate for solving course timetabling problems," in Proc. 4th Int. IEEE Conf. Intell. Syst., Sep. 2008, pp. 8.11-8.18.
65. K. S. Lee and Z.W. Geem, "Anewmeta-heuristic algorithm for continuous engineering optimization: Harmony search theory and practice," Comput. Methods Appl. Mech. Eng., vol. 194, no. 36-38, pp. 3902-3933, 2005. (Pubitemid 40815237)
66. K. S. Lee and Z. W. Geem, "A new structural optimization method based on the harmony search algorithm," Comput. Struct., vol. 82, no. 9-10, pp. 781-798, 2004.
67. T. Arani and J. A. Lofti, "A three phased approach to final exam scheduling," IIE Trans., vol. 21, no. 4, pp. 86-96, 1989.
68. M. W. Carter, G. Laporte, and S. Y. Lee, "Examination timetabling: Algorithmic strategies and applications," J. Operat. Res. Soc., vol. 74, pp. 373-383, 1996. (Pubitemid 126576128)
69. A. Gaw, P. Rattadilok, and R. S. Kwan, "Distributed choice function hyperheuristics for timetabling and scheduling," in Practice and Theory of Automated Timetabling V (Lecture Notes in Computer Science vol. 3616), E. K. Burke and M. Trick, Eds. Berlin, Germany: Springer-Verlag, 2005, pp. 51-67.
70. S. Abdullah, K. Shaker, B. McCollum, and P. McMullan, "Construction of course timetables based on great deluge and tabu search," presented at the Metaheuristics Int. Conf., VIII Meteheuristic, pp. 13-16, Hamburg, Jul. 2009.
71. A. Abuhamdah and M. Ayob, "Experimental result of particle collision algorithm for solving course timetabling problems," Int. J. Comput. Sci. Network Security, vol. 9, no. 9, pp. 134-142, 2009.
72. A. Abuhamdah, "Experimental result of late acceptance randomized descent algorithm for solving course timetabling problems," Int. J. Comput. Sci. Netw. Security, vol. 10, no. 1, pp. 192-200, 2010.
73. W. S. Jang, H. I. Kang, and B. H. Lee, "Hybrid simplex-harmony search method for optimization problems," in Proc. IEEE Congr. Evol. Comput., Hong Kong, Jun. 1-6, 2008, pp. 4157-4164.
74. S. N. Jat and S.Yang, "A guided search genetic algorithm for the university course timetabling problem," in Proc. 4th Multidiscipl. Conf. Schedul.: Theory Appl., Dublin, Ireland, Aug. 10-12, 2009, pp. 180-191.
75. J. Kennedy and R. Eberhart, "Particle swarm optimization," in Proc. IEEE Int. Conf. Neural Netw., 1995, pp. 1942-1948.
76. Z. W. Geem and K.-B. Sim, "Parameter-setting-free harmony search algorithm," Appl. Math. Comput., vol. 217, no. 8, pp. 3881-3889, 2010.
77. O. Hasançebi, F. Erdal, andM. P. Saka, "Adaptive harmony search method for structural optimization," ASCE J. Struct. Eng., vol. 136, no. 4, pp. 419-431, 2010.