You are here:

To propose an algorithm for team forming: Simulated annealing K team-forming algorithm for heterogeneous grouping
PROCEEDINGS

, Ming Hsin University of Science and Technology, Taiwan

E-Learn: World Conference on E-Learning in Corporate, Government, Healthcare, and Higher Education, in Montreal, Canada ISBN 978-1-880094-46-4 Publisher: Association for the Advancement of Computing in Education (AACE), San Diego, CA

Abstract

Some researchers have compared the performance of some teams, they were formed through some grouping method, with other teams formed via random assignment, but the results were not consistent. Why the results were not consistent? In my point of view, the random assignment by a instructor or a manager could not be reproduced by others. Some instructors could put some students in a team better via their experiences than some algorithms. This phenomenon would stay continuance until a baseline algorithm is to be proposed as a base of comparison. Based on the above discussions, I have proposed a team-forming algorithm for heterogeneous grouping that could be used by other researchers to compare with. That algorithm called "K team-forming algorithm for heterogeneous grouping," which could group K students in a team with students' personal characteristics or performance.

Citation

Liu, E.Z.F. (2002). To propose an algorithm for team forming: Simulated annealing K team-forming algorithm for heterogeneous grouping. In M. Driscoll & T. Reeves (Eds.), Proceedings of E-Learn 2002--World Conference on E-Learning in Corporate, Government, Healthcare, and Higher Education (pp. 2645-2646). Montreal, Canada: Association for the Advancement of Computing in Education (AACE). Retrieved December 11, 2019 from .

Keywords

References

View References & Citations Map

These references have been extracted automatically and may have some errors. Signed in users can suggest corrections to these mistakes.

Suggest Corrections to References