A comparison of the performance of different metaheuristics on the timetabling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2740, Issue , 2003, Pages 329-351

  Rossi Doria, Olivia ^a   Sampels, Michael ^b   Birattari, Mauro ^c   Chiarandini, Marco ^c   Dorigo, Marco ^b   Gambardella, Luca M ^d   Knowles, Joshua ^b   Manfrin, Max ^b   Mastrolilli, Monaldo ^d   Paechter, Ben ^a   Paquete, Luis ^c   Stützle, Thomas ^c  

^a EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^d DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; HEURISTIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); OPTIMIZATION; SIMULATED ANNEALING; TABU SEARCH;

INSTANCE GENERATOR; ITERATED LOCAL SEARCH; META HEURISTICS; METAHEURISTIC; NEIGHBOURHOOD; SOLUTION REPRESENTATION; TIMETABLING PROBLEM; UNIVERSITY COURSE TIMETABLING-PROBLEMS;

SCHEDULING;

EID: 35248822799     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45157-0_22     Document Type: Review

References (23)

1. Aarts, E.H.L., Lenstra J.K. (Eds.): Local Search in Combinatorial Optimization. Wiley, Chichester (1997)
2. Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A Racing Algorithm for Configuring Metaheuristics. Technical Report, Intellektik, Technische Universität Darmstadt, Germany (2002)
3. Baeck, T., Fogel, D., Michalewicz Z.: Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, Bristol (2000)
4. Bonabeau, E., Dorigo, M., Theraulaz, G.: From Natural to Artificial Swarm Intelligence. Oxford University Press, Oxford (1999)
5. Burke, E, Carter, M. (Eds.): Practice and Theory of Automated Timetabling II (PATAT 1997, Toronto, Canada, August, selected papers). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998)
6. Carter, M.W., Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E, Carter, M. (Eds.): Practice and Theory of Automated Timetabling II (PATAT 1997, Toronto, Canada, August, selected papers). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 3-19
7. Cerný, V.: A Thermodynamical Approach to the Traveling Salesman Problem. J. Optim. Theory Appl. 45 (1985) 41-51
8. Chiarandini, M., Stützle, T.: Experimental Evaluation of Course Timetabling Algorithms. Technical Report, FG Intellektik, TU Darmstadt (2002)
9. Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans. Evolut. Comput. 1 (1997) 53-66
10. Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Trans. Syst. Man Cybern. 26 (1996) 29-41
11. Glover, F., Laguna, M.: Tabu Search. Kluwer, Boston, MA (1998)
12. Johnson, D.S., McGeoch, L.A.: The Traveling Salesman Problem: A Case Study in Local Optimization. In: Aarts, E.H.L., Lenstra, J.K. (Eds): Local Search in Combinatorial Optimization. Wiley, New York (1997) 215-310
13. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by Simulated Annealing: an Experimental Evaluation I: Graph Partitioning. Oper. Res. 37 (1989) 865-892
14. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220 (1983) 671-680
15. Lourenço, H.R., Martin, O., Stützle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (Eds): Handbook of Metaheuristics. Int. Series in Oper. Res. Management, Vol. 57. Kluwer, Dordrecht (2002) 321-353
16. Martin, O., Otto, S.W.: Partitioning of Unstructured Meshes for Load Balancing. Concurrency: Pract. Exper. 7 (1995) 303-314
17. Paechter, B., Rankin, R.C., Cumming, A., Fogarty, T.C.: Timetabling the Classes of an Entire University with an Evolutionary Algorithm. Parallel Problem Solving from Nature (PPSN). Lecture Notes in Computer Science, Vol. 1498. Springer-Verlag, Berlin Heidelberg New York (1998) 865-874
18. Paquete, L., Stützle, T.: Experimental Investigation of Iterated Local Search for Coloring Graphs. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.(Eds): Applications of Evolutionary Computing (Proc. EvoWorkshops 2002). Lecture Notes in Computer Science, Vol. 2279. Springer-Verlag, Berlin Heidelberg New York (2002) 122-131
19. Ross, P., Corne, D., Fang, H.: Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation. In: Schwefel, H.P., Davidor, Y., Manner, R. (Eds.): Parallel Problem Solving from Nature (PPSN) III. Lecture Notes in Computer Science, Vol. 866. Springer-Verlag, Berlin Heidelberg New York (1994) 560-565
20. Rossi-Doria, O., Blum, C., Knowles, J., Sampels, M., Socha, K., Paechter, B.: A Local Search for the Timetabling Problem. In: Proc. 4th Int. Conf. Pract. Theory Automated Timetabling (PATAT 2002), Gent, Belgium, 124-127
21. Schaerf, A.: A Survey of Automated Timetabling. Artif. Intell. Rev. 13 (1999) 87-127
22. Stützle, T.: Local search Algorithms for Combinatorial Problems - Analysis, Improvements, and New Applications. Ph.D. Thesis, TU Darmstadt, Germany (1998)
23. http://www.idsia.ch/Files/ttcomp2002