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
来源
ADVANCED DEVELOPMENT IN AUTOMATION, MATERIALS AND MANUFACTURING | 2014年 / 624卷
关键词
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 条
  • [21] A note on the complexity of minimum dominating set
    Grandoni, Fabrizio
    JOURNAL OF DISCRETE ALGORITHMS, 2006, 4 (02) : 209 - 214
  • [22] Approximating a Minimum Dominating Set by Purification
    Inza, Ernesto Parra
    Vakhania, Nodari
    Almira, Jose Maria Sigarreta
    Hernandez-Aguilar, Jose Alberto
    ALGORITHMS, 2024, 17 (06)
  • [23] A local approximation algorithm for minimum dominating set problem in anonymous planar networks
    Wojciech Wawrzyniak
    Distributed Computing, 2015, 28 : 321 - 331
  • [26] Finding minimum weight connected dominating set in stochastic graph based on learning automata
    Torkestani, Javad Akbari
    Meybodi, Mohammad Reza
    INFORMATION SCIENCES, 2012, 200 : 57 - 77
  • [27] A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
    Zhu, Xu
    Wang, Wei
    Shan, Shan
    Wang, Zhong
    Wu, Weili
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 23 (04) : 443 - 450
  • [28] A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
    Xu Zhu
    Wei Wang
    Shan Shan
    Zhong Wang
    Weili Wu
    Journal of Combinatorial Optimization, 2012, 23 : 443 - 450
  • [29] Parameterized Complexity of Minimum Membership Dominating Set
    Agrawal, Akanksha
    Choudhary, Pratibha
    Narayanaswamy, N. S.
    Nisha, K. K.
    Ramamoorthi, Vijayaragunathan
    ALGORITHMICA, 2023, 85 (11) : 3430 - 3452
  • [30] Approximating Minimum Dominating Set on String Graphs
    Chakraborty, Dibyayan
    Das, Sandip
    Mukherjee, Joydeep
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 232 - 243