Author:
Al-Hasani Ali,Al-Rabeeah Masar,Kumar Santosh,Eberhard Andrew
Abstract
Abstract
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.
Subject
General Physics and Astronomy
Reference21 articles.
1. An Improved Triangle Splitting Method for Solving Biobjective Mixed Integer Programming Problems;Al-Hasani,2018
2. Bicriteria transportation problem;Aneja;Management Science,1979
3. A criterion space search algorithm for biobjective integer programming: The balanced box method;Boland;INFORMS Journal on Computing,2015
4. A survey of algorithms for the generalized assignment problem;Cattrysse;European journal of operational research,1992
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献