PROGRAM ALLOCATION PROCESS IMPROVEMENT BY AN ASSIGNMENT MODEL
As the only source of jet pilot candidates for Turkish Air Force, Air Force Academy (TuAFA) applies several screening processes in order to acquire an average group of 150 cadets from civilian high school graduates each year. Besides the nationwide examinations (YGS-LYS), there are several others such as medical, flight, athletics evaluations and etc. Because the number of criteria for screening is large, the spread of the distribution of YGS-LYS scores of the candidates, which is assumed to be the aptitude towards college education, is a lot wider than those of other universities. Although admission to faculty for civilian high school students is regulated by the YGS-LYS score; in order to provide a balance distribution among different programs in terms of YGS-LYS score, placement to aerospace, electronics, computer and Industrial engineering programs of the Faculty is governed by a special directive. Although the directive considers candidates’ preferences, the ultimate goal of the algorithm in the directive is to keep the balance of academic success among different programs in the allocation process. In this study, we propose an alternative assignment model which tries to minimize the deviations from students’ preferences while maintaining the balance of the distribution among programs. Through simulation from different preference distributions with different number of students, it has been showed that regardless of the number of students and distribution of preferences,first choice allocation performance of the proposed model is significantly better than the directive’s algorithm.
 Saito, Y., Fujimoto, T.,Matsuo, T., 2008, Multi-sided Matching Lecture Allocation Mechanism, New Challenges in Applied Intelligence Technologies, volume 134 of Studies in Computational Intelligence, Springer.
 Gusfield, D., Irving R.W., 1989, “The stable marriage problem: structure and algorithms”, MIT Press, Cambridge, MA, USA.
 Manlove, D.F., O'Malley, G., 2005, Student project allocation with preferences over projects. In Proceedings of ACID2005: the 1st Algorithms and Complexity in Durham, 4, 69 – 80, KCL Publications.
 Marx, D., Schlotter, I., 2009, Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties, Algorithmica, 58(1), 170–187.
The manuscript with title and authors is being submitted for publication in Journal of Aeronautics and Space Technologies. This article or a major portion of it was not published, not accepted and not submitted for publication elsewhere. If accepted for publication, I hereby grant the unlimited and all copyright privileges to Journal of Aeronautics and Space Technologies.
I declare that I am the responsible writer on behalf of all authors.