Ant colony optimization for the examination scheduling problem

Journal of the Operational Research Society

Volumn 56, Issue 4, 2005, Pages 426-438

  Dowsland, K A ^a   Thompson, J M ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

Ant algorithms; Evolutionary algorithms; Examination timetabling; Graph colouring

Indexed keywords

CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; TRAVELING SALESMAN PROBLEM;

ANT ALGORITHMS; ANT COLONY OPTIMIZATION; EXAMINATION TIMETABLING; GRAPH COLORING;

EVOLUTIONARY ALGORITHMS;

EID: 15844419376     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601830     Document Type: Article

References (29)

1. Colorni A, Dorigo M and Maniezzo V (1991). Distributed optimization by ant colonies. In: Varela FJ and Bourgine P (eds) Proceedings of the First European Conference on Artificial Life, Paris, MIT Press/Bradford Books, Cambridge, MA, pp 134-142.
2. Costa D and Hertz A (1997). Ants can colour graphs. J Opl Res Soc 48: 295-305.
3. Costa D, Hertz A and Dubuis O (1995). Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs. J Heuristics 1: 105-128.
4. Vesel A and Žerovnik J (2000). How well can ants color graphs? J Comput Inf Technol - CIT 8: 131-136.
5. Petford AD and Welsh DJA (1989). A randomised 3-colouring algorithm. Discrete Math 74: 253-261.
6. Carter MW (1986). A survey of practical applications of examination timetabling algorithms. Opns Res 34: 193-202.
7. Ross P, Hart E and Corne D (1998). Some observations about GA based exam timetabling. In: Burke E and Carter M (eds). Practice and Theory of Automated Timetabling II - Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin, pp 115-129.
8. Carter MW, Laporte G and Lee SY (1996). Examination timetabling: algorithmic strategies and applications. J Opl Res Soc 47: 373-383.
9. Balakrishnan N (1991). Examination scheduling - a computerised application. OMEGA 19: 37-41.
10. Dorigo M, Maniezzo V and Colorni A (1991). Positive feedback as a search strategy. Technical Report 91-016, Dipartimento di Elettronica e Informazione, Policecnico di Milano, Italy.
11. Dorigo M, Maniezzo V and Colorni A (1996). The ant system: optimization by a colony of co-operating agents. IEEE Trans Systems Man Cybernetics - Part B 26: 29-41.
12. Dorigo M (1992). Ottimazzazione, apprendimento automatico, ed algoritmi basati su metafora naturale (Optimisation, learning and natural algorithms). Doctoral dissertation, Dipartimento di Elettronica e Informazione, Policecnico di Milano, Italy.
13. Gambardella LM, Taillard ED and Dorigo M (1999). Ant colonies for the quadratic assignment problem. J Opl Res Soc 50: 167-176.
14. Gambardella LM and Dorigo M (1996). Solving symmetric and asymmetric TSP's by ant colonies In: Proceedings of the IEEE Conference on Evolutionary Computation (ICEC'96). IEEE Press, New York, pp 622-627.
15. Colorni A, Dorigo M, Maniezzo V and Trubian M (1994). Ant system for Job-shop Scheduling. JORBEL - Belgian J Opns Res, Statist Comput Sci 34: 39-53.
16. Comellas F and Ozón J (1998). An ant algorithm for the graph colouring problem. Presented at Ants 98 From Ant Colonies to Artificial Ants: First International Workshop on Ant Colony Optimization - Brussels, Belgium.
17. Fenet S and Solnon C (2003). Searching for maximum cliques with ant colony optimisation. In: Raidl G et al (eds). Applications of Evolutionary Computing - Lecture Notes in Computer Science, Vol. 2611. Springer-Verlag, Berlin, pp 236-245.
18. Montemanni R, Smith DH and Allen SM (2002). An ants algorithm for the minimum-span frequency-assignment problem with multiple interference. IEEE Trans Vehicular Technol 51: 949-953.
19. Socha K, Sampels M and Manfrin M (2003). Ant algorithms for the university course timetabling problem with regard to the state of the art. In: Raidl G et al (eds). Applications of Evolutionary Computing - Lecture Notes in Computer Science, Vol. 2611. Springer-Verlag, Berlin, pp 334-345.
20. Levine J and Ducatelle F (2004). Ant colony optimisation and local search for bin packing and cutting stock problems. J Opl Res Soc 55: 705-716.
21. Caramia M, Dell'Olmo P and Italiano GF (2001). New algorithms for examination timetabling. In: Näher S and Wagner D (eds). Algorithm Engineering 4 - Lecture Notes in Computer Science, Vol. 1982. Springer-Verlag, Berlin, pp 230-241.
22. Merlot L, Boland N, Hughes B and Stuckey PJ (2003). A hybrid algorithm for the examination timetabling problem. In: Burke E and De Causemacker P (eds). Practice and Theory of Automated Timetabling IV - Lecture Notes in Computer Science, Vol. 2740. Springer-Verlag, Berlin, pp 207-231.
23. Burke EK, Newall J and Weare RF (1996). A memetic algorithm for university exam timetabling. In: Burke E and Ross P (eds). Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin, pp 241-250.
24. Thompson JM and Dowsland KA (1998). A robust simulated annealing based examination timetabling system. Comput Ops Res 25: 637-648.
25. Di Gaspero L and Schaerf A (2000). Tabu search techniques for examination timetabling. In: Burke E and Erben W (eds). Practice and Theory of Automated Timetabling III, Lecture Notes in Computer Science, Vol. 2079. Springer-Verlag, Berlin pp 104-117.
26. Casey S and Thompson JM (2003). GRASPing the examination scheduling problem. In: Burke E and De Causemacker P (eds). Practice and Theory of Automated Timetabling IV - Lecture Notes in Computer Science, Vol. 2740. Springer-Verlag, Berlin, pp 232-244.
27. Thompson JM and Dowsland KA (1996). Variants of simulated annealing for the examination timetabling problem. Ann Opns Res 63: 105-128.
28. Bullnheimer B, Hartl RF and Strauss C (1999). Applying the ant system to the vehicle routing problem. In: Voss S, Martello S, Osman IH and Roucairol C (eds). Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Dordrecht, pp 285-296.
29. Stützte T and Hoos H (1999). MAX-MIN ant system and local search for combinatorial optimisation problems. In: Voss S, Martello S, Osman IH and Roucairol C (eds). Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Dordrecht, pp 313-329.