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 条
  • [41] Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
    Gendron, Bernard
    Lucena, Abilio
    da Cunha, Alexandre Salles
    Simonetti, Luidi
    INFORMS JOURNAL ON COMPUTING, 2014, 26 (04) : 645 - 657
  • [42] A PTAS for the minimum dominating set problem in unit disk graphs
    Nieberg, T
    Hurink, J
    APPROXIMATION AND ONLINE ALGORITHMS, 2006, 3879 : 296 - 306
  • [43] A biomolecular computing model in vivo for minimum dominating set problem
    Liu, Xiang-Rong
    Wang, Shu-Dong
    Xi, Fang
    Chen, Mei
    Jisuanji Xuebao/Chinese Journal of Computers, 2009, 32 (12): : 2325 - 2331
  • [44] Quantum algorithm for minimum dominating set problem with circuit design
    张皓颖
    王绍轩
    刘新建
    沈颖童
    王玉坤
    Chinese Physics B, 2024, 33 (02) : 210 - 220
  • [45] Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem
    Hetland, Magnus Lie
    SIMILARITY SEARCH AND APPLICATIONS, SISAP 2020, 2020, 12440 : 111 - 125
  • [46] Application of CMSA to the Minimum Positive Influence Dominating Set Problem
    Akbay, Mehmet Anil
    Blum, Christian
    ARTIFICIAL INTELLIGENCE RESEARCH AND DEVELOPMENT, 2021, 339 : 17 - 26
  • [47] Quantum algorithm for minimum dominating set problem with circuit design
    Zhang, Haoying
    Wang, Shaoxuan
    Liu, Xinjian
    Shen, Yingtong
    Wang, Yukun
    CHINESE PHYSICS B, 2024, 33 (02)
  • [48] On greedy approximation algorithm for the minimum resolving dominating set problem
    Zhong, Hao
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 48 (04)
  • [49] A hybrid local search algorithm for minimum dominating set problems
    Abed, Saad Adnan
    Rais, Helmi Md
    Watada, Junzo
    Sabar, Nasser R.
    Engineering Applications of Artificial Intelligence, 2022, 114
  • [50] A greedy algorithm for the minimum -connected -fold dominating set problem
    Shi, Yishuo
    Zhang, Yaping
    Zhang, Zhao
    Wu, Weili
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (01) : 136 - 151