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

ON SOLVING multi objective SET COVERING PROBLEM WITH IMPRECISE linear fractional objectiveS

RAIRO-OPERATIONS RESEARCH 2015年第3期49卷 495-510页

作者： Upmanyu, Mudita Saxena, Ratnesh R. Univ Delhi Dept Math Delhi 110007 India Univ Delhi Deen Dayal Upadhyaya Coll Dept Math Delhi 110007 India

The Set Covering problem is one the of most important NP-complete 0-1 integer programming problems because it serves as a model for many real world problems like the crew scheduling problem, facility location problem, vehicle routing etc. In this paper, an algorithm is suggested to solve a multi objective Set Covering problem with fuzzy linear fractional functionals as the objectives. The algorithm obtains the complete set of efficient cover solutions for this problem. It is based on the cutting plane approach, but employs a more generalized and a much deeper form of the Dantzig cut. The fuzziness in the problem lies in the coefficients of the objective functions. In addition, the ordering between two fuzzy numbers is based on the possibility and necessity indices introduced by Dubois and Prade [Ranking fuzzy numbers in the setting of possibility theory. Inf. Sci. 30 (1983) 183-224.]. Our aim is to develop a method which provides the decision maker with a fuzzy solution. An illustrative numerical example is elaborated to clarify the theory and the solution algorithm.

关键词： Set covering Problem multi objective linear fractional programming fuzzy mathematical programming fuzzy objective function

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：