## Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art (2003)

Venue: | In Proc. Third European Workshop on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2003 |

Citations: | 23 - 4 self |

### BibTeX

@INPROCEEDINGS{Socha03antalgorithms,

author = {Krzysztof Socha and Michael Sampels and Max Manfrin},

title = {Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art},

booktitle = {In Proc. Third European Workshop on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2003},

year = {2003},

pages = {334--345},

publisher = {Springer Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

Two ant algorithms solving a simplified version of a typical university course timetabling problem are presented -- Ant Colony System and MAX-MIN Ant System. The algorithms are tested over a set of instances from three classes of the problem. Results are compared with recent results obtained with several metaheuristics using the same local search routine (or neighborhood definition), and a reference random restart local search algorithm. Further, both ant algorithms are compared on an additional set of instances. Conclusions are drawn about the performance of ant algorithms on timetabling problems in comparison to other metaheuristics. Also the design, implementation, and parameters of ant algorithms solving the university course timetabling problem are discussed. It is shown that the particular implementation of an ant algorithm has significant influence on the observed algorithm performance.

### Citations

906 | Ant system: optimization by a colony of cooperating agents - Dorigo, Maniezzo, et al. - 1996 |

706 | Ant Colony System: A cooperative learning approach to the Traveling Salesman Problem
- Dorigo, Gambardella
- 1997
(Show Context)
Citation Context ... problems, scheduling problems etc. There exist at least two basic variations of the ACO metaheuristic – the MAX -MIN Ant System initially proposed in [7], and the ACS which is described in detail i=-=n [10, 11]-=-. While the basic idea of operation is identical for both of those variations, there are some differences. The main difference lies in the way the pheromone is updated, which we will explain below. Bo... |

360 | Ant algorithms for discrete optimization
- Dorigo, Caro, et al.
- 1999
(Show Context)
Citation Context ...he main difference lies in the way the pheromone is updated, which we will explain below. Both ant algorithms used for solving the UCTP that are presented here, are based on the general ACO framework =-=[10, 12, 7]-=-. They both have been shown to be able to produce meaningful results for UCTP instances. The ACS has been compared with other recent metaheuristics in [6], and MMAS has been shown to significantly out... |

119 |
An introduction to timetabling
- Werra
- 1985
(Show Context)
Citation Context ...imilar properties and are similarly difficult to solve. The general university course timetabling problem is known to be NP-hard, as are many of the subproblems associated with additional constraints =-=[4, 5, 2]-=-. Even when 1 http://www.metaheuristics.orgsrestricting the interest to UCTP alone, it is difficult to provide a uniform and generic definition of the problem. Due to the fact that course organization... |

93 | A hyperheuristic approach to scheduling a sales summit
- Cowling, Kendall, et al.
- 2001
(Show Context)
Citation Context ...zed. There are also other timetabling problems described in the literature that are similar to UCTP. They include examination timetabling [1], school timetabling [2], employee timetabling, and others =-=[3]-=-. They all share similar properties and are similarly difficult to solve. The general university course timetabling problem is known to be NP-hard, as are many of the subproblems associated with addit... |

51 | Tabu search techniques for examination timetabling
- Gaspero, Schaerf
- 2001
(Show Context)
Citation Context ...d a number of additional preferences being satisfied is maximized. There are also other timetabling problems described in the literature that are similar to UCTP. They include examination timetabling =-=[1]-=-, school timetabling [2], employee timetabling, and others [3]. They all share similar properties and are similarly difficult to solve. The general university course timetabling problem is known to be... |

28 | The Complexity of Timetable Construction Problems
- Cooper, Kingston
(Show Context)
Citation Context ...imilar properties and are similarly difficult to solve. The general university course timetabling problem is known to be NP-hard, as are many of the subproblems associated with additional constraints =-=[4, 5, 2]-=-. Even when 1 http://www.metaheuristics.orgsrestricting the interest to UCTP alone, it is difficult to provide a uniform and generic definition of the problem. Due to the fact that course organization... |

27 | T.: A comparison of the performance of different metaheuristics on the timetabling problem
- Rossi-Doria, Sampels, et al.
- 2003
(Show Context)
Citation Context ...roposed for this problem usually concentrate on a particular subproblem. Recently, in the course of the MN, five metaheuristics were evaluated and compared on instances of a certain reduction of UCTP =-=[6]-=-. The metaheuristics evaluated included: Genetic Algorithm (GA), Simulated Annealing (SA), Tabu Search (TA), Iterated Local Search (ILS), and Ant Colony Optimization (ACO). The MAX -MIN Ant System (MM... |

11 | Tabu search techniques for examination timetabling - Gaspero, Schaerf |

9 |
A MAX -MIN ant system for the university timetabling problem
- Socha, Knowles, et al.
- 2002
(Show Context)
Citation Context ...e metaheuristics evaluated included: Genetic Algorithm (GA), Simulated Annealing (SA), Tabu Search (TA), Iterated Local Search (ILS), and Ant Colony Optimization (ACO). The MAX -MIN Ant System (MMAS) =-=[7, 8]-=- algorithm for the UCTP was developed later as an approach alternative to the ACO (ACS in fact) developed for the metaheuristics comparison. The purpose of this paper is to present how ant algorithms ... |

7 |
Some Complexity Aspects of Secondary School Timetabling
- Eikelder, Willemen
- 2001
(Show Context)
Citation Context ... preferences being satisfied is maximized. There are also other timetabling problems described in the literature that are similar to UCTP. They include examination timetabling [1], school timetabling =-=[2]-=-, employee timetabling, and others [3]. They all share similar properties and are similarly difficult to solve. The general university course timetabling problem is known to be NP-hard, as are many of... |

4 | B.: A comparison of the performance of di#erent metaheuristics on the timetabling problem - Rossi-Doria, Sampels, et al. - 2002 |