• Title/Summary/Keyword: Equitable partitioning problem

Search Result 2, Processing Time 0.018 seconds

Bin Packing Algorithm for Equitable Partitioning Problem with Skill Levels (기량수준 동등분할 문제의 상자 채우기 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.2
    • /
    • pp.209-214
    • /
    • 2020
  • The equitable partitioning problem(EPP) is classified as [0/1] binary skill existence or nonexistence and integer skill levels such as [1,2,3,4,5]. There is well-known a polynomial-time optimal solution finding algorithm for binary skill EPP. On the other hand, tabu search a kind of metaheuristic has apply to integer skill level EPP is due to unknown polynomial-time algorithm for it and this problem is NP-hard. This paper suggests heuristic greedy algorithm with polynomial-time to find the optimal solution for integer skill level EPP. This algorithm descending sorts of skill level frequency for each field and decides the lower bound(LB) that more than the number of group, packing for each group bins first, than the students with less than LB allocates to each bin additionally. As a result of experimental data, this algorithm shows performance improvement than the result of tabu search.

A Study on Balanced Team Formation Method Reflecting Characteristics of Students (학생들의 특성을 반영한 균형적인 팀 편성 방법에 관한 연구)

  • Kim, Jong-hwan
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.24 no.6
    • /
    • pp.55-65
    • /
    • 2019
  • With the advent of the Fourth Industrial Revolution and changes in the educational environment, team-based assignments are increasing in university classes. Effective team formation in team-based class is an important issue that affects students' satisfaction and the effectiveness of education. However, previous studies mostly focused on post analysis on the results of team formation, which makes it difficult to use them in actual classes. In this paper, we present a mathematical model of how to create a balanced team that reflects students' abilities and other characteristics. Characteristic values for assignment may be scores, such as students' proficiency, binary values such as gender, and multi-values, such as grade or department. This problem is a type of equitable partitioning problem, which takes the form of 0-1 integer programming, and the objective function is linear or nonlinear, depending on how balance is achieved. The basic model or the extended model presented can be applied to the situation where teams are balanced in consideration of various factors in actual class.