Finding feasible timetables with particle swarm optimization

Innovations'07: 4th International Conference on Innovations in Information Technology, IIT

Volumn , Issue , 2007, Pages 387-391

  Qarouni Fard, Danial ^a   Najafi Ardabifi, Amir ^a   Moeinzadeh, M Hossein ^b   Sharifian R, Sarah ^a   Asgarian, Ehsan ^c   Mohammadzadeh, Javad ^b  

^a FERDOWSI UNIVERSITY OF MASHHAD   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

^c SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Particle swarm optimization (PSO); Soft computing; Timetable; University Course Timetabling Problem (UCTP)

Indexed keywords

SCHEDULING; SOFT COMPUTING; STOCHASTIC SYSTEMS;

ENGINEERING APPLICATIONS; FEASIBLE TIMETABLES; GRAPH COLORINGS; PARTICLE SWARM OPTIMIZATION ALGORITHM; SOCIAL BEHAVIOR; TIMETABLE; TIMETABLING PROBLEM; UNIVERSITY COURSE TIMETABLING-PROBLEMS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 50249154251     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IIT.2007.4430422     Document Type: Conference Paper

References (20)

1. O. Rossi-Doria, M. Samples, M. Birattari, M. Chiarandini, J. Knowles, M. Manfrin, M. Mastrolilli, L. Paquete, B. Paechter, and T. Stuitzle, "A comparison of the performance of different metaheuristics on the timetabling problem," in Practice and Theory of Automated Timetabling (PATAT) IV, ser. Lecture Notes in Computer Science, E. Burke and P. de Causmaecker, Eds. Berlin, Germany: Springer-Verlag, 2003, vol. 2740, pp. 329-351.
2. P. Kostuch, "The university course timetabling problem with a 3-phase approach," in Practice and Theory of Automated Timetabling (PATAT)V, ser. Lecture Notes in Computer Science, E. Burke and M. Trick, Eds. Berlin, Germany: Springer-Verlag, 2004, vol. 3616, pp. 109-125.
3. B. Paechter. [Online]. Available: http://www.idsia.ch/Files/ttcomp2002/, Jun. 2005.
4. B. Paechter et. al, "Finding Feasible Timetables Using Group-Based Operators" EEE Transactions on Evolutionary Computation, June 2007 Issue 3, pp. 397-413.
5. J. Kennedy et. al, "Swarm Intelligence", Academic Press, 2001.
6. E. Falkenauer, "Genetic Algorithms and Grouping Problems", New York: Wiley, 1998.
7. Application of the Grouping Genetic Algorithms to the Timetabling Problem, ser. Lecture Notes in Computer Science, Evolutionary Computation in Combinatorial Optimization, vol. 3448/2005, pp. 144-153.
8. T. Muller, R. Bartak, "Interactive Timetabling: Concepts, Techniques, and Practical Results" in PATAT 2002: Proceedings of the 4th international conference on the Practice and Theory of Automated Timetabling, pp. 58-72.
9. D. Corne, P. Ross, and H. Fang, "Evolving timetables," in Practical Handbook of Genetic Algorithms, L. C. Chambers, Ed. Boca Raton, FL: CRC Press, 1995, vol. 1, pp. 219-276.
10. D. Abramson, "Constructing school timetables using simulated annealing: Sequential and parallel algorithms," Manage. Sci., vol. 37, pp. 98-113, 1991
11. A. Schaerf, "Tabu search techniques for large highschool timetabling problems," in Proc. 13th Nat. Conf. Artif. Intell., Portland, OR, 1996, pp. 363-368.
12. B. Paechter, R. Rankin, A. Cumming, and T. Fogarty, "Timetabling the classes of an entire university with an evolutionary algorithm," in Lecture Notes in Computer Science,T. Baeck, A. Eiben,M.Schoenauer, and H. Schwefel, Eds. Berlin, Germany: Springer-Verlag, 1998, vol. 1498, Parallel Problem Solving from Nature (PPSN) V, pp.865-874.
13. E. Burke, D. Elliman, and R. Weare, L. Eshelman, Ed., "A hybrid genetic algorithm for highly constrained timetabling problems," in Proc. 6th Int. Conf. Genetic Algorithms, San Francisco, CA, 1995, pp.605-610.
14. K. Socha and M. Samples, "Ant algorithms for the university course timetabling problem with regard to the state-of-the-art," in Evolutionary Computation in Combinatorial Optimization (EVOCop) III, ser. Lecture Notes in Computer Science, M. Dorigo, G. Di Caro, and M. Sampels, Eds. Berlin, Germany: Springer-Verlag, 2003, vol.2611, pp. 334-345.
15. R. Lewis and B. Paechter, "New crossover operators for timetabling with evolutionary algorithms," in Proc. 5th Int. Conf. Recent Advances in Soft Comput., A. Lotfi, Ed., Nottingham, U.K., 2004, pp. 189-195.
16. H. Arntzen and A. Løkketangen, "A tabu search heuristic for a university timetabling problem," in Metaheuristics: Progress as Real Problem Solvers, ser. Computer Science Interfaces, T. Ikabaki, K. Nonobe, and M. Yagiura, Eds. Berlin, Germany: Springer-Verlag, 2005, vol. 32, pp. 65-86.
17. E. Burke, Y. Bykov, J. Newall, and S. Petrovic, "Time-predefined approach to course timetabling," Yugoslav J. Oper. Res., vol. 13, no. 2, pp. 139-151, 2003.
18. E. Falkenauer, "A Hybrid Grouping Genetic Algorithm for Bin Packing" in Journal of Heuristics vol. 2, Number 1, pp. 5-30, June 1996.
19. E. Erben, "A grouping genetic algorithm for graph coloring and exam timetabling," in Practice and Theory of Automated Timetabling (PATAT) III, ser. Lecture Notes in Computer Science, E. Burke and W. Erben, Eds. Berlin, Germany: Springer-Verlag, 2000, vol. 2079, pp. 132-158.
20. [Online]. Available: http://www.particleswarm.info/.