The Minimum Weight Dominating Set Problem under Hybrid Uncertain Environments

被引:0
|
作者
Wang, Chenyin [1 ]
Luo, Dongling [2 ]
Zeng, Mowei [2 ]
Yi, Yang [2 ]
Zhou, Xiaocong [2 ]
机构
[1] Sun Yat Sen Univ, Xinhua Coll, Guangzhou 510275, Guangdong, Peoples R China
[2] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510275, Guangdong, Peoples R China
关键词
Dominating set; Random fuzzy theory; Random fuzzy simulation; Genetic algorithm;
D O I
10.4028/www.scientific.net/AMM.624.545
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The minimum weight dominating set problem (MWDSP) has been a popular research topic in recent years. The weights of vertexes may be considered as cost, time, or opponent's payoff, which are uncertain in most cases. This paper discusses MWDSP under hybrid uncertain environments where the weights of vertexes are random fuzzy variables. First, random fuzzy theory is introduced to describe these hybrid uncertain variables. Then we propose three decision models based on three different decision criteria to solve MWDSP under hybrid uncertain environments. To solve the proposed models, we present a hybrid intelligent algorithm where random fuzzy simulation and genetic algorithm are embedded. Numerical experiments are performed in the last to show the robustness and effectiveness of the presented hybrid intelligent algorithm.
引用
收藏
页码:545 / 548
页数:4
相关论文
共 50 条
  • [31] A Study on the Minimum Dominating Set Problem Approximation in Parallel
    Gambhir, Mahak
    Kothapalli, Kishore
    2017 TENTH INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING (IC3), 2017, : 13 - 18
  • [32] A memetic algorithm for minimum independent dominating set problem
    Wang, Yiyuan
    Chen, Jiejiang
    Sun, Huanyao
    Yin, Minghao
    NEURAL COMPUTING & APPLICATIONS, 2018, 30 (08): : 2519 - 2529
  • [33] Parallel Genetic Algorithm for Minimum Dominating Set Problem
    Cu Nguyen Giap
    Dinh Thi Ha
    2014 INTERNATIONAL CONFERENCE ON COMPUTING, MANAGEMENT AND TELECOMMUNICATIONS (COMMANTEL), 2014, : 165 - 169
  • [34] Application of CMSA to the Minimum Capacitated Dominating Set Problem
    Pinacho-Davidson, Pedro
    Bouamama, Salim
    Blum, Christian
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 321 - 328
  • [35] ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM
    Shang, Weiping
    Wang, Xiumei
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2011, 3 (01) : 9 - 15
  • [36] A memetic algorithm for minimum independent dominating set problem
    Yiyuan Wang
    Jiejiang Chen
    Huanyao Sun
    Minghao Yin
    Neural Computing and Applications, 2018, 30 : 2519 - 2529
  • [37] A randomized population-based iterated greedy algorithm for the minimum weight dominating set problem
    Bouamama, Salim
    Blum, Christian
    2015 6TH INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION SYSTEMS (ICICS), 2015, : 7 - 12
  • [38] Two population-based optimization algorithms for minimum weight connected dominating set problem
    Dagdeviren, Zuleyha Akusta
    Aydin, Dogan
    Cinsdikici, Muhammed
    APPLIED SOFT COMPUTING, 2017, 59 : 644 - 658
  • [39] A (4+ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
    Erlebach, Thomas
    Mihalak, Matus
    APPROXIMATION AND ONLINE ALGORITHMS, 2010, 5893 : 135 - +
  • [40] An Artificial Bee Colony Algorithm for Minimum Weight Dominating Set
    Nitash, C. G.
    Singh, Alok
    2014 IEEE SYMPOSIUM ON SWARM INTELLIGENCE (SIS), 2014, : 313 - 319