ASP-CSP: Grouping Algorithm for Decision Support System of Community Service Program

Forming a working group that is not customized to the interests and abilities of each student of the Community Service Program (CSP) can affect student activities. Universitas Sebelas Maret (UNS) has a system that can form student groups and locations, but can't consider the student's interest and ability factors and location conditions in choosing a theme. Therefore, this work developed a decision support system that can help to give the choice of CSP themes that according to the ability of the students and the needs of the location, and can help in forming some alternatives of the group. The system implements the ASP-CSP algorithm which is combination of AHP-SAW methods and the permutation model. AHP is used for determining the weight of criteria, SAW is used for determining the rank of alternative, and the permutation model is used to form a group of students and locations. The result of this work showed that the ASP-CSP algorithm was successfully applied to a varied testing scenario, some of which were grouping 10 locations for the overall theme with each theme forming 1 location group resulting in average distance (total average distance of all combinations) 0.013. Grouping of 22 students for the overall theme with each theme form a varied student group resulting minimum average distance 0.027.