Abstract
Ant System algorithms are nature-inspired population-based metaheuristics derived from the field of swarm intelligence. Seemingly, the ant system has a lack of search diversity control since it has only a global pheromone update that intensifies the search. Hence, one or more assistant mechanisms are required to strengthen the search of the ant system. Therefore, we propose, in this study, an elitist-ant system to strike a balance between search diversity and intensification while maintaining the quality of solutions. This process is achieved by employing two diversification and intensification mechanisms to assist both pheromone evaporation and elite pheromone updating, in order to gain a good control over the search exploration and exploitation. The diversification mechanism is employed to avoid early convergence, whilst the intensification mechanism is employed to exploore the neighbors of a solution more effectively. In this paper, we test our algorithm on post-enrolment course timetabling problem. Experimental results show that our algorithm produces good quality solutions and outperforms some results reported in the literature (with regards to Socha’s instances) including other ant system algorithms. Therefore, we can conclude that our elitist-ant system has performed an efficient problem’s specific knowledge exploitation, and an effective guided search exploration to obtain better quality solutions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdullah, S., Burke, E.K., McCollum, B.: Using a randomised iterative improvement algorithm with composite neighbourhood structures for university course timetabling. In: Metaheuristics: Progress in complex systems optimization. Operations Research/Computer Science Interfaces Series, vol. ch. 8, Springer, Heidelberg (2007a)
Abdullah, S., Burke, E.K., McCollum, B.: A hybrid evolutionary approach to the university course timetabling problem. In: IEEE Congres on Evolutionary Computation, Singapore, September 25-28, pp. 1764–1768 (2007b) ISBN: 1-4244-1340-0
Abdullah, S., Turabeih, H., McCollum, B.: Electromagnetism-like mechanism with force decay rate great deluge for CTP. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds.) RSKT 2009. LNCS, vol. 5589, pp. 497–504. Springer, Heidelberg (2009)
Alvarez-Valdes, R., Crespo, E., Tamarit, J.M.: Design and implementation of a course scheduling system using Tabu Search. The Proceedings of the Production, Manufactoring and Logistics: European Journal of Operational Research 137(2002), 512–523 (2002)
Bernardino, A.M., Bernardino, E.M., Sanchez-Perez, J.M., Gomez-Pulido, J.A., Vega-Rodriguez, M.A.: A Hybrid Ant Colony Optimization Algorithm for Solving the Ring Arc-Loading Problem. In: Konstantopoulos, S., Perantonis, S., Karkaletsis, V., Spyropoulos, C.D., Vouros, G. (eds.) SETN 2010. LNCS (LNAI), vol. 6040, pp. 49–59. Springer, Heidelberg (2010)
Blum, C., Roli, A.: Hybrid Metaheuristics: An Introduction, Studies in Computational Intelligence. In: C. Blum, M.J.B. Aguilera, A. Roli, M. Samples (Eds.), Hybrid Metaheuristics: An Emerging Approach to Optimization, SCI, vol. 114, Springer-Verlag Berlin, Heidelberg, pp. 1-30, (2008)
Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: An autocatalytic optimization process, Technical Report 91-016 revised, Dipartimento di Elettronica e Informazione, Policecnico di Milano, Italy (1991)
Ejaz, N., Javed, M.: An Approach for Course Scheduling Inspired by Die-Hard Co-Operative Ant Behavior. In: Proceedings of the IEEE International Conference on Automation and Logistics, Jinan, China, August 18 - 21 (2007)
Eley, M.: Ant Algorithms for the Exam Timetabling Problem. In: Burke, E.D., Rudova, H. (eds.) PATAT 2007. LNCS, vol. 3867, pp. 364–382. Springer, Heidelberg (2007)
Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multi commodity Flow Problem. SIAM J. Comput. 5, 691–703 (1976)
Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant Colonies for the quadratic assignment problem. Journal of the Operational Research Society 50, 167–176 (1999)
Mayer, A., Nothegger, C., Chawatal, A., Raidl, G.: Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization. In: The Proceeding of the 7thInternational Conference on the Practice and Theory of Automated Timetabling (PATAT 2008), Montreal, Canada (2008)
Montgomery, J., Randall, M.: The accumulated experience ant colony for the travelling salesman problem. International Journal of Computational Intelligence and Applications 3(2), 189–198 (2003)
Petrovic, S., Burke, E.K.: University timetabling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, ch. 45, CRC Press, Boca Raton (2004)
Qu, R., Burke, E.D., McCollum, B.: Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring. Discrete Optimization, European Journal of Operational Research 198, 392–404 (2009)
Rossi-Doria, O., Samples, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, L.M., Knowels, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., Stultzle, T.: A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 329–354. Springer, Heidelberg (2003)
Socha, K., Knowles, J., Samples, M.: A max-min ant system for the university course timetabling problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 1–13. Springer, Heidelberg (2002)
Socha, K., Samples, M., Manfrin, M.: Ant algorithms for the university course timetabling problem with regard to the state-of-the-art. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 334–345. Springer, Heidelberg (2003)
Socha, K.: The Influence of Run-Time Limits on Choosing Ant System Parameters. In: Cantu-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 49–60. Springer, Heidelberg (2003)
Yang, S., Jat, S.N.: Genetic Algorithms with Guided and Local Search Strategies for University Course Timetabling. IEEE Transactions on Systems, Man, and Cybernetics—Part C: Applications and Reviews, 1–14 (2010), doi:10.1109/TSMCC.2010.2049200
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jaradat, G.M., Ayob, M. (2010). An Elitist-Ant System for Solving the Post-Enrolment Course Timetabling Problem. In: Zhang, Y., Cuzzocrea, A., Ma, J., Chung, Ki., Arslan, T., Song, X. (eds) Database Theory and Application, Bio-Science and Bio-Technology. BSBT DTA 2010 2010. Communications in Computer and Information Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17622-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-17622-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17621-0
Online ISBN: 978-3-642-17622-7
eBook Packages: Computer ScienceComputer Science (R0)