Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment

Enayattabar, Mohammad; Ebrahimnejad, Ali; Motameni, Homayun

doi:10.1007/s40747-018-0083-y

Cited by 50 publications

(53 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Broumi et al [38] proposed matrix algorithm for MST in undirected IVNG. Enayattabar et al [39] applied Dijkstra algorithm to find the shortest path under IV Pythagorean fuzzy setting. Broumi et al [40] proposed IVN soft graphs.…”

Section: Literature Of Reviewmentioning

confidence: 99%

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

Nagarajan

Bakali

Talea

et al. 2019

Complex Intell. Syst.

View full text Add to dashboard Cite

Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval valued neutrosophic set. Most of the problems of real life involve some sort of uncertainty in it among which, one of the famous problem is finding a shortest path of the network. In this paper, a new score function is proposed for interval valued neutrosophic numbers and SPP is solved using interval valued neutrosophic numbers. Additionally, novel algorithms are proposed to find the neutrosophic shortest path by considering interval valued neutrosophic number, trapezoidal and triangular interval valued neutrosophic numbers for the length of the path in a network with illustrative example. Further, comparative analysis has been done for the proposed algorithm with the existing method with the shortcoming and advantage of the proposed method and it shows the effectiveness of the proposed algorithm.Keywords Interval valued triangular neutrosophic number · Interval valued trapezoidal neutrosophic number · Ranking methods · Deneutrosophication · Neutrosophic shortest path problem · Network Introduction and literature of reviewIn this part, introduction to the objective of the paper is given by presenting basic concepts and procedure of the shortest path problem (SPP) and the literature of review have been collected to know the recent work related to the presented concept which shows the novelty of the presented work * Said Broumi Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

show abstract

Section: Literature Of Reviewmentioning

confidence: 99%

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

Nagarajan

Bakali

Talea

et al. 2019

Complex Intell. Syst.

View full text Add to dashboard Cite

show abstract

“…Sci. 2019, 9,5016 3 of 14 control the vehicles' speed and the actual driving route. It makes the guiding route planning of the following vehicles difficult.…”

Section: Research Statusmentioning

confidence: 99%

“…Sci. 2019, 9,5016 10 of 14 As shown in Figure 10, there are two cars going on the automatic parking. The remaining time for each parking process is 50 s. There is also a car in the parking lot driving following the red line to the parking space pointed by the red arrow to start automatic parking.…”

Section: Simulation Analysismentioning

confidence: 99%

See 1 more Smart Citation

Anti-Congestion Route Planning Scheme Based on Dijkstra Algorithm for Automatic Valet Parking System

Jiang

Hua

2019

Applied Sciences

View full text Add to dashboard Cite

Featured Application: This anti-congestion route planning scheme will be used in the automatic valet parking area. It will have outstanding performance in the combination technology of V2X environment and driverless technology.Abstract: Based on the Dijkstra algorithm, with the parking parameters in the static state, the shortest route to each parking space of the parking lot without dynamic influence factors can be calculated. In the new technology background of the combination of the V2X environment and driverless technology, the dynamic influence factors, for example, the lanes occupancy situation caused by parking, can be considered to improve the shortest route with the new scheme in this paper. Then the final route that costs the least time to reach each parking space will be calculated. This is very important for the development of the intelligent transportation system in the parking lot environment.

show abstract

“…Elizabeth and Sujatha [33] solved FSPP using intervalvalued fuzzy matrices. Based on traditional Dijkstra algorithm, Enayattabar et al [34] solved SPP in the intervalvalued pythagorean fuzzy setting. Dey et al [35] formulated fuzzy shortest path problem with interval type 2 fuzzy numbers.…”

Section: Introduction and Review Of The Literaturementioning

confidence: 99%

Shortest path problem using Bellman algorithm under neutrosophic environment

Dey¹,

Talea

Bakali

et al. 2019

Complex Intell. Syst.

View full text Add to dashboard Cite

An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections. In this contribution, we consider SPP through Bellman's algorithm for a network using interval-valued neutrosophic numbers (IVNNs). We proposed a novel algorithm to obtain the neutrosophic shortest path between each pair of nodes. Length of all the edges is accredited an IVNN. Moreover, for the validation of the proposed algorithm, a numerical example has been offered. Also, a comparative analysis has been done with the existing methods which exhibit the advantages of the new algorithm.Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

show abstract

Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment

Cited by 50 publications

References 27 publications

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

Anti-Congestion Route Planning Scheme Based on Dijkstra Algorithm for Automatic Valet Parking System

Shortest path problem using Bellman algorithm under neutrosophic environment

Contact Info

Product

Resources

About