Journal of Intelligent & Fuzzy Systems xx (20xx) x–xx 1

DOI:10.3233/JIFS-219188
IOS Press

1 Time-dependent Dijkstra’s algorithm under

2 bipolar neutrosophic fuzzy environment

f
roo
3 Esra Çakıra,b,∗ , Ziya Ulukana,b and Tankut Acarmana,b
4
a Department of Industrial Engineering, Galatasaray University, Ortakoy/Istanbul, Turkey
5
b Department of Computer Engineering, Galatasaray University, Ortakoy/Istanbul, Turkey

rP
6 Abstract. Determining the shortest path and calculating the shortest travel time of a complex networks are important for

tho
7 transportation problems. Numerous approaches has been developed to search shortest path on graphs, and one of the well-
8 known is the Dijkstra’s label correcting algorithm. Dijkstra’s approach is capable of determining shortest path of directed or
9 undirected graph with non-negative weighted arcs. To handle with uncertainty in real-life, the Dijkstra’s algorithm should
10 be adapted to fuzzy environment. The weight of arc -which is the vague travel time between two nodes- can be expressed
11 in bipolar neutrosophic fuzzy sets containing positive and negative statements. In addition, the weights of arcs in bipolar
Au
12 neutrosophic fuzzy graphs can be affected by time. This study proposes the extended Dijkstra’s algorithm to search the
13 shortest path and calculate the shortest travel time on a single source time-dependent network of bipolar neutrosophic fuzzy
14 weighted arcs. The proposed approach is illustrated, and the results demonstrate the validity of the extended algorithm. This
15 article is intended to guide future shortest path algorithms on time-dependent fuzzy graphs.

16 Keywords: Graph theory, Dijkstra’s algorithm, time-dependent shortest path problem, shortest travel time, fuzzy set theory,
d

17 bipolar neutrosophic fuzzy number

cte

18 1. Introduction be used in networks. Fuzzy sets, whose theory was 34

developed in 1965 by Zadeh [1], are suitable for 35

rre

19 Finding the shortest path on a graph is the sub- dealing with these uncertainties. According to each 36

20 ject of determining the existence of the least costly case, there are various sets of expressions to make 37

21 path between two nodes. The shortest path problem fuzzy expressions more meaningful. The situations 38

22 can be calculated from any node to another node, evaluated in terms of truth, indeterminacy and falsity 39
co

23 from each node to all nodes, or for all nodes. It is and bipolarity can be used in fuzzy number expres- 40

24 one of the most frequently encountered problems in sions. In recent years, many studies have developed 41

25 daily life such as traffic density, network setup, rout- a solution method to this problem by expressing the 42

26 ing and database search. Theoretically, although this connection weights between two nodes in networks 43
Un

27 problem finds the shortest path in a network, it does with fuzzy numbers. It is also possible to consider 44

28 not include some parameters in daily life, i.e., the time-dependent uncertainty. Using the change in time 45

29 time-dependent varying density of traffic, the uncer- with fuzzy numbers, time-dependent shortest path 46

30 tain transmission time arising from the weakening finding problems in uncertain graphs can be evalu- 47

31 of the reception power in an internet network, the ated. Thus, the shortest path algorithms existing in 48

32 uncertainty of weather conditions on the route, etc. the literature should be examined and expanded to be 49

33 Therefore, methods that express uncertainty should fuzzy and time-dependent. 50

The Dijkstra’s algorithm – “which is one of the 51

∗ Corresponding author. E. Çakır. E-mail: ecakir@gsu.edu.tr. most used shortest path algorithms in the literature”- 52

ISSN 1064-1246/$35.00 © 2021 – IOS Press. All rights reserved.

 2 Esra Çakı́r et al. / Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy environment

53 searches the shortest paths in a graph from one node from MRI images. Mandal et al. [33] are designed 102

54 to other nodes. In other words, this approach appoints an algorithm searching on the different types of cov- 103

55 the shortest path starting from a certain point. It was ering sets on fuzzy graphs. They performed to use 104

56 originally developed for directional and weighted of the covering problem and applied their strategy in 105

57 networks. Also, the weight of an edge should be a natural disaster management. 106

58 non-negative value. To express the vagueness in real-life, chronolog- 107

59 To deal with the fuzzy environment and time- ically, the fuzzy set theory is originally introduced 108

60 dependency, the Dijkstra’s algorithm can be adapted. by Zadeh [1] and the intuitionistic fuzzy set is 109

f
61 This study extends the Dijkstra’s approach to search represented by Atanassov [2]. Depending on their 110

roo
62 the shortest paths and the shortest travel times in fuzzy theorems, Smarandache [3] came up with a gener- 111

63 and time-dependent graphs. On a time-dependent alize of the fuzzy set theory and the intuitionistic 112

64 fuzzy graph, shortest path is also considered as short- fuzzy sets called the neutrosophic fuzzy sets “NFS”. 113

65 est time travel. Thus, this paper contributes to the In addition, Lee [51, 52] proposed the bipolar fuzzy 114

66 literature by combining bipolar neutrosophic fuzzy sets based on existing fuzzy theorems to handle pos- 115

rP
67 sets with Dijkstra’s algorithm considering the time- itive and negative behavior of human mind. The 116

68 dependency. Proposed algorithm can find shortest bipolar neutrosophic fuzzy set “BNFS” is introduced 117

69 path and calculate shortest travel time from a start in the study of Deli et al. [17]. This fuzzy set has 118

70 node to each node on a graph –or a digraph- with time- six components to express “truth-membership (T)”, 119

tho
71 dependent bipolar neutrosophic fuzzy expressed “indeterminacy membership (I)”, “falsity member- 120

72 edges. ship (F)” and their respective negative membership 121

