خلاصة:
Large-Scale Allocation Problem (LSAP) is considcred to be an important problem in Operations Rescarch. ln thin paper, we have iricd tti modcl a sample LSA P and show that famous linear OR approaches in use cannot cfficiently help us chat lenge, develop and handle such cases. We begin with efforts in this area to conclude that timely, efficient and less costly soluti‹›ns could be only developed under simplified models. Then, a new approach will bc introduced. We have tried to introduce an algorithm and appl icative mctht›d to so lve a sample LSAP model and Io show that famous OR approaches, in use, cannt›t efficiently help us challenge, develop and handle such cascs. We bcgin with medel simplification, and conclude with a sample numerical solution of university entrance exam so that the etliciency of the method can be further explained.
ملخص الجهاز:
5 million) to the universities and/or fields of study applied for in the Nationwide Higher Education Entrance Exam along with assignment of teachers to various schools and educational centers in a large metropolitan area like Tehran, are other cases; the latter we will further develop as our sample model of an LSAP.
In this paper, we present an algorithmic method which would be able to solve various types of such problems in a timely, practical and applicative (View the image of this page) Iranian Journal of Information Science & Technology, Volume 3, Number 1 manner without affecting the generality of the problem and model.
To keep on with completing the model, now we introduce constraints of the problem: to supply number of te(View the image of this page) achers needed for teaching course i in hour ft in any given school k.
This function is defined so that for any applicant/consumer there will be a list of values, calculated in accordance with pro and con factors, which is to be the main basis for assignments and allocations: where, Pi(Q) and C;(Q) a(View the image of this page) re model's pro and con factors, respectively.
I CANTS/CONSUMERS TO RESOURCES he algorithm will arrive at its solution in the following sequence: Preparation Phase- We define an n-dimensional matrix (n is the number o1‘ indiccs introduced in object function; herein n=t) whose cells value is to be calculated according to pre-defined criteria.