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
相关论文
共 34 条
[1]  
Kruskal JB(1996)On the shortest spanning subtree of a graph and travelling salesman problem Proceedings of AMS 7 45-50
[2]  
Prim RC(1957)Shortest connection networks and some generalizations Bell System Technical Journal 36 1389-1401
[3]  
Dijkstra EW(1959)A note on two problems in connection with graphs Numerische Mathematik 1 269-271
[4]  
Gabow HN(1986)Efficint algorithms for finding minimum spanning trees in undirected and directed grphs Combinatorica 6 109-122
[5]  
Galil Z(2001)Compression of correlated bivectors Information Systems 16 110-118
[6]  
Spencer T(1989)“A tree-based algorithm for distributed mutual exclusion ACM transactions on Computers” 7 61-77
[7]  
Tarjan RE(1994)‘Computational methods for the diameter restricted minimum weight spanning tree problem,’ Australasian Journal of Combinatorics 10 51-71
[8]  
Bookstein A(1978)Minimax location of a facility in an undirected graph Tranportation Science 7 287-293
[9]  
Klein ST(1996)An approach based on necessity measure to the spanning tree problem Journal of the Operations Research Society of Japan 39 247-257
[10]  
Raymond K(1994)Ranking fuzzy sets on the concept of existence Computer Mathematics with Applications 27 1-21
1234