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 条
  • [31] Parameterized Complexity of Minimum Membership Dominating Set
    Akanksha Agrawal
    Pratibha Choudhary
    N. S. Narayanaswamy
    K. K. Nisha
    Vijayaragunathan Ramamoorthi
    Algorithmica, 2023, 85 : 3430 - 3452
  • [32] Independent dominating set problem revisited
    Liu, Ching-Hao
    Poon, Sheung-Hung
    Lin, Jin-Yong
    THEORETICAL COMPUTER SCIENCE, 2015, 562 : 1 - 22
  • [33] A decidability result for the dominating set problem
    Lozin, Vadim V.
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (44-46) : 4023 - 4027
  • [34] On minimum m-connected k-dominating set problem in unit disc graphs
    Weiping Shang
    Frances Yao
    Pengjun Wan
    Xiaodong Hu
    Journal of Combinatorial Optimization, 2008, 16 : 99 - 106
  • [35] Ant Colony Optimization Algorithm with Pheromone Correction Strategy for the Minimum Connected Dominating Set Problem
    Jovanovic, Raka
    Tuba, Milan
    COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2013, 10 (01) : 133 - 149
  • [36] An exact algorithm for the minimum dominating clique problem
    Kratsch, Dieter
    Liedloff, Mathieu
    THEORETICAL COMPUTER SCIENCE, 2007, 385 (1-3) : 226 - 240
  • [37] Approximating the minimum independent dominating set in perturbed graphs
    Tong, Weitian
    Goebel, Randy
    Lin, Guohui
    THEORETICAL COMPUTER SCIENCE, 2014, 554 : 275 - 282
  • [38] Minimum Connected Dominating set for Certain Circulant Networks
    Parthiban, N.
    Rajasingh, Indra
    Rajan, R. Sundara
    3RD INTERNATIONAL CONFERENCE ON RECENT TRENDS IN COMPUTING 2015 (ICRTC-2015), 2015, 57 : 587 - 591
  • [39] Vertices contained in every minimum dominating set of a tree
    Mynhardt, CM
    JOURNAL OF GRAPH THEORY, 1999, 31 (03) : 163 - 177
  • [40] The fixed set search applied to the power dominating set problem
    Jovanovic, Raka
    Voss, Stefan
    EXPERT SYSTEMS, 2020, 37 (06)