Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions
A communication network management system takes the measurements of its state variables at specific instants of time, considering them constant in the interval between two consecutive measurements. Nevertheless, this assumption is not true, since these variables evolve in real time. Therefore, uncer...
Main Authors: | Lissette Valdés, Alfonso Ariza, Sira M. Allende, Alicia Triviño, Gonzalo Joya |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-08-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/13/8/1534 |
Similar Items
-
Shortest Path Problem in Network with Type-2 Triangular Fuzzy Arc Length
by: Ranjan Kumar, et al.
Published: (2017-03-01) -
Shortest Path Search Futsal Field Location With Dijkstra Algorithm
by: Delpiah Wahyuningsih, et al.
Published: (2018-07-01) -
Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm
by: Elizabeth Nurmiyati Tamatjita, et al.
Published: (2016-09-01) -
Commentary - Methods to find all the edges on any of the shortest paths between two given nodes of a directed acyclic graph
by: Deepak Ahire, et al.
Published: (2021-05-01) -
Performance of shortest path algorithm based on parallel vertex traversal
by: Vesović Mihailo, et al.
Published: (2016-01-01)