Diameter Constrained Fuzzy Minimum Spanning Tree Problem

被引：3
|
作者：
Abu Nayeem, Sk. Md. [1 ]
Pal, Madhumangal [2 ]
机构：
[1] Aliah Univ, Dept Math, Kolkata 700091, W Bengal, India
[2] Vidyasagar Univ, Dept Appl Math Oceanol & Comp Programming, Midnapore 721102, W Bengal, India
来源：
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS | 2013年 / 6卷 / 06期
关键词：
Minimum spanning tree; possibility and necessity measure; chance constrained programming; Prufer code; genetic algorithm; ALGORITHMS; NETWORKS;
D O I：
10.1080/18756891.2013.816027
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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(lambda) 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 Prufer like code representation of labeled trees.
引用
收藏
页码：1040 / 1051
页数：12
相关论文
共 50 条
  • [31] Formulations for the Weight-Constrained Minimum Spanning Tree Problem
    Requejo, Cristina
    Agra, Agostinho
    Cerveira, Adelaide
    Santos, Eulalia
    [J]. NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS I-III, 2010, 1281 : 2166 - +
  • [32] Solving diameter-constrained minimum spanning tree problems by constraint programming
    Noronha, Thiago F.
    Ribeiro, Celso C.
    Santos, Andrea C.
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2010, 17 (05) : 653 - 665
  • [33] Rough-fuzzy quadratic minimum spanning tree problem
    Majumder, Saibal
    Kar, Samarjit
    Pal, Tandra
    [J]. EXPERT SYSTEMS, 2019, 36 (02)
  • [34] Fuzzy multi-criteria minimum spanning tree problem
    Gao, Xin
    [J]. Proceedings of the Fourth International Conference on Information and Management Sciences, 2005, 4 : 498 - 504
  • [35] Random fuzzy programming models for minimum spanning tree problem
    Yu, Yueshan
    Ga, Jinwu
    [J]. Proceedings of the Fifth International Conference on Information and Management Sciences, 2006, 5 : 465 - 469
  • [36] Improved heuristics for the bounded-diameter minimum spanning tree problem
    Alok Singh
    Ashok K. Gupta
    [J]. Soft Computing, 2007, 11 : 911 - 921
  • [37] An adaptive heuristic to the bounded-diameter minimum spanning tree problem
    Javad Akbari Torkestani
    [J]. Soft Computing, 2012, 16 : 1977 - 1988
  • [38] Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
    Jochen Könemann
    Asaf Levin
    Amitabh Sinha
    [J]. Algorithmica , 2005, 41 : 117 - 129
  • [39] Approximating the degree-bounded minimum diameter spanning tree problem
    Könemann, J
    Levin, A
    Sinha, A
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION, 2003, 2764 : 109 - 121
  • [40] Improved heuristics for the bounded-diameter minimum spanning tree problem
    Singh, Alok
    Gupta, Ashok K.
    [J]. SOFT COMPUTING, 2007, 11 (10) : 911 - 921
12345