73 The organization of the article is given as fol- degrees [4]. Since bipolar neutrosophic fuzzy sets 122

74 lows. Literature review and concepts are given in containing positive and negative statements, it is more 123

75 Section 2. Section 3 represents the preliminaries of suitable for expressing human behavior. 124
Au
76 bipolar neutrosophic fuzzy sets and its operations In recent years, numerous research on neutro- 125

77 Also, Section 3 proposed the time-dependent bipo- sophic fuzzy sets has related on finding shortest 126

78 lar neutrosophic fuzzy Dijkstra’s algorithm. The new path in fuzzy graphs [5–9]. Broumi et al. [34] 127

79 extended Dijkstra’s algorithm on a time-dependent introduced bipolar single-valued neutrosophic fuzzy 128

80 bipolar neutrosophic fuzzy network is illustrated in graph theory. They define the fuzzy graphs based on 129

Section 4. The results of the application are discussed “bipolar fuzzy graphs”, “N-graphs”, “intuitionistic
d

81 130

82 in Section 5. Finally, Section 6 concludes the research fuzzy graph”, “single-valued neutrosophic graphs” 131
cte

83 and suggests new lines for further studies. and “bipolar intuitionistic fuzzy graphs”. Zhan et al. 132

[35] developed their decision-making approach with 133

bipolar neutrosophic information. Their application 134

84 2. Literature review of bipolar neutrosophic fuzzy set is on uncovering the 135

undercover reasons for “global terrorism”, “detection 136

rre

85 A graph is an approach to represent various prob- of psychological improvement of patients in a mental 137

86 lems related to networks and relations [20]. When hospital” and “recognition of each country’s par- 138

87 uncertainty is in question, fuzzy numbers are used ticipation in its conspicuous relationships”. Broumi 139

88 in expressing the relationship between objects [21]. et al. [36] computed MST (minimum spanning tree) 140
co

89 The fuzzy graphs are investigated by numerous stud- with interval-valued bipolar neutrosophic fuzzy sets. 141

90 ies in the literature [22–29]. In recent years, fuzzy For an undirected neutrosophic weighted connected 142

91 edges graphs are also intended to use of real cases. graph, they represent a MST algorithm. 143

92 Koam et al. [30] stressed about decision making Determining the shortest path through a network 144
Un

93 analysis for fuzzy graph structure. They introduced is a major challenge in graph theory, because for 145

94 the lexicographic-max product. They also computed real-life applications, edges depend on cost or time 146

95 the total degree of a vertex in the lexicographic- are subject to uncertainty. Ayed et al. [37] proposed 147

96 max product of fuzzy graphs. Their application is on a hybrid methodology to solve the time-dependent 148

97 regarding detection of the marine crimes and the road multi-modal transport problem. Their approach is 149

98 crimes. Davvaz et al. [31] are introduced intuitionistic passed on a transfer graph model. The aim of 150

99 fuzzy graphs of “nth ” type with social network cases. this approach is to minimize the impact of traf- 151

100 Dogra et al. [32] proposed a fuzzy graph cut technique fic congestion on citizen’s welfare, economy, and 152

101 and they use the method for brain tumor detection pollution. For drivers towards green driving, Sun 153
 Esra Çakı́r et al. / Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy environment 3

154 et al. [38] discovered time-dependent shortest path there should not be negative cost cycles here, too. 206

155 for the traffic graphs. They proposed two algorithms: Another method is the Floyd algorithm. It is the algo- 207

156 “Extended Bellman–Ford algorithm” and “Heap- rithm that determines the shortest paths to all other 208

157 based Bellman–Ford algorithm”, and compare their nodes for each node on the graph. It is generally pre- 209

158 time complexity. Patoghi et al. [39] considered a ferred for use in dense graphs. If the graph is kept as 210

159 time-dependent pollution routing problem. They rep- a neighborhood matrix, the computational time com- 211

160 resented time-dependent pollution routing problem plexity of the Floyd algorithm is “(n2 )”. The studies 212

161 for multi-graph. They perform a tabu search algo- [45–50] are compared shortest path algorithms and 213

f
162 rithm and compare their results with exact solution. illustrated on an example. Also, the studies com- 214

roo
163 Considering the existing shortest path algorithms pared in Section 5 constitute a reference to develop 215

164 and cases, it is necessary to adapt these algorithms fuzzy time-dependent shortest path algorithm based 216

165 to various fuzzy set extentions in order to account on classic label correcting algorithm “Dijkstra”. 217

166 for the uncertainties in the real world. For shortest In the light of the studies in the literature, it is clear 218

167 paths, Dijkstra’s label correcting algorithm is one of that many shortest path algorithms used in graphs 219

rP
168 the most known approach in the computer science. To can be adapted for uncertain conditions and enriched 220

169 discover shortest path within a graph whose edges are with time-dependent and fuzzy expressions. There- 221

170 all non-negative values, it is developed in 1959 [10]. fore, in this study, considering time-dependency, an 222

171 This algorithm originally uses the greedy approach extended version of the Dijkstra’s shortest path algo- 223

tho
172 to solve the single source shortest path problem. rithm in bipolar neutrosophic fuzzy number-weighted 224

173 The algorithm repeatedly proceeds from the unse- networks is presented. While neutrosophic fuzzy sets 225

174 lected vertices and computes the distance to be actual are often used in various shortest path algorithms in 226

175 shortest distance from a start node. In each iteration the fuzzy graph literature, this article expands on 227

176 “Permanent” label is assigned to a node which has fuzzy graphs with bipolar neutrophic fuzzy num- 228
Au
177 shortest distance between “Temporary” nodes. The bers that exploit both positive and negative effects in 229

178 time complexity of original algorithm with Big-O expressing uncertainty with neutrophic fuzzy sets. In 230

