Open AccessFinding all non-dominated points for a bi-objective generalized assignment problem
Author(s) -
Ali Al-Hasani,
Masar Al-Rabeeah,
Santosh Kumar,
A Eberhard
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1218/1/012004
Subject(s) - mathematical optimization , computer science , assignment problem , generalized assignment problem , algorithm , mathematics
In this paper, we consider a bi-objective generalized assignment problem (BOGAP) and find all non-dominated points using two methods; Two Phases Method (TPM) and the Balanced Box Method (BBM). The computational results are shown by testing a number of instances, which indicates that the TPM performs better compared to the BBM.