Fuzzy random degree-constrained minimum spanning tree problem

被引：1
|
作者：
Liu, Wei [1 ]
Yang, Chengjing [1 ]
机构：
[1] Chengdu Sports Univ, Chengdu, Peoples R China
来源：
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS | 2007年 / 15卷 / 02期
关键词：
minimum spanning tree problem; fuzzy random programming; fuzzy random simulation; genetic algorithm;
D O I：
10.1142/S0218488507004649
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The degree-constrained minimum spanning tree problem (dc-MST) is to find a minimum spanning tree of the given graph, subject to constraints on node degrees. This paper investigates the dc-MST problem with fuzzy random weights. Three concepts are presented: expected fuzzy random dc-MST, (alpha, beta)-dc-MST and the most chance dc-MST according to different optimization requirement. Correspondingly, by using the concepts as decision criteria, three fuzzy random programming models for dc-MST are given. Finally, a hybrid intelligent algorithm is designed to solve these models, and some numerical examples are provided to illustrate its effectiveness.
引用
收藏
页码：107 / 115
页数：9
相关论文
共 50 条
  • [21] Degree-constrained minimum spanning tree problem with uncertain edge weights
    Gao, Xin
    Jia, Lifen
    APPLIED SOFT COMPUTING, 2017, 56 : 580 - 588
  • [22] Degree-Constrained Minimum Spanning Tree Problem Using Genetic Algorithm
    Liu, Keke
    Chen, Zhenxiang
    Abraham, Ajith
    Cao, Wenjie
    Jing, Shan
    PROCEEDINGS OF THE 2012 FOURTH WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC), 2012, : 8 - 14
  • [23] A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem
    Singh, Kavita
    Sundar, Shyam
    SOFT COMPUTING, 2020, 24 (03) : 2169 - 2186
  • [24] An ant colony optimization approach to the degree-constrained minimum spanning tree problem
    Bau, YT
    Ho, CK
    Ewe, HT
    COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 1, PROCEEDINGS, 2005, 3801 : 657 - 662
  • [25] Heuristic algorithm for degree-constrained minimum spanning tree
    Liao, Fei-Xiong
    Ma, Liang
    Shanghai Ligong Daxue Xuebao/Journal of University of Shanghai for Science and Technology, 2007, 29 (02): : 142 - 144
  • [26] Ant Colony Optimization approaches to the degree-constrained minimum spanning tree problem
    Bau, Yoon-Teck
    Ho, Chin-Kuan
    Ewe, Hong-Tat
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2008, 24 (04) : 1081 - 1094
  • [27] A new tree encoding for the degree-constrained spanning tree problem
    Zhou, Gengui
    Meng, Zhiqing
    Cao, Zhenyu
    Cao, Jian
    CIS: 2007 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PROCEEDINGS, 2007, : 85 - +
  • [28] Partheno-genetic algorithm for solving the degree-constrained minimum spanning tree problem
    Song, Hai-Zhou
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2005, 25 (04): : 61 - 66
  • [29] An Improved Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
    Bui, Thang N.
    Deng, Xianghua
    Zrncic, Catherine M.
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2012, 16 (02) : 266 - 278
  • [30] An effective ant-based algorithm for the degree-constrained minimum spanning tree problem
    Doan, Minh N.
    2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 485 - 491
12345