Diameter Constrained Fuzzy Minimum Spanning Tree Problem

被引：0
|
作者：
Sk. Md. Abu Nayeem
Madhumangal Pal
机构：
[1] Aliah University,Department of Mathematics
[2] Vidyasagar University,Department of Applied Mathematics with Oceanology and Computer Programming
来源：
International Journal of Computational Intelligence Systems | 2013年 / 6卷
关键词：
Minimum spanning tree; possibility and necessity measure; chance constrained programming; Prüfer code; genetic algorithm;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we have studied the constrained version of the fuzzy minimum spanning tree problem. Costs of all the edges are considered as fuzzy numbers. Using the mλ measure, a generalization of credibility measure, the problem is formulated as chance-constrained programming problem and dependent-chance programming problem according to different decision criteria. Then the crisp equivalents are derived when the fuzzy costs are characterized by trapezoidal fuzzy numbers. Furthermore, a fuzzy simulation based hybrid genetic algorithm is designed to solve the proposed models using Prüfer like code representation of labeled trees.
引用
收藏
页码：1040 / 1051
页数：11
相关论文
共 50 条
12345