检索结果-内蒙古大学图书馆

Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods

COMPUTATIONAL optimization AND APPLICATIONS 2009年第3期42卷 393-419页

作者： Fernandez, Jose Toth, Boglarka Univ Murcia Dpt Stat & Operat Res Murcia Spain Budapest Univ Technol & Econ Dpt Differential Equat H-1117 Budapest Hungary

Obtaining a complete description of the efficient set of multiobjective optimization problems can be of invaluable help to the decision-maker when the objectives conflict and a solution has to be chosen. In this paper we present an interval branch-and-bound algorithm which aims at obtaining a tight outer approximation of the whole efficient set of nonlinear biobjective problems. The method enhances the performance of a previous rudimentary algorithm thanks to the use of new accelerating devices, namely, three new discarding tests. Some computational studies on a set of competitive location problems demonstrate the efficiency of the discarding tests, as well as the superiority of the new algorithm, both in time and in quality of the outer approximations of the efficient set, as compared to another method, an interval constraint-like algorithm, with the same aim. Furthermore, we also give some theoretical results of the method, which show its good properties, both in the limit (when the tolerances are set equal to zero and the algorithm does not stop) and when the algorithm stops after a finite number of steps (when we use positive tolerances). A key point in the approach is that, thanks to the use of interval analysis tools, it can be applied to nearly any biobjective problem.

关键词： nonlinear biobjective optimization Efficient set Outer approximation Interval analysis Branch-and-bound method Discarding tests Continuous location

来源：评论

学校读者我要写书评

暂无评论

Obtaining an outer approximation of the efficient set of nonlinear biobjective problems

引用

JOURNAL OF GLOBAL optimization 2007年第2期38卷 315-331页

作者： Fernandez, Jose Toth, Boglarka Univ Murcia Dept Stat & Operat Res E-30001 Murcia Spain

A new method for obtaining an outer approximation of the efficient set of nonlinear biobjective optimization problems is presented. It is based on the well known 'constraint method', and obtains a superset of the efficient set by computing the regions of delta-optimality of a finite number of single objective constraint problems. An actual implementation, which makes use of interval tools, shows the applicability of the method and the computational studies on a set of competitive location problems demonstrate its efficiency.

关键词： nonlinear biobjective optimization efficient set outer approximation constraint method interval analysis competitive location

来源：评论

学校读者我要写书评

暂无评论

Obtaining an outer approximation of the efficient set of nonlinear biobjective problems

Obtaining an outer approximation of the efficient set of non...

引用

Workshop on Global optimization (Go05)

作者： Fernandez, Jose Toth, Boglarka Univ Murcia Dept Stat & Operat Res E-30001 Murcia Spain

关键词： nonlinear biobjective optimization efficient set outer approximation constraint method interval analysis competitive location

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：