Best-Worst Ant Colony System Parameter Investigation by Using Experimental Design and Analysis for Course Timetabling Problem

Course timetabling usually arises every academic year and is solved by academic staff with/without course timetabling tool. The desirable timetable must be satisfied by hard constraints whilst soft constraints are not absolutely essential. Course timetabling is known to be NP-hard problem, which means that the computational time required to find the solution increases exponentially with problem size. Automated timetabling system has been developed for university courses scheduling. In this work, new variant of Ant Colony Optimisation called Best-Worst Ant Colony System (BWACS) was applied to solve university course timetabling problem. Advance statistical tools for experimental design and analysis were used to investigate and analyse the factor influence of this system and conclude the appropriate parameter setting of BWACS.

[1]  T. Stützle,et al.  A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends , 2002 .

[2]  Francisco Herrera,et al.  A New ACO Model Integrating Evolutionary Computation Concepts: The Best-Worst Ant System , 2000 .

[3]  Philipp Kostuch,et al.  The University Course Timetabling Problem with a Three-Phase Approach , 2004, PATAT.

[4]  P. Pongcharoen,et al.  Investigation on Cooling Schemes and Parameters of Simulated Annealing for Timetabling University Courses , 2008, 2008 International Conference on Advanced Computer Theory and Engineering.

[5]  John K. Ousterhout,et al.  Tcl and the Tk Toolkit , 1994 .

[6]  Barry McCollum,et al.  The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3) — preliminary presentation — , 2007 .

[7]  Michael Sampels,et al.  Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art , 2003, EvoWorkshops.

[8]  Pupong Pongcharoen,et al.  Improving Artificial Immune System Performance: Inductive Bias and Alternative Mutations , 2008, ICARIS.

[9]  Pupong Pongcharoen,et al.  Stochastic Optimisation Timetabling Tool for university course scheduling , 2008 .

[10]  Efthymios Housos,et al.  An integer programming formulation for a case study in university timetabling , 2004, Eur. J. Oper. Res..

[11]  P. Pongcharoen,et al.  Experimental Design and Analysis on Parameter Investigation and Performance Comparison of Ant Algorithms for Course Timetabling Problem , 2009 .

[12]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[13]  Dominique de Werra,et al.  A generalized class-teacher model for some timetabling problems , 2002, Eur. J. Oper. Res..

[14]  Sanja Petrovic,et al.  A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..

[15]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[16]  Francisco Herrera,et al.  Analysis of the Best-Worst Ant System and Its Variants on the QAP , 2002, Ant Algorithms.

[17]  Christian Hicks,et al.  Applying designed experiments to optimize the performance of genetic algorithms used for scheduling complex products in the capital goods industry , 2001 .

[18]  Pupong Pongcharoen,et al.  The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure , 2004, Eur. J. Oper. Res..

[19]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[20]  Orhan Engin,et al.  Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems , 2009, Comput. Ind. Eng..

[21]  Zahra Naji Azimi,et al.  Hybrid heuristics for Examination Timetabling problem , 2005, Appl. Math. Comput..

[22]  Nagraj Balakrishnan,et al.  Scheduling examinations to reduce second-order conflicts , 1992, Comput. Oper. Res..

[23]  P. Pongcharoena,et al.  Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products , 2002 .