Journal article
A new approach for bicriteria partitioning problem
M Gu, Z Tan, B Xia, Y Yan
Optimization Letters | SPRINGER HEIDELBERG | Published : 2015
Abstract
In this paper, we propose a new method to evaluate the performance of an algorithm for bicriteria optimization problems, specifically worst-case boundary, which is more accurate than the original ones. We use a typical multicriteria partitioning problem to serve as an example to illustrate the strength and features of our method. We show the worst-case boundary of the classical LS algorithm, and make comparison on the efficiency between the new method and the former ones. The limitation of simultaneous optimization is also shown in our paper.
Grants
Awarded by National Natural Science Foundation of China
Funding Acknowledgements
The authors would like to thank the anonymous referees for their careful reading of this article and helpful suggestions. Special thanks a referee for bringing some important literature on bicriteria scheduling to our attention. Supported by the National Natural Science Foundation of China (10971191, 11271324), Zhejiang Provincial Natural Science Foundation of China (LR12A01001) and Fundamental Research Funds for the Central Universities