Solving New Student Allocation Problem (NSAP) With Analytical Hierarchy Process (AHP)

• Main Authors: Shahbodin, Faaizah, Wan Hassim, Wan Haniza, Shibghatullah, Abdul Samad
• Format: Article
• Language: English
• Published: Sci.Int 2014
• Subjects: T Technology (General); TS Manufactures
• Online Access: http://eprints.utem.edu.my/id/eprint/21038/2/paperWanSciIntLahore.pdf; http://eprints.utem.edu.my/id/eprint/21038/; https://www.researchgate.net/publication/279205619_SOLVING_NEW_STUDENT_ALLOCATION_PROBLEM_NSAP_WITH_ANALYTICAL_HIERARCHY_PROCESS_AHP; http://sci-int.com/

There are many approaches used to solve New Student Allocation Problem (NSAP).Many researchers use application of Genetic Algorithm (GA).However,the study presented in this paper applies an Analytical Hierarchy Process (AHP)technique in solving New Student Allocation Problem (NSAP) handled by Registration Unit at Ungku Omar Polytechnic.The problem is the students are allocated to their class randomly,just by using their registration number and by all means without referring to their intelligence level,knowledge,skills and also their performance.So,in this paper the researcher’s focus is on solving NSAP by using AHP to allocate students into their respective classes with minimum intelligence gap in each class and the number of students in each class does not exceed its maximum capacity.The proposed solution will be tested using real data from the Politeknik Ungku Omar to see the result.