Ant System Algorithm with Negative Pheromone for Course Scheduling Problem

This paper presents a proposed ant system algorithm that incorporates negative pheromone to solve the course scheduling problem. The performance of the proposed algorithm is tested with a case study data on course scheduling. Comparisons of results were performed with ant system algorithm that does not incorporate the negative pheromone.

[1]  Mike Holcombe,et al.  Insect communication: ‘No entry’ signal in ant foraging , 2005, Nature.

[2]  Geoffrey C. Fox,et al.  A Comparison of Annealing Techniques for Academic Course Scheduling , 1997, PATAT.

[3]  T. Wyatt.  Pheromones and Animal Behaviour: Communication by Smell and Taste , 2003 .

[4]  Michael Sampels,et al.  A MAX-MIN Ant System for the University Course Timetabling Problem , 2002, Ant Algorithms.

[5]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[6]  Calvin C. Gotlieb,et al.  Tests on a computer method for constructing school timetables , 1964, CACM.

[7]  Michael Sampels,et al.  A {$\cal MAX$}-{$\cal MIN$} Ant System for the University Course Timetabling Problem , 2002 .

[8]  An expert systems based methodology for solving resource allocation problems , 1990, IEA/AIE '90.

[9]  Tuan-Anh Duong,et al.  Combining Constraint Programming and Simulated Annealing on University Exam Timetabling , 2004, RIVF.

[10]  Jason G. Digalakis,et al.  A Parallel Memetic Algorithm for Solving Optimization Problems , 2001 .

[11]  Atish Chand.  A Heuristic Approach to Constraint Optimization in Timetabling , 2002 .

[12]  Anthony Wren,et al.  Scheduling, Timetabling and Rostering - A Special Relationship? , 1995, PATAT.

[13]  Victor A. Bardadym.  Computer-Aided School and University Timetabling: The New Wave , 1995, PATAT.

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

[15]  Klaus U. Schulz,et al.  Models and Algorithms for School Timetabling - A Constraint-Programming Approach , 2003 .