Particle Swarm Inspired Timetabling for ICT Courses

Abstract:

University course timetabling is a complex problem which must satisfy a list of constraints in order to allocate the right timeslots and venues for various courses. The challenge is to make the NP-hard problem user-friendly, highly interactive and faster run time complexity of algorithm. The objective of the paper is to propose Particle Swarm Optimization (PSO) timetabling model for Undergraduate Information and Communication Technology (ICT) courses. The PSO model satisfies hard constraints with minimal violation of soft constraints. Empirical results show that the rds: NP hard problem, timetabling, particle swarm optimization

• Periodical: Applied Mechanics and Materials (Volumes 263-266)
• Pages: 2138-2145
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.263-266.2138
• Online since: December 2012
• Authors: Oi Mean Foong, Syamilla Bt Rahim
• Keywords: NP-Hard, Particle Swarm Optimization (PSO), Timetabling

References

[1] Dorigo, M., Blum, C. (2005) Ant Colony Optimization Theory: A Survey, in Theoretical Comp. Sci., pp.243-278 .

DOI: 10.1016/j.tcs.2005.05.020

[2] Arvind, S., Chockalingam R., Kavitha S. (2010) A Hybrid Genetic Algorithm Approach to a Departmental Class Timetabling Problem Using Efficient Data Structures : International Journal of Computer Application, Vol 1- No.17.

DOI: 10.5120/352-533

[3] Liebchen, C., Schachtebeck, M., Schobel, A., Stiller, S.Prigge A. (2010) Computing delay resistant railway timetables. Computers and Operations Research 37 (5) pp.857-868.

DOI: 10.1016/j.cor.2009.03.022

[4] Kanoh, H., Sakamoto, Y. (2008) Knowledge-based genetic algorithms for university course timetabling problems. International Journal of Knowledge- based and Intelligent Engineering Sustems. Vol 12, issue 4, pp.283-294.

DOI: 10.3233/kes-2008-12403

[5] Sheau Fen Ho, I., Safaai, D., Siti Zaiton, M.H (2009) A study on PSO based University Course Timetabling Problem. Proceedings- International Conference on Advanced Computer Control, IACC 2009, art. No 4777422, pp.648-651.

DOI: 10.1109/icacc.2009.112

[6] Patrick, DC., Peter, D., Greet, V.B. (nd) Evaluation of the University Course Timetabling Problem with the Linear Numbering Methods.

[7] Edmund, B., David, E., Rupert, W. (nd) A genetic algorithm based University Timetabling System.

[8] Sheau Fen Ho, I., Safaai, D., Siti Zaiton, M.H (2009) Incorporating of Constraint based Reasoning into Particle Swarm Optimization for University Course Timetabling Problem. Computer Science Letter, Vol. 1 (1), pp.1-21.

[9] Geem, Z.W., Hwangbo, H. (2006) Application of Harmony Search to Multi- Objective Optimization for Satellite Heat Pipe Design. Proceedings of 2006 US-Korea Conference on Science, Technology & Entrepreneurship.

[10] Li, H.,Q., Li, L. (2007) A novel Hybrid Particle Swarm Optimization Algorithm Combined with Harmony Search for High Dimensional Optimization Problems. Proceedings the 2007 International Conference on Intelligent Pervasive Computing IPC 2007, art. no. 4438402, pp.94-97.

DOI: 10.1109/ipc.2007.22

[11] Li, L., Yu, G., Chu, X., Lu, S. (2009) The Harmony Search Algorithm in Combination with Particle Swarm Optimization and its Application in the Slope Stability Analysis. Proceeding International Conference on Computational Intelligence and Security2, art.no. 5375977, pp.133-136.

DOI: 10.1109/cis.2009.205

[12] Elbetagi, E., Hegazy, T., Grierson, D. (2005) Comparison among five evolutionary-based optimization algorithms, in Advanced Egineering Informatics, pp.43-53.

DOI: 10.1016/j.aei.2005.01.004

[13] Vassilios, V., Georgios, D. (2009) Nature inspired intelligence: A review of selected methods and applications. International Journal on Artificial Intelligence Tools vol. 18, no. 4, pp.487-516.

DOI: 10.1142/s021821300900024x