An optimization study based on Dijkstra algorithm for a network with trapezoidal picture fuzzy numbers
Path finding models attempt to provide efficient approaches for finding shortest paths in networks. A well-known shortest path algorithm is the Dijkstra algorithm. This paper redesigns it in order to tackle situations in which the parameters of the networks may be uncertain. To be precise, we allow...
Saved in:
| Published in: | Neural computing & applications Vol. 33; no. 4; pp. 1329 - 1342 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
London
Springer London
01.02.2021
Springer Nature B.V |
| Subjects: | |
| ISSN: | 0941-0643, 1433-3058 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!