Browse > Article
http://dx.doi.org/10.7236/JIIBC.2020.20.2.209

Bin Packing Algorithm for Equitable Partitioning Problem with Skill Levels  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.20, no.2, 2020 , pp. 209-214 More about this Journal
Abstract
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.
Keywords
Equitable partition; MinMax; Binary skill; Integer skill level; Bin packing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 F. A. O'brien and J. Mingers, "A Heuristic Algorithm for the Equitable Partitioning Problem", Omega International Journal of Management Science, Vol. 25, No. 2, pp. 215-223, Apr. 1997, DOI: https://doi.org/10.1016/S0305-0483(96) 00046-1   DOI
2 S. U. Lee, "A Divide-and-Conquer Heuristic Algorithm for Equitable Partitioning Problem", Journal of KIIT, Vol. 14, No. 4, pp. 163-174, Apr. 2016, DOI: https://doi.org/10.14801/ jkiit.2016.14.4.163   DOI
3 C. Akkan and B. Bozkaya, "A Heuristic Approach to Grouping and Timetabling of Project Presentations of Student Teams", Sabanci University, Faculty of Management, Orhanli, Tuzla, Istanbul, Turkey, Jun. 2008.
4 C. Akkan, M. K. Erdem, and C. Kocas, "Finding Robust Timetables for Project Presentations of Student Teams", European Journal of Operational Research, Vol. 249, No. 2, pp. 560-576. Mar. 2016, DOI: https://doi.org/10.1016/j.ejor. 2015.08.047   DOI
5 J. Mingers and F. A. O'Brien, "Creating Student Groups with Similar Characteristics: a Heuristic Approach", Omega International Journal of Management Science, Vol. 23, No. 3, pp. 313-321, Jun. 1995, DOI: https:// doi.org/10.1016/0 305-0483(95)00014-F   DOI
6 R. Hubscher, "Assigning Students to Groups Using General and Context-Specific Criteria", IEEE Transactions on Learning Technologies, Vol. 3, No. 3, pp. 178-189, Jul. 2010, DOI: https:// doi.org/10.1109/ TLT.2010.17   DOI