Abstract
The space allocation problem within UK universities is highly constrained, has multiple objectives, varies greatly among different institutions, requires frequent modifications and has a direct impact on the functionality of the university. As in every optimisation problem, the application of different advanced search methodologies such as local search, metaheuristics and evolutionary algorithms provide a promising way forward. In this paper we discuss three well known methods applied to solve the space allocation problem: hill climbing, simulated annealing and a genetic algorithm. Results and a comprehensive comparison between all three techniques are presented using real test data. Although these algorithms have been extensively studied in different problems, our major objective is to investigate the application of these techniques to the variants of the space allocation problem, comparing advantages and disadvantages to achieve a better understanding of the problem and propose future hybridisation of these and additional methods.
JDLS acknowledges support of Universidad Autónoma de Chihuahua and PROMEP, México.
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
Benjamin, C., Ehie, I., Omurtag, Y.: Planning Facilities at the University of Missouri-Rolla. J. Interfaces 22 (1992) 95–105
Baase, S., Computer Algorithms Introduction to Design and Analysis. 2nd edn. Addison-Wesley, Reading, MA (1988)
Bland, J.A.: Space-Planning By Ant Colony Optimisation. Int. J. Comput. Appl. Technol. 12 (1999) 320–328
Burke, E.K., Newall, J.P., Weare, R.F.: A Memetic Algorithm for University Exam Timetabling, Selected Papers from PATAT’95 (Edinburgh). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 241–250
Burke, E.K., Clark, J.A., Smith, A.J.: Four Methods for Maintenance Scheduling. Proc. 3rd Int. Conf. on Artificial Neural Networks and Genetic Algorithms (University of East Anglia, Norwich), Vol. 1. Springer-Verlag, Berlin Heidelberg New York (1997) 264–269
Burke, E.K., Smith, A.J.: A Memetic Algorithm for the Maintenance Scheduling Problem. Proc. ICONIP’97 Conf. (Dunedin, New Zealand) Springer-Verlag, Berlin Heidelberg New York (1997) 469–474
Burke, E.K., Varley, D.B.: Space Allocation: An Analysis of Higher Education Requirements. Selected Papers from PATAT’97 (Toronto, Canada). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 0–33
Burke, E.K., Varley, D.B.: Automating Space Allocation in Higher Education. Proc. 2nd Asia Pacific Conf. on Simulated Evolution and Learning (Canberra, Australia) (1998) 66–73
Burke, E.K., Smith, A.J.: A Memetic Algorithm to Schedule Planned Grid Maintenance. Proc. Int. Conf. on Computational Intelligence for Modelling Control and Automation (Vienna, Austria) (1999) 122–127
Burke, E.K., Newall, J.P., A Multi-stage Evolutionary Algorithm for the Timetable Problem. IEEE Trans. Evolut. Comput. 3 (1999) 1085–1092
Burke, E.K., Landa Silva, J.D.: The Space Allocation System-Test Data. Available at www.asap.cs.nott.ac.uk/ASAP/space/spacedata.html [March 1st 2001]
Coley, D.A.: An Introduction to Genetic Algorithms for Scientists and Engineers. World Scientific, Singapore (1999) 23–34
Giannikos, J., El-Darzi, E., Lees, P.: An Integer Goal Programming Model to Allocate Offices to Staff in an Academic Institution. J. Oper. Res. Soc. 46 (1995) 713–720
Goldberg, D.E.: Genetic Algorithms in Search, Optimisation and Machine Learning. Addison-Wesley, Reading, MA (1989)
Man, K.F., Tang, K.S., Kwong, S.: Genetic Algorithms. Springer-Verlag, Berlin Heidelberg New York (1999)
Osman, I.H., Kelly J.P.: Meta-heuristics: Theory and Applications. Kluwer, Dordrecht (1996)
Rayward-Smith, V.J., Osman, I.H., Reeves, C.R., Smith, G.D.: Modern Heuristic Search Methods. Wiley, New York (1999)
Ritzman, L., Bradford, J., Jacobs, R.: A Multiple Objective Approach to Space Planning for Academic Facilities, J. Manage. Sci. 25 (1980) 895–906
Wren, A.: Scheduling, Timetabling and Rostering, a Special Relationship? Selected Papers from PATAT’95 (Edinburgh). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 46–75
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burke, E.K., Cowling, P., Landa Silva, J.D., McCollum, B. (2001). Three Methods to Automate the Space Allocation Process in UK Universities. In: Burke, E., Erben, W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44629-X_16
Download citation
DOI: https://doi.org/10.1007/3-540-44629-X_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42421-5
Online ISBN: 978-3-540-44629-3
eBook Packages: Springer Book Archive