Figure 11 - uploaded by Fandy Setyo Utomo
Content may be subject to copyright.
Source publication
Finding shortest and safest path during emergency situation is critical. In this paper, an indoor navigation during an emergency time is investigated using the combination of Voronoi Diagram and fuzzy number. The challenge in indoor navigation is to analyses the network when the shortest path algorithm does not work as always expected. There are so...
Similar publications
In transportation network modeling, Braess's paradox is a phenomenon in which the addition of links results in the increase in total system travel time in user equilibrium (UE) flows. In this study, we investigate UE flows and Braess’s paradox in scale-free networks, which have been recently used to model large scale networks including road network...
Citations
... Torad and Hossamel-din [10] implemented (Dijkstra's algorithm) to find the first shortest path to a hospital with the right blood type to reduce the time needed to find the best hospital. Suryana et al. [11] combine four algorithms to find the shortest safe path in emergencies in an indoor environment, the network model was using one sensor data. Tarapata [12] uses a fast and modified version of Dijkstra's algorithm and effective data structures to analyze the complexity of a selected multi-objective shortest path problem. ...
... As shown in Table 2, the shortest path for 5 nodes, the shortest path of nodes no. (6,11,12,13,19,23,26) are also matched with what is shown in the table. For instance, the shortest path between node 6 and node 50 was 6-23-50, which can prove that the algorithm finds the best value of the objective function. ...
span lang="EN-US">The shortest path problem has many different versions. In this manuscript, we proposed a muti-constrained optimization method to find the shortest path in a computer network. In general, a genetic algorithm is one of the common heuristic algorithms. In this paper, we employed the genetic algorithm to find the solution of the shortest path multi-constrained problem. The proposed algorithm finds the best route for network packets with minimum total cost, delay, and hop count constrained with limited bandwidth. The new algorithm was implemented on four different capacity networks with random network parameters, the results showed that the shortest path under constraints can be found in a reasonable time. The experimental results showed that the algorithm always found the shortest path with minimal constraints.</span
