Abstract
In this study, heuristic optimization methods which are genetic algorithm (GA), simulated annealing (SA) and adaptive simulated annealing genetic algorithm (ASAGA) are used for selecting questions from a question bank and generating a tets. The crossover and mutation operator of standard GA can not be directly usable for generating test, since integer-coded individuals have to be used and these operators produce duplicated genoms on individuals. In order to solve this problem, a mutation operation is proposed for preventing the duplications on crossovered individuals and also directing the search randomly to the new spaces. A database containing classified test questions is created together with predefined attributes for selecting questions. A particular test can be generated automatically, without active participation of the academician. The experiments and comparative analysis show that GA with proposed mutation operator is successful as nearly 100 percent and it produces results in noteworthy computational times.
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
Thelwall, M.: Computer-Based Assessment: a Versatile Educational Tool. Computers & Education 34, 37–49 (2000)
Fei, T., Hag, W.J., Toh, K.C., Qi, T.: Question Classification for E-learning by Artificial Neural Network. In: Proceedings of ICICS-FCM ZW3, Singapore, pp. 1757–1761 (2003)
Protiæ J., Bojiæ D., Tartalja I.: Test: Tools for Evaluation of Students Tests - a Development Experience. In: Proceedings of 31st ASEE/IEEE Frontiers in Education Conference, Reno, NV, F3A6-12 (2001)
Brown, R.W.: Multi-choice Versus Descriptive Examinations. In: Proceedings of 31st ASEE/IEEE Frontiers in Education Conference, Reno, NV, T3A13-18 (2001)
Prabhu, D., Buckles, B.P., Petry, F.E.: Genetic Algorithms for Scene Interpretation from Prototypical Semantic Description. Int. J. Intel. Syst. 15, 901–918 (2000)
Man, K.F., Tang, K.S., Kwong, S.: Genetic Algorithms: Concepts and Applications. IEEE Trans. Ind. Electron. 43, 519–533 (1996)
Herrera, F., Lozano, M., Sánchez, A.M.: A Taxonomy for the Crossover Operator for Real-Coded Genetic Algorithms: an Experimental Study. Int. J. Intel. Syst. 18, 309–338 (2003)
Spears, W.M., Anand, V.: A Study of Crossover Operators in Genetic Programming. In: Proceedings of 6th Intetnational Symposium on Methodologies for Intelligent Systems, pp. 409–418. Springer, Heidelberg (1991)
Kristinsson, K., Dumont, G.A.: System Identification and Control Using Genetic Algorithms. IEEE Trans. Syst. Man. Cybern. 22, 1033–1046 (1992)
Yildirim, M., Erkan, K.: Determination of Acceptable Operating Cost Level of Nuclear Energy for Turkey’s Power System. Energy 32, 128–136 (2007)
Zhu, F., Guan, S.U.: Ordered Incremental Training with Genetic Algorithms. Int. J. Intel. Syst. 19, 1239–1256 (2004)
Annakkage, U.D., Numnonda, T., Pahalawaththa, N.C.: Unit Commitment by Parallel Simulated Annealing. IEE Proc.-Gener. Transm. Distrib. 142(6), 595–600 (1995)
Senjyu, T., Saber, A.Y., Miyagi, T., Urasakin: Absolutely Stochastic Simulated Annealing Approach to Large Scale Unit Commitment Problem. Electric Power Components and Systems 34, 619–637 (2006)
Jeong, I.K., Lee, J.J.: Adaptive Simulated Annealing Genetic Algorithm for System Identification. Engng. Applic. Artif. Intell. 9(5), 523–532 (1996)
Yildirim, M., Erkan, K., Ozturk, S.: Power Generation Expansion Planning with Adaptive Simulated Annealing Genetic Algorithm. Int. J. Energy Res. 30, 1188–1199 (2006)
Kumar, N., Shanker, K.: A Genetic Algorithm for FMS Part Type Selection and Machine Loading. Int. J. Prod. Res. 38, 3861–3887 (2000)
Lemonge, A.C.C., Barbosa, H.J.C.: An Adaptive Penalty Scheme for Genetic Algorithms in Structural Optimization. Int. J. Numer. Meth. Engng. 59, 703–736 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yildirim, M. (2007). Heuristic Optimization Methods for Generating Test from a Question Bank. In: Gelbukh, A., Kuri Morales, Á.F. (eds) MICAI 2007: Advances in Artificial Intelligence. MICAI 2007. Lecture Notes in Computer Science(), vol 4827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76631-5_116
Download citation
DOI: https://doi.org/10.1007/978-3-540-76631-5_116
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76630-8
Online ISBN: 978-3-540-76631-5
eBook Packages: Computer ScienceComputer Science (R0)