Abstract
The main goal of this paper is to attempt an unbiased comparison of the performance of straightforward implementations of five different metaheuristics on a university course timetabling problem. In particular, the metaheuristics under consideration are Evolutionary Algorithms, Ant Colony Optimization, Iterated Local Search, Simulated Annealing, and Tabu Search. To attempt fairness, the implementations of all the algorithms use a common solution representation, and a common neighbourhood structure or local search. The results show that no metaheuristic is best on all the timetabling instances considered. Moreover, even when instances are very similar, from the point of view of the instance generator, it is not possible to predict the best metaheuristic, even if some trends appear when focusing on particular instance classes. These results underline the difficulty of finding the best metaheuristics even for very restricted classes of timetabling problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aarts, E.H.L., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. Wiley, Chichester (1997)
Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A Racing Algorithm for Configuring Metaheuristics. Technical Report, Intellektik, Technische Universität Darmstadt, Germany (2002)
Baeck, T., Fogel, D., Michalewicz, Z.: Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, Bristol (2000)
Bonabeau, E., Dorigo, M., Theraulaz, G.: From Natural to Artificial Swarm Intelligence. Oxford University Press, Oxford (1999)
Burke, E.K., Carter, M. (eds.): PATAT 1997. LNCS, vol. 1408. Springer, Heidelberg (1998)
Carter, M.W., Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 3–19. Springer, Heidelberg (1998)
Cerný, V.: A Thermodynamical Approach to the Traveling Salesman Problem. J. Optim. Theory Appl. 45, 41–51 (1985)
Chiarandini, M., Stützle, T.: Experimental Evaluation of Course Timetabling Algorithms. Technical Report, FG Intellektik, TU Darmstadt (2002)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans. Evolut. Comput. 1, 53–66 (1997)
Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Trans. Syst. Man Cybern. 26, 29–41 (1996)
Glover, F., Laguna, M.: Tabu Search. Kluwer, Boston (1998)
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, pp. 215–310. Wiley, New York (1997)
Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by Simulated Annealing: an Experimental Evaluation I: Graph Partitioning. Oper. Res. 37, 865–892 (1989)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)
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, pp. 321–353. Kluwer, Dordrecht (2002)
Martin, O., Otto, S.W.: Partitioning of Unstructured Meshes for Load Balancing. Concurrency: Pract. Exper. 7, 303–314 (1995)
Paechter, B., Rankin, R.C., Cumming, A., Fogarty, T.C.: Timetabling the Classes of an Entire University with an Evolutionary Algorithm. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 865–874. Springer, Heidelberg (1998)
Paquete, L., Stützle, T.: An Experimental Investigation of Iterated Local Search for Coloring Graphs. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol. 2279, pp. 122–131. Springer, Heidelberg (2002)
Ross, P., Corne, D., Fang, H.: Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 560–565. Springer, Heidelberg (1994)
Rossi-Doria, O., Blum, C., Knowles, J., Sampels, M., Socha, K., Paechter, B.: A Local Search for the Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 124–127. Springer, Heidelberg (2003)
Schaerf, A.: A Survey of Automated Timetabling. Artif. Intell. Rev. 13, 87–127 (1999)
Stützle, T.: Local search Algorithms for Combinatorial Problems – Analysis, Improvements, and New Applications. Ph.D. Thesis, TU Darmstadt, Germany (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rossi-Doria, O. et al. (2003). A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. In: Burke, E., De Causmaecker, P. (eds) Practice and Theory of Automated Timetabling IV. PATAT 2002. Lecture Notes in Computer Science, vol 2740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45157-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-45157-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40699-0
Online ISBN: 978-3-540-45157-0
eBook Packages: Springer Book Archive