A new approach for bicriteria partitioning problem

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 stren...

Full description

Saved in:
Bibliographic Details
Published in:Optimization letters 2015-06, Vol.9 (5), p.1025-1037
Main Authors: Gu, Mengyang, Tan, Zhiyi, Xia, Binzhou, Yan, Yujie
Format: Article
Language:English
Subjects:
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Short Communication
Simulation
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 L S 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.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-014-0796-9