Spanning Tree Problem with Neutrosophic Edge Weights

被引：13

作者：

Broumi, Said ^{[1
]}

Bakali, Assia ^{[2
]}

Talea, Mohamed ^{[1
]}

Smarandache, Florentin ^{[3
]}

Dey, Arindam ^{[4
]}

Le Hoang Son ^{[5
]}

机构：

[1] Univ Hassan 2, Fac Sci Ben MSik, Lab Informat Proc, BP 7955, Casablanca, Morocco

[2] Ecole Royale Navale, Blvd Sour Jdid,BP 16303, Casablanca 16303, Morocco

[3] Univ New Mexico, Dept Math, 705 Gurley Ave, Gallup, NM 87301 USA

[4] Saroj Mohan Inst Technol, Hooghly, W Bengal, India

[5] Vietnam Natl Univ, VNU Univ Sci, Hanoi, Vietnam

来源：

PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING IN DATA SCIENCES (ICDS2017) | 2018年 / 127卷

关键词：

Single valued neutrosophic sets; neutrosophic matrix; score function; minimum spanning tree problem;

D O I：

10.1016/j.procs.2018.01.114

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which classical fuzzy sets/models may fail to model properly. This paper introduces an algorithm for finding minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph (abbr. UNWCG) where the arc/edge lengths are represented by a single valued neutrosophic numbers. To build the MST of UNWCG, a new algorithm based on matrix approach has been introduced. The proposed algorithm is compared to other existing methods and finally a numerical example is provided (c) 2018 The Authors. Published by Elsevier B.V.

引用

页码：190 / 199

页数：10

共 50 条

[11] An Explicit Integer Programming Model of the Minimal Spanning Tree Problem for Digraphs with Asymmetric Weights
Feng Junwen(Naming University of Science and Technology
Journal of Systems Engineering and Electronics, 1998, (02) : 70 - 81
[12] MINIMUM SPANNING TREE WITH NORMAL VARIATES AS WEIGHTS
ICHIMORI, T
SHIODE, S
ISHII, H
NISHIDA, T
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1981, 24 (01) : 61 - 66
[13] MINIMUM SPANNING TREE FOR MODERATE INTEGER WEIGHTS
HAYMOND, RE
JARVIS, JP
SHIER, DR
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1984, 10 (01): : 108 - 110
[14] Chance constrained bottleneck spanning tree problem with fuzzy random edge costs
Katagiri, H
Ishii, H
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2000, 43 (01) : 128 - 137
[15] Efficient Edge-swapping heuristics for the reload cost spanning tree problem
Raghavan, S.
Sahin, Mustafa
NETWORKS, 2015, 65 (04) : 380 - 394
[16] STOCHASTIC SPANNING TREE PROBLEM
ISHII, H
SHIODE, S
NISHIDA, T
DISCRETE APPLIED MATHEMATICS, 1981, 3 (04) : 263 - 273
[17] THE HYBRID SPANNING TREE PROBLEM
CHEN, YL
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 77 (01) : 179 - 188
[18] On the crossing spanning tree problem
Bilò, V
Goyal, V
Ravi, R
Singh, M
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 51 - 60
[19] ON STOCHASTIC SPANNING TREE PROBLEM
GEETHA, S
NAIR, KPK
NETWORKS, 1993, 23 (08) : 675 - 679
[20] On finding a minimum spanning tree in a network with random weights
McDiarmid, C
Johnson, T
Stone, HS
RANDOM STRUCTURES & ALGORITHMS, 1997, 10 (1-2) : 187 - 204

← 1 2 3 4 5 →