Adopting Jaya Algorithm for Team Formation Problem

• Main Authors: Kader, Md. Abdul, Kamal Z., Zamli
• Format: Conference or Workshop Item
• Language: English
• Published: Association for Computing MachineryNew York 2020
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://umpir.ump.edu.my/id/eprint/28569/1/Adopting%20Jaya%20Algorithm%20for%20Team%20Formation%20Problem.pdf; http://umpir.ump.edu.my/id/eprint/28569/; https://doi.org/10.1145/3384544.3384593
• Institution: Universiti Malaysia Pahang

This paper presents a simple and mighty metaheuristic algorithm, Jaya, which is applied to solve the team formation (TF) problem and it is a very fundamental problem in many databases and expert collaboration networks or web applications. The Jaya does not need any distinctive parameters that require comprehensive tuning, which is usually troublesome and inefficient. Among several optimization methods, Jaya is chosen for TFP because of its simplicity and it always avoids the worst solutions and moving towards the global best solution. This victorious nature makes Jaya Algorithm more powerful and significant as compared to any other contemporary optimization algorithms. To evaluate the efficiency of the Jaya Algorithm (JA) against another metaheuristic algorithm, Sine-Cosine Algorithm (SCA), both algorithms are tested and assessed for the TF problem solution using an ACM dataset containing experts and their skills. The experimental results validate the improved performance of the optimization solutions and the potential of JA with fast convergence for solving TF problems which are better than SCA.