Abstract
As is well known, time tabling problem is a combinatorial optimization problem with many hard and/or soft constraints. In most cases the problem includes nonlinear objective function and/or constraints. Several papers on this problem have been published using the genetic algorithm, where the problem is mainly to favor the organization which makes the time table. In this paper, we address the problem using the application slips, with which the clients express their desirable time slots for each lecture. This method is especially effective if the clients are very busy, or if the problem is for commercial use and hence the clients’ wishes have high priorities. To make the clients more satisfied even if the first desire is not accepted, the clients are supposed to write several desires of time slots for allocation. Genetic algorithm is used to optimize the order of the application slips to be used.
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
Colorai, A., Dorigo, M. and Maniezzo, V., 1990, Genetic algorithms and highly constrained problems: The time-table case; Proceedings of the First International Workshop on Parallel Problem Solving from Nature, Springer-Verlag, Dortmund, FRG, October, pp. 55-59.
Abramson, D. and Abela, J., 1991, A parallel genetic algorithm for solving the school timetabling problem; Technical Report TR-91-02, C.S.I.R.O., Division of Information Technology, Department of Communication and Electronic Engineering, Melbourne.
Burke, E. K., Ellman, D. G. and Weare, R. F., 1995, A hybrid genetic algorithm for highly constrained timetabling problems; Proceedings of the 6th International Conference on Genetic Algorithms, pp. 605-610, Morgan Kaufmann.
Rich, D. C., 1996, A smart genetic algorithm for university timetabling; Proc. First International Conf. Practice and Theory of Automated Timetabling: Selected Papers, pp. 181-197, Springer-Verlag.
Erben, W., 1996, A genetic algorithm solving a weekly course-timetabling problem; Proc. First International Conf. Practice and Theory of Automated Timetabling: Selected Papers, pp. 181-197, Springer-Verlag.
Paechter, B., Luchian, H. and Petriuc, M., 1994, Two solutions to the general time table problem using evolutionary methods; Proceedings of the First IEEE Conference on Evolutionary Computation, pp. 300-305.
Syswerda, G. and Palmucci, J., 1991, The Application of Genetic Algorithms to Resource Schedling, Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 502-508.
Baker, J. E., 1985, Adaptive selection methods for genetic algorithms, Proceedings of the First International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NJ, pp. 101–111.
Strkweather, T., McDaniel, S., Mathias, K. and Whitley, D., 1991, A Comparison of Genetic Sequencing Operators, Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 69-76.
Oliver, I. M., Smith, D. J. and Holland, J. R. C.,1987, A study of permutation crossover operators on the traveling salesman problem, Proceedings of the Second International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NJ, pp.224–230.
Davis, L., 1985, Job shop scheduling with genetic algorithms, Proceedings of the First International Conference on Genetic Algorithms, pp. 136-140.
Syswerda, G., 1990, Schedule Optimization Using Genetic Algorithms, Handbook of Genetic Algorithms, Davis, L. ed, Van Nostrand Reinhold, New York.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag London
About this paper
Cite this paper
Tanaka, M., Yamada, M., Matsuo, O. (1998). Application-Based Time Tabling by Genetic Algorithm. In: Chawdhry, P.K., Roy, R., Pant, R.K. (eds) Soft Computing in Engineering Design and Manufacturing. Springer, London. https://doi.org/10.1007/978-1-4471-0427-8_41
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0427-8_41
Publisher Name: Springer, London
Print ISBN: 978-3-540-76214-0
Online ISBN: 978-1-4471-0427-8
eBook Packages: Springer Book Archive