179 notation is “((E + V)*log V)” [11] (“E” as edges and the next sections, the revised algorithm is explained 231

180 “V” as vertex) for general graphs. In recent years, in detail, the pseudocode is given, and the method is 232

181 Broumi et al. [40] applied Dijkstra’s algorithm to tested in a numerical example. Validity of the results 233

search the neutrosophic shortest path on fuzzy graphs. of the application have been proven by reference to
d

182 234

183 Çakır et Ulukan [41] are extended the Dijkstra’s other studies in the literature. 235
cte

184 algorithm for bipolar neutrosophic fuzzy numbers.

185 They also proposed the pseudocode for fuzzy Dijk-
186 stra’s algorithm and performed their extended version 3. Proposed methodology 236

187 of Dijkstra’s algorithm on an example. Enayattabar

188 et al. [42] proposed a version of Dijkstra’s algorithm In this section, the preliminaries and definitions 237
rre

189 on interval-valued Pythagorean fuzzy environment. of the bipolar neutrosophic fuzzy sets “BNFS” are 238

190 They illustrated their strategy on small sized telecom- introduced [4]. Next, the methodology of bipolar 239

191 munication network. Rahayuda and Santiari [43] are neutrosophic time-dependent Dijkstra’s algorithms is 240

192 proposed an hybrid fuzzy Dijkstra’s algorithm. For proposed step by step. 241
co

193 firefighting teams travels to the location of the fire

194 incident, they aimed best path search. Şahin [44] rep- 3.1. Bipolar neutrosophic fuzzy sets “BNFS” 242
195 resented a fuzzy analytic hierarchy process extended
196 Dijkstra’s algorithm. By introducing a new route opti- Definition 1: [4] Let “X” be a universe of dis-
Un

197 mization algorithm to manned or unmanned ships, he course. Then, “A={<x, TA (x) , IA (x) , FA (x) >: x ∈
198 aimed to provide fuel consumption, time and safety X}” is defined as a NFS, which is characterized by
199 benefits. a truth-membership function “TA : X →]− 0, 1+ [”,
200 To compare the Dijkstra’s approach, an alterna- an indeterminacy-membership function “IA : X →
201 tive well-known method used to find the shortest ]− 0, 1+ [” and a falsity-membership function FA :
202 path is the Bellman-Ford algorithm. It determines X →]− 0, 1+ [. The sum of “T (x)”, “I (x)” and
203 the shortest paths from a start node such as Dijkstra “F (x)” has no restrictions, so
204 to each node. Unlike Dijkstra’s algorithm, it works
205 correctly for graphs with negative values. However, 0 ≤ sup TA (x) + sup IA (x) + sup FA (x) ≤ 3 (1)
 4 Esra Çakı́r et al. / Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy environment

 λ  λ
243 Definition 2: [4] A BNFS “A” in “X” defined λÃ1 =< 1− 1 − T1+ , (I1+ )λ , F1+ ,−(−T1− )λ ,
as an object of the form “A = {< x, TA+ (x), IA+
  λ
244

245 (x), FA+ (x), TA− (x), IA− (x), FA− (x) >: x ∈ X}”, where − (−I1− )λ , −(1 − 1 − −F1− >
246 “T + , I + , F + : X → [0, 1]” and “T − , I − , F − : X → (5)
247 [−1, 0]”. The positive membership degrees “T + (x)”,  λ  λ
248 “I + (x)” and “F + (x)” denote the truth membership, Ã1λ =< (T1+ )λ , 1 − 1 − I1+ , 1 − 1 − F1+ ,
indeterminate membership and false membership of   λ
− (1 − 1 − −T1− , −(−I1− )λ , −(−F1− )λ >
249

250 element x ∈ X corresponding to a BNFS “A”. The

f
(6)
251 negative membership degrees “T − (x)”, “I − (x)” and

roo
252 “F − (x)” denote the truth membership, indeterminate Ã1 ⊕ Ã2 =< T1+ + T2+ − T1+ T2+ , I1+ I2+ , F1+ F2+ ,
253 membership and false membership of element x ∈ X  
254 to some implicit counter-property corresponding to a − T1− T2− >, − −I1− − I2− − I1− I2− ,
BNFS “A”.  
255
− −F1− − F2− − F1− F2− >
Theorem: [4] A BNFS set is the generalization of a (7)

rP
256

bipolar fuzzy set.

Ã1 ⊗ Ã2 =< T1+ T2+ , I1+ + I2+ − I1+ I2+ , F1+ + F2+
257

Proof: [4] Assume that “X” is a BNFS. If the mem-  

− F1+ F2+ , − −T1− − T2− − T1− T2− ,
258

259 bership degrees “I + ”, “F + ”, “I − ” and “F − ” equal

− I1− I2− , −F1− F2− >

tho
260 to zero then, “X” is reduced from the BNFS to the
261 bipolar fuzzy set. (8)
Definition 3: [17] Let “Ã1 = (T1+ , I1+ , F1+ , T1− , where λ > 0. 264

I1− , F1− )” and “Ã2 = (T2+ , I2+ , F2+ , T2− , I2− , F2− )” be Definition 6: [4] 0 n may be defined as 265
two BNFS in a universe of discourse “X”, then the “0 n={<x,(0,1,1,-1,0,0)>:x ∈ X}”.
Au 266
union and the intersection operations are defined as The usage of score function is a convenient method 267
below: for comparing BNFS. 268

Definition 7: [4] Let “Ã1 = (T1+ , I1+ , F1+ ,

  I1+ + I2+   T1− , I1− , F1− )” be a BNFS. Then, the score function
Ã1 ∪ Ã2 =< max T1+ , T2+ , , min F1+ , F2+ ,
2
d

“s(Ã1 )”, accuracy function “a(Ã1 )” and the certainty

  I1− + I2−   function “c(Ã1 )” of a BNFS are defined as follows:
min T1− , T2− , , max F1− , F2− , > (2)
cte

2   T1+ + 1 − I1+ + 1 − F1+ + 1 + T1− − I1− − F1−

s Ã1 =
6
  I1+ + I2+   (9)
Ã1 ∩ Ã2 =< mim T1+ , T2+ , , max F1+ , F2+ ,
2
 
  I1− + I2−   a Ã1 = T1+ − F1+ + T1− − F1−
rre

(10)
max T1− , T2
−
, , min F1− , F2− ,> (3)
2
262  
Definition 4: [4] Let “A = {< c Ã1 = T1+ − F1− (11)
x, TA− (x) , IA− (x) , FA− (x)>: x ∈ X}” be a BNFS in
Definition 8: [4] Let “Ã1 = (T1+ , I1+ , F1+ , T1− ,
co

“X”. Then the complement of “A” is denoted by 269

“Ac ” and is defined by I1− , F1− )” and “Ã2 = (T2+ , I2+ , F2+ , T2− , I2− , F2− )” be 270

two BNFS. The comparison of two BNFS can be 271

      defined as follows: 272

Un

TAc =< 1+ −TA+ (x), 1+ −IA+ (x), 1+ − FA+ (x) ,    

– If s Ã1 > s Ã2 , then Ã1 is greater than Ã2
 +    
273

1 − TA+ (x) , 1− − IA+ (x) , 1− − FA− (x) , > andshowed as Ã1> Ã2 . 274

(4) – If s Ã1 = s Ã2 , then

   
275

263 for all x ∈ X. – If a Ã1 > a Ã2 , then Ã1 is greater than 276

Definition 5: [4] Let “Ã1 = (T1+ , I1+ , F1+ , T1− ,

Ã2 showed
  asÃ1 > Ã2 . 277

I1− , F1− )” and “Ã2 = T2+ , I2+ , F2+ , T2− , I2− , F2− ” – If a Ã1 = a Ã2 , then
   
278

be two BNFS. Then, the operations for bipolar neu- – If c Ã1 > c Ã2 , then Ã1 is greater 279

trosophic numbers are as below: than ã2 and showed as Ã1 Ã2 .
 Esra Çakı́r et al. / Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy environment 5

Table 1
Pseudocode of time-dependent Dijkstra’s label correcting algorithm under bipolar neutrosophic fuzzy environment

f
roo
rP
tho
   
280 – If c Ã1 = c Ã2 , then ã1 is equal to ã2 the smallest score label. The algorithm allows each 297

iteration to assign only one “Permanent” status to a

Au
281 and showed as Ã1 = Ã2 . 298

node which has smallest score. 299

282 3.2. Proposed algorithm The pseudocode of time-dependent BNF Dijkstra 300

label correcting algorithm is shown in Table 1. 301

283 Dijkstra’s algorithm [12] is constructed to deter- The steps of proposed fuzzy label correcting 302

methodology are as follows:

d

303
284 mine the shortest path from a sink node to a target
285 node with a little computational time. This approach Step 1 - Assign label [t̃s , −] and permanent status 304

to start node.
cte

305
286 is also used to discover the set of edges connecting
287 all vertices. Step 2 - Calculate labels [t̃i ⊕ w̃ij , i] to nodes 306

Let “t̃i ” be a BNFS expressed shortest travel time reachable (node j) from permanent nodes (node i) 307

from start node to node i and “w̃ij ” be a BNF weight and assign temporary status. 308

of edge (i, j). The weights of can contain a fixed Step 3 - If node j has been already assigned with 309
rre

BNFS and a time-dependent BNFS. The bipolar neu- “Temporary” status, compare the labels scores, and 310

trosophic fuzzy labels of node j coming from node i choose the smallest score as label score of node j. 311

with a travel time t̃i from start node is [18, 19]: Step 4 - To compare bipolar neutrosophic num- 312

bers, calculate scores of all temporary labels. Assign 313

[t̃j , i] = [t̃i ⊕ w̃ij , i] “Permanent” status to node with the smallest score.
co

(12) 314

Step 5 - If all nodes have “Permanent” status, ter- 315

  minate the algorithm. Else, go to Step 2. 316

s w̃ij > 0 (13)
Step 6 - Using the label information, find the short- 317
Un

288 The point to be considered is that the score of est path by tracing backward through the graph. 318

289 BNF label should be non-negative, because the origi- The steps of the proposed time-dependent 319

290 nal Dijkstra’s label correcting algorithm proceeds on Dijkstra’s label correcting algorithm under BNF envi- 320

291 graph with non-negative edge. Since this algorithm ronment are briefly given in Fig. 1. 321

292 is a label correcting algorithm, there are node status

293 such as “Permanent” and “Temporary”. “Temporary” 4. Application 322

294 status is assigned to a node reachable (node j) from a

295 “Permanent” node (node i). When there is other nodes Shortest travel times for time-dependent and fuzzy 323

296 with “Temporary” status, algorithm continuous with weighted networks are an expanded version of the 324
 6 Esra Çakı́r et al. / Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy environment

f
Fig. 2. A network with time-dependent bipolar neutrosophic fuzzy

roo
weight.

rP
tho
d Au
cte

Fig. 1. Flowchart of the proposed time-dependent bipolar neutro-

rre

sophic Dijkstra methodology.

325 classical shortest path problems. As in classic model,

co

326 extended Dijkstra’s algorithm can be applied on a

327 time-dependent graph to achieve shortest travel time.
328 An example network with time-dependent bipolar
329 neutrosophic fuzzy weight is given in Fig. 2.
Un

330 The departure time (t̃s ) is set as (0.2, 0.4, 0.5,

331 -0.5, -0.7, -0,3). All edge delays of the network are
332 represented in Fig. 3.
333 According to modified Dijkstra’s algorithm as in
334 the proposed model, the shortest travel times from
335 start node (node 1) to all nodes are calculated step by
336 step as follows:
Fig. 3. Edge delays of time-dependent bipolar neutrosophic fuzzy
337 According to the proposed algorithm, the node graph based on score.
338 with the smallest label and temporary should take
 Esra Çakı́r et al. / Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy environment 7

Iteration-0: Label [t s, −] and “Permanent” status are assigned Iteration-2: Labels and “Temporary” status are assigned to
to node 1 (start node). nodes reachable from nodes with “Permanent” status.
Node Label Status Node Label Status
1 [(0.2,0.4,0.5,-0.5,-0.7,-0,3), -] Permanent 1 [(0.2,0.4,0.5,-0.5,-0.7,-0,3), -] Permanent
2 [(0.52,0.24,0.15,-0.25,-0.82,-0.51), 1] Temporary
[(0.877,0.65,0.147,-0.091,-0.927,-0.852), 3]
3 [(0.44,0.32,0.3,-0.35,-0.82,-0.44), 1] Permanent
4 [(0.72,0.096,0.21,-0.14,-0.91,-0.496), 3] Temporary
5 [(0.888,0.96,0.3,-0.7,-0.946,-0.888), 3] Temporary

f
roo
rP
Iteration-1: Labels and temporary status are assigned to nodes
reachable from “Permanent” nodes.
Node Label Status
1 [(0.2,0.4,0.5,-0.5,-0.7,-0,3), -] Permanent

tho
2 [(0.52,0.24,0.15,-0.25,-0.82,-0.51), 1] Temporary
Iteration-3: This iteration has no new nodes reachable from
3 [(0.44,0.32,0.3,-0.35,-0.82,-0.44), 1] Temporary
“Permanent” nodes, but new label is assigned to nodes reachable
from new “Permanent” node.
Node Label Status
1 [(0.2,0.4,0.5,-0.5,-0.7,-0,3), -] Permanent
Au
2 [(0.52,0.24,0.15,-0.25,-0.82,-0.51), 1] Permanent
3 [(0.44,0.32,0.3,-0.35,-0.82,-0.44), 1] Permanent
4 [(0.72,0.096,0.21,-0.14,-0.91,-0.496), 3] Temporary
5 [(0.67,0.204,0.074,-0.194,-0.864,-0.56), 2] Temporary
[(0.888,0.96,0.3,-0.7,-0.946,-0.888), 3]
d
cte

339 “Permanent” status. Label scores are calculated to

340 compare bipolar neutrosophic fuzzy expressions.
341 Since the s(0.52,0.24,0.15,-0.25,-0.82,-0.51)=0.702
342 and s(0.44,0.32,0.3,-0.35,-0.82,-0.44)=0.622, “Per-
rre

343 manent” status is assigned to node 3.

344 Since the s(0.52,0.24,0.15,-0.25,-0.82,-0.51)=
345 0.702, s(0.877,0.65,0.147,-0.091,-0.927,-0.852)=
346 0.892, s(0.72,0.096,0.21,-0.14,-0.91,-0.496)=0.78
co

347 and s(0.888,0.96,0.3,-0.7,-0.946,-0.888)=0.921

348 “Permanent” status is assigned to node 2 (from node
349 1).
350 Since the s(0.72,0.96,0.21,-0.14,-0.91,-0.496)=
Un

351 0.78, s(0.67,0.204,0.074,-0.194,-0.864,-0.56)=0.771

352 and s(0.888,0.96,0.3,-0.7,-0.946,-0.888)=0.921
353 “Permanent” status is assigned to node 5 (from node
354 2).
355 Since the s(0.72,0.096,0.21,-0.14,-0.91,-0.496)= Fig. 4. Shortest paths to each node from start node.
356 0.78, and s(0.901,0.122,0.15,-0.078,-0.919,-0.912)=
357 0.92 “Permanent” status is assigned to node 4.
358 Since the s(0.922,0.009,0.044,-0.02,-0.992, -0.919,-0.912)=0.92 “Permanent” status is assigned 360

359 -0.746)=0.9311 and s(0.901,0.122,0.15,-0.078, to node 6 (from node 5). 361

 8 Esra Çakı́r et al. / Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy environment

Iteration-4: Labels and “Temporary” status are assigned to neutrosophic fuzzy graph. Based on the Dijkstra’s 372
nodes reachable from nodes with “Permanent” status. algorithm, in each iteration undiscovered nodes are 373

Node Label Status found from the ways in which permanent nodes are 374

1 [(0.2,0.4,0.5,-0.5,-0.7,-0,3), -] Permanent connected. If these nodes are previously discovered 375

2 [(0.52,0.24,0.15,-0.25,-0.82,-0.51), 1] Permanent by another permanent node, the lowest weighted path 376
3 [(0.44,0.32,0.3,-0.35,-0.82,-0.44), 1] Permanent
4 [(0.72,0.096,0.21,-0.14,-0.91,-0.496), 3] Temporary is selected for this node by comparison. In this exam- 377

5 [(0.67,0.204,0.074,-0.194,-0.864,-0.56), 2] Permanent ple, apart from the classical algorithm, the departure 378

6 [(0.901,0.122,0.15,-0.078,-0.919,-0.912), 5] Temporary time (t̃s ) is set as (0.2, 0.4, 0.5, -0.5, -0.7, -0,3) and 379

f
the first node (start node) becomes a “Permanent” 380

roo
node. On the path from node 3 to node 2, time nega- 381

tively affects the weight. Likewise, the weight of the 382

paths from node 2 to node 5, from node 3 to node 5, 383

from node 4 to node 6 depends on time. The results of 384

shortest travel times and paths are listed as in Table 2. 385

rP
To compare the results with the applications in 386

the literature, this study is the pioneering applica- 387

tion to solve bipolar neutrosophic fuzzy graphs under 388

time-dependency with extended Dijkstra’s algorithm. 389

tho
Huang and Ding [13] first tried to find shortest paths 390
Iteration-5: Now, this iteration has no new nodes reachable from
“Permanent” status. However, new label is assigned to nodes
on time-dependent fuzzy networks by combining 391

reachable from new “Permanent” node. mechanisms of fuzzy simulation and genetic opti- 392

Node Label Status mization. Kolovsky et al. [14] investigated profile 393

1 [(0.2,0.4,0.5,-0.5,-0.7,-0,3), -] Permanent
search computation to find shortest path of a time- 394

dependent network with the ␧ -approximation. Their

Au
2 [(0.52,0.24,0.15,-0.25,-0.82,-0.51), 1] Permanent 395

3 [(0.44,0.32,0.3,-0.35,-0.82,-0.44), 1] Permanent methodology is based on label correcting algorithms. 396

4 [(0.72,0.096,0.21,-0.14,-0.91,-0.496), 3] Permanent Lin et al. [15] deal with fuzzy shortest path problem 397
5 [(0.65,0.258,0.574,-0.328,-0.575,-0.448), 2] Permanent
6 [(0.922,0.009,0.044,-0.02,-0.992,-0.746), 4] Temporary by developing an algorithm based on genetic algo- 398

[(0.901,0.122,0.15,-0.078,-0.919,-0.912), 5] rithm. Liao et al. [16] represented an algorithm for 399

fuzzy constrained shortest path algorithm consider-

d

400

ing uncertain time and cost information. They also 401

cte

showed that the fuzzy linear programming approach 402

of their problem is feasible. All these methods are 403

tried and proven on fuzzy graphs. The application pre- 404

sented in this article has been proposed based on these 405

studies. Thus, the application of this study is mean- 406

rre

ingful when compared with applications of previous 407

studies in the literature. 408

The results of given example show that extended 409

version of Dijkstra’s algorithm is applicable on time- 410

Finally, each node has “Permanent” status. Thus,
co

362 dependent fuzzy graphs. As bipolar neutrosophic 411

363 the algorithm is terminated. Using the label informa- fuzzy numbers are selected to express weights of 412
364 tion, the network is traced backwards, and shortest edges, proposed methodology handle with the short- 413
365 travel time from start node to end node is “node 1 est path and travel time problem. 414
Un

366 ->node 3 ->node 4 ->node 6”. Shortest path of each

367 node from start node (node 1) is illustrated in Fig. 4.
6. Conclusions 415

368 5. Results and discussions In the graph theory, networks consist of edges and 416

vertices with weights of crisp numbers. The weights 417

369 According to the proposed time-dependent fuzzy of vertices can be expressed as fuzzy numbers in 418

370 Dijkstra’s algorithm, all shortest travel times from order to adapt them in uncertainty situations and 419

371 start node are calculated for a time-dependent bipolar these values can vary on time. On a time-dependent 420
 Esra Çakı́r et al. / Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy environment 9

Table 2
Results of shortest travel times and paths from start node (node1)
Target Node Shortest Path Shortest travel time Score of travel time
2 1 ->2 (0.52,0.24,0.15,-0.25,-0.82,-0.51) 0.702
3 1 ->3 (0.44,0.32,0.3,-0.35,-0.82,-0.44) 0.622
4 1 ->3 ->4 (0.72,0.96,0.21,-0.14,-0.91,-0.496) 0.78
5 1 ->2 ->5 (0.67,0.204,0.074,-0.194,-0.864,-0.56) 0.771
6 1 ->2 ->5 ->6 (0.901,0.122,0.15,-0.078,-0.919,-0.912) 0.92

f
fuzzy graph, shortest path is considered as short- References

roo
421 461

422 est time travel. Therefore, Dijkstra’s label correcting

423 approach, which is applied to find shortest path on [1] L.A. Zadeh, Fuzzy sets, Inform. Control 8 (1965), 338–353. 462

424 classical graph, can be extended to the shortest travel [2] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy sets and Sys- 463
tems 20 (1986), 87–96. 464
425 time problem on a time-dependent graph with bipolar
[3] F. Smarandache, A Unifying Field in Logics. Neutroso- 465
neutrosophic fuzzy edges. The overall contribution of

rP
426
phy: Neutrosophic Probability, Set and Logic. Reboboth, 466
427 this article is to propose a combination of Dijkstra’s American Research Press (1998). 467

428 algorithm and bipolar neutrosophic fuzzy sets for a [4] P. Bosc and O. Pivert, On a fuzzy bipolar relational algebra, 468
Information Sciences 219 (2013), 1–16. 469
429 time-dependent network. By adapting to the bipolar [5] S. Broumi, A. Bakal, M. Talea, F. Smarandache and L. 470
430 neutrosophic fuzzy sets to Dijkstra’s algorithm, in Vladareanu, Applying Dijkstra’s algorithm for solving neu- 471

tho
431 each iteration, edges are compared with score val- trosophic shortest path problem. In: IEEE international 472

432 ues of fuzzy expressions and permanent paths are conference on advanced mechatronic systems (ICAMechS), 473
pp. 412–416 (2016). 474
433 constructed. According to the classical algorithm, [6] R. Şahin, An Introduction to Neutrosophic Graph Theory 475
434 shortest travel time for each node in the fuzzy graph with Applications, submitted (2016). 476

435 is calculated at the end of the iterations. An illus- [7] S. Broumi, M. Talea, A. Bakali and F. Smarandache, Appli- 477
Au
436 trative example of time-dependent fuzzy Dijkstra’s cation of Dijkstra’s algorithm for solving interval valued 478
neutrosophic shortest path problem. In: 2016 IEEE sympo- 479
437 algorithm on bipolar neutrosophic graphs is shown sium series on computational intelligence (SSCI), pp. 1–6 480
438 in step by step to prove the validity of proposed (2016). 481

439 methodology. Relevant researches from the literature [8] S. Naz, H. Rashmanlou and M.A. Malik, Operations on sin- 482

440 are given and discussed to demonstrate the validity gle valued neutrosophic graphs with application, In: Journal 483
of Intelligent & Fuzzy Systems 32(3) (2017), 2137–2151.
d

484
441 of the proposed methodology. [9] S. Broumi, M. Talea and F. Smarandache, Shortest path 485
442 For further research, we recommend using problem on single valued neutrosophic graphs. In: 2017 486
cte

443 time-dependent Dijkstra’s algorithm under fuzzy international symposium on networks, computers and com- 487
munications (ISNCC), pp. 1–8 (2017). 488
444 environment with other fuzzy extensions such as hes-
[10] H. Reddy, PATH FINDING – Dijkstra’s and A* Algorithms, 489
445 itant fuzzy sets, intuitionistic fuzzy sets, Pythagorean pp. 1–15 (2013). 490
446 fuzzy sets, spherical fuzzy sets etc. As a step [11] M. Barbehenn, A note on the complexity of Dijkstra’s 491

forward, cost values and danger factors can be algorithm for graphs with weighted vertices, IEEE Trans. 492
rre

447
Comput. 47(2) (1998), 263. 493
448 considered as well as time. We also advise compar- [12] R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network 494
449 ing other time-dependent shortest path algorithms Flow Theory, Algorithms, and Applications, Prentice-Hall, 495
450 such as Bellman-Ford algorithm, A* algorithm Englewood- Cliffs, NJ (1993). 496

451 with fuzzy numbers to demonstrate the effective- [13] W. Huang and L. Ding, The shortest path problem on a 497
co

fuzzy time-dependent network, in IEEE Transactions on 498

452 ness of algorithms on time-dependent fuzzy graphs. Communications 60(11) (2012), 3376–3385. 499
453 Besides technical developments, these methods can [14] F. Kolovský, J. Ježek and I. Kolingerová, The ␧- 500

454 be applied on different real-life problems such as Approximation of the Time-Dependent Shortest Path 501

cable network, telecommunication, route planning, Problem Solution for All Departure Times, ISPRS Int. J. 502
Un

455
Geo-Inf. 8 (2019), 538. 503
456 social networks, database search, cab traffics etc. [15] L. Lin, C. Wu and L. Ma, A genetic algorithm for the fuzzy 504
shortest path problem in a fuzzy network, Complex Intell. 505
Syst. (2020). 506
457 Acknowledgment [16] X. Liao, J. Wang and L. Ma, An algorithmic approach for 507
finding the fuzzy constrained shortest paths in a fuzzy graph, 508
Complex Intell. Syst. (2020). 509
458 “This work has been supported by the Scientific [17] I. Deli, M. Ali and F. Smarandache, Bipolar neutrosophic 510
459 Research Projects Commission of Galatasaray Uni- sets and their application based on multi-criteria deci- 511
460 versity under grant number # FBA-2020-1036”. sion making problems. In Advanced Mechatronic Systems
 10 Esra Çakı́r et al. / Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy environment

512 (ICAMechS), 2015 International Conference on IEEE, pp. [39] A. Patoghi, Z. Shakeri and M. Setak, A time-dependent 574
513 249–254 (2015). pollution routing problem in multi-graph, International 575
514 [18] W. Jigang, S.J.H. Jin and T. Srikanthan, Algorithm for time- Journal of Engineering 30(2) (2017), 234–242. 576
515 dependent shortest safe path on transportation networks, [40] B. Said, A. Bakali, M. Talea, F. Smarandache and L. 577
516 Procedia Computer Science 4 (2011), 958–966. Vladareanu, Applying Dijkstra’s algorithm for solving 578
517 [19] L. Zhao, T. Ohshima and H. Nagamochi, A* Algorithm for neutrosophic shortest path problem, ICAMechS (2016), 579
518 the time-dependent shortest path problem” (2008). 412–416. 580
519 [20] O. Ore, Theory of graphs, American Mathematical Society [41] E. Çakır and Z. Ulukan, “Bipolar Neutrosophic Fuzzy Dijk- 581
520 Colloquium Publications, American Mathematical Society stra’s algorithm and Its Application”, In: Kahraman C., 582
521 38 (1962). Cevik Onar S., Oztaysi B., Sari I., Cebi S., Tolga A. (eds) 583

f
522 [21] M.S. Sunitha and S. Mathew, Fuzzy graph theory: a survey, Intelligent and Fuzzy Techniques: Smart and Innovative 584

roo
523 Annals of Pure and Applied Mathematics 4(1) (2013), 92– Solutions. INFUS 2020. Advances in Intelligent Systems 585
524 110. and Computing, vol 1197. Springer, Cham, (2021). 586
525 [22] K.R. Bhutani and A. Batton, On M-strong fuzzy graphs, [42] M. Enayattabar, A. Ebrahimnejad and H. Motameni, 587
526 Information Sciences 15(59) (2003), 103–109. Dijkstra’s algorithm for shortest path problem under 588
527 [23] K.R. Bhutani, J.N. Mordeson and A. Rosenfeld, On degrees interval-valued Pythagorean fuzzy environment, Complex 589
528 of end nodes in fuzzy graphs, Iranian Journal of Fuzzy Intell. Syst. 5 (2019), 93–100. 590

rP
529 Graphs 1(1) (2004), 57–64. [43] G. Rahayuda and N. Santiari, “Fire Incident Emergency 591
530 [24] J.N. Mordeson and P.S. Nair, Arc disjoint fuzzy graphs, Response Plan using Hybrid Fuzzy Dijkstra”, 2019 1st Inter- 592
531 IEEE 7803 (1999), 5211–5214. national Conference on Cybernetics and Intelligent System 593
532 [25] A. Perchant and I. Bloch, Fuzzy morphism between graphs, (ICORIS), pp. 40–44 (2019). 594
533 Fuzzy Sets and Systems 128 (2002), 149–168. [44] B. Şahin, Route prioritization by using fuzzy analytic hier- 595
534 [26] M. Blue, B. Bush and J. Packett, United approach to fuzzy archy process extended dijkstra’s algorithm, Journal of ETA 596

tho
535 graph problems, Fuzzy sets and Systems 125 (2002), 355– Maritime Science 7(1) (2019), 3–15. 597
536 368. [45] B. Said, M. Talea, A. Bakali, F. Smarandache and S. Patro, 598
537 [27] S. Bershtein and T.A. Dziouba, “Allocation of maximal “On the Neutrosophic Counterpart of Bellman-Ford Algo- 599
538 bipartite part from fuzzy graph”, ESIT 2000, Aachen, Ger- rithm”, pp. 107–114 (2020). 600
539 many, pp. 14–15 (2000). [46] S. Uttendorf, “A fuzzy logic expert system for the auto- 601
540 [28] A. Alaoui, On Fuzzyfication of some concepts of Graphs, mated generation of roadmaps for automated guided vehicle 602
Au
541 Fuzzy Sets and Systems 101 (1999), 363–389. systems”, 2016 IEEE International Conference on Indus- 603
542 [29] S. Mathew and M.S. Sunitha, Types of arcs in a fuzzy graph, trial Engineering and Engineering Management (IEEM), pp. 604
543 Information Sciences 179(11) (2009), 1760–1768. 977–981 (2016). 605
544 [30] A. Koam, M. Akram and P. Liu, Decision-making analysis [47] R. Al-Kiyumi, C. Foh, S. Vural, P. Chatzimisios and R. 606
545 based on fuzzy graph structures, Mathematical Problems in Tafazolli, Fuzzy logic-based routing algorithm for lifetime 607
546 Engineering (2020). enhancement in heterogeneous wireless sensor networks, 608
547 [31] B. Davvaz, N. Jan, T. Mahmood and K. Ullah, Intuitionis- IEEE Transactions on Green Communications and Net- 609
d

548 tic fuzzy graphs of n th type with applications, Journal of working (2018). 610
549 Intelligent & Fuzzy Systems 36(4) (2019), 3923–3932. [48] A. Aziz, M.M. Farid and E. Suryani, “Floyd warshall 611
cte

550 [32] J. Dogra, S. Jain, A. Sharma, R. Kumar and M. Sood, Brain algorithm with FIS Sugeno for search evacuation route opti- 612
551 tumor detection from mr images employing fuzzy graph cut mization,” 2017 International Seminar on Application for 613
552 technique, Recent Patents on Computer Science 12 (2018). Technology of Information and Communication (iSeman- 614
553 [33] S. Mandal, N. Patra and M. Pal, Covering problem on fuzzy tic), Semarang, pp. 147–151 (2017). 615
554 graphs and its application in disaster management system, [49] B.A. Pramajuri, A. Gormantara, E. Widarti and A.J. San- 616
555 Soft Computing (2020). toso, “Recommendations for Tourism Sites Using the 617
rre

556 [34] S. Broumi, F. Smarandache, M. Talea and A. Bakali, An Mamdani Fuzzy Logic Method and Floyd Warshall Algo- 618
557 introduction to bipolar single valued neutrosophic graph rithm (Case Study in Yogyakarta),” 2019 International 619
558 theory, Applied Mechanics, and Materials 841 (2016). Conference on Information and Communications Tech- 620
559 [35] J. Zhan, M. Akram and M. Sitara, Novel decision-making nology (ICOIACT), Yogyakarta, Indonesia, pp. 590–595 621
560 method based on bipolar neutrosophic information, Soft (2019). 622
co

561 Computing 23 (2018). [50] G.U. Mali and D.K. Gautam, Shortest path evaluation in 623
562 [36] B. Said, A. Bakali, M. Talea, F. Smarandache and R. Verma, wireless network using fuzzy logic, Wireless Pers Commun 624
563 Computing minimum spanning tree in interval valued bipo- 100 (2018), 1393–1404. 625
564 lar neutrosophic environment, International Journal of [51] M. Lee, “Bipolar-valued fuzzy sets and their operations.” 626
565 Modeling and Optimization 7 (2017), 300–304. Proc. Int. Conf. on Intelligent Technologies, Bangkok, Thai- 627
Un

566 [37] H. Ayed, C.J. Galvez-Fernandez, Z. Habbas and D. land, 307–312 (2000). 628
567 Khadraoui, Solving time-dependent multimodal transport [52] K.J. Lee, Bipolar fuzzy subalgebras and bipolar fuzzy ideals 629
568 problems using a transfer graph model, Comput. Ind. Eng. of BCK/BCI-algebras, Bull. Malays. Math. Sci. Soc. 32/3 630
569 61 (2011), 391–401. (2009), 361–373. 631
570 [38] Y. Sun, X. Yu, R. Bie and H. Song, Discovering time-
571 dependent shortest path on traffic graph for drivers towards
572 green driving, Journal of Network and Computer Applica-
573 tions 83 (2017), 204–212.