Abstract
The most common approach to multiobjective examination timetabling is the weighted sum aggregation of all criteria into one cost function and application of some single-objective metaheuristic. However, the translation of user preferences into the weights of criteria is a sophisticated task, which requires experience on the part of the user, especially for problems with a high number of criteria. Moreover, the results produced by this technique are usually substantially scattered. Thus, the outcome of weighted sum algorithms is often far from user expectation.
In this paper we suggest a more transparent method, which enables easier expression of user preferences. This method requires the user to specify a reference solution, which can be either produced manually or chosen among the set of solutions, generated by any automated method. Our aim is to improve the values of the reference objectives, i.e. to produce a solution which dominates the reference one. In order to achieve this, a trajectory is drawn from the origin to the reference point and a Great Deluge local search is conducted through the specified trajectory. During the search the weights of the criteria are dynamically changed.
The proposed technique was experimentally tested on real-world exam timetabling problems on both bi-criteria and nine-criteria cases. All results obtained by the variable weights Great Deluge algorithm outperformed the ones published in the literature by all criteria.
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.
References
Boufflet, J.P., Negre, S.: Three Methods Used to Solve an Examination Timetabling Problem. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 327–344. Springer, Heidelberg (1996)
Burke, E.K., Elliman, D.G., Ford, P.H., Weare, R.F.: Examination Timetabling in British Universities: a Survey. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 76–90. Springer, Heidelberg (1996)
Burke, E.K., Jackson, K., Kingston, J.H., Weare, R.: Automated University Timetabling: The State of the Art. Comput. J. 40, 565–571 (1997)
Burke, E.K., Newall, J.P.: A Multi-stage Evolutionary Algorithm for the Timetabling Problem. IEEE Trans. Evolut. Comput. 3, 63–74 (1999)
Burke, E.K., Bykov, Y., Petrovic, S.: A Multicriteria Approach to Examination Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 118–131. Springer, Heidelberg (2001)
Burke, E.K., Bykov, Y., Newall, J.P., Petrovic, S.: A Time-Predefined Local Search Approach to Exam Timetabling Problems. Computer Science Technical Report NOTTCS-TR-2001-6, University of Nottingham (2001)
Burke, E.K., Bykov, Y., Newall, J.P., Petrovic, S.: A New Local Search Approach with Execution Time as an Input Parameter. Computer Science Technical Report NOTTCS-TR-2002-3, University of Nottingham (2002)
Carter, M.W., Laporte, G.: Recent Developments in Practical Examination Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 3–21. Springer, Heidelberg (1996)
Carrasco, M.P., Pato, M.V.: A Multiobjective Genetic Algorithm for the Class/Teacher Timetabling Problem. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 3–17. Springer, Heidelberg (2001)
Corne, D., Ross, P., Fang, H.L.: Fast Practical Evolutionary Timetabling. In: Fogarty, T.C. (ed.) AISB-WS 1994. LNCS, vol. 865, pp. 250–263. Springer, Heidelberg (1994)
Dueck, G.: New Optimization Heuristics. The Great Deluge Algorithm and the Record-to-Record Travel. J. Comput. Phys. 104, 86–92 (1993)
Lotfi, V., Cerveny, R.: A Final-Exam Scheduling Package. J. Oper. Res. Soc. 42, 205–216 (1991)
Paechter, B., Rankin, R.C., Cumming, A., Fogarty, T.C.: Timetabling the Classes of an Entire University with an Evolutionary Algorithm. In: Parallel Problem Solving from Nature (PPSNV). Springer, Heidelberg (1998)
Thompson, J.M., Dowsland, K.A.: Multi-Objective University Examination Scheduling. EBMS/1993/12, European Business Management School, University of Wales, Swansea (1993)
Thompson, J.M., Dowsland, K.A.: Variants of Simulated Annealing for the Examination Timetabling Problem. Ann. Oper. Res. 63, 105–128 (1996)
Thompson, J.M., Dowsland, K.A.: A Robust Simulated Annealing Based Examination Timetabling System. Comput. Oper. Res. 25, 637–648 (1998)
Tanaka, M., Adachi, S.: Request-Based Timetabling by Genetic Algorithm with Tabu Search. In: 3rd Int. Workshop Frontiers Evolut. Algorithms, pp. 999–1002 (2000)
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
Petrovic, S., Bykov, Y. (2003). A Multiobjective Optimisation Technique for Exam Timetabling Based on Trajectories. 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_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-45157-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40699-0
Online ISBN: 978-3-540-45157-0
eBook Packages: Springer Book Archive