Future Generation Computer Systems
A Memetic Algorithm for University Exam Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A MAX-MIN Ant System for the University Course Timetabling Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Ant algorithms for the university course timetabling problem with regard to the state-of-the-art
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An ant colony algorithm for multi-user detection in wireless communication systems
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
An effective hybrid algorithm for university course timetabling
Journal of Scheduling
Pheromone-distribution-based adaptive ant colony system
Proceedings of the 12th annual conference on Genetic and evolutionary computation
On MAX - MIN ant system's parameters
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
On the performance of Scatter Search for post-enrolment course timetabling problems
Journal of Combinatorial Optimization
Hi-index | 0.00 |
The influence of the allowed running time on the choice of the parameters of an ant system is investigated. It is shown that different parameter values appear to be optimal depending on the algorithm run-time. The performance of the MAX-MIN Ant System (MMAS) on the University Course Timetabling Problem (UCTP) - a type of constraint satisfaction problem - is used as an example. The parameters taken into consideration include the type of the local search used, and some typical parameters for MMAS - the τmin and ρ. It is shown that the optimal parameters depend significantly on the time limits set. Conclusions summarizing the influence of time limits on parameter choice, and possible methods of making the parameter choice more independent from the time limits, are presented.