Results 11 to 20 of about 391,490 (227)

Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm

open access: yesJournal of Computing Research and Innovation, 2020
The shortest path is an issue that involves the route from one point (nodes) to another. It is to find a path with a minimum travelling time. Nowadays, traffic problems have affected many transport users especially in Kuala Lumpur area.
Nur Syuhada Muhammat Pazil   +2 more
doaj   +5 more sources

Neutrosophic Shortest Path Problem [PDF]

open access: yesNeutrosophic Sets and Systems, 2018
Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to ...
Ranjan Kumar   +4 more
doaj   +1 more source

Commentary - Methods to find all the edges on any of the shortest paths between two given nodes of a directed acyclic graph [PDF]

open access: yesResearch Ideas and Outcomes, 2021
This article puts forth all the existing methods proposed by the various authors of the Stack Exchange community to find all the edges on any shortest path between two given nodes of a directed acyclic graph. For a directed acyclic graph with N number of
Deepak Ahire, Omkar Jadhav
doaj   +3 more sources

Design and Calculation of Evaluation Index for Urban Road Anti-Blocking Ability

open access: yesPromet (Zagreb), 2023
Aiming at the lack of an anti-clogging ability index in the road network traffic evaluation index, an anti-clogging ability index was proposed to measure the anti-clogging ability of urban road traffic network: Κ-anti-clogging coefficient, which is used ...
Ronghu Zhou, Qin Ge
doaj   +1 more source

Performance of shortest path algorithm based on parallel vertex traversal [PDF]

open access: yesSerbian Journal of Electrical Engineering, 2016
Shortest path algorithms for different applications, such as Internet routing, VLSI design and so on are used. Dijkstra and Bellman-Ford are commonly used shortest path algorithms which are typically implemented in networks with hundreds of ...
Vesović Mihailo   +2 more
doaj   +1 more source

top-k Path Greedy Generalization Algorithm of Anonymity Shortest Path [PDF]

open access: yesJisuanji gongcheng, 2016
With the development of social networks,the issues of privacy preservation arouse extensive attention.It can cause privacy disclosure of the shortest path if weighted social network data are protected before its publication.In order to solve this issue ...
CHEN Weihe,DING Leilei
doaj   +1 more source

Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space

open access: yesJournal of Advanced Transportation, 2022
Finding the shortest path of the traveling salesman problem (TSP) is a typical NP-hard problem and one of the basic optimization problems. TSP in three-dimensional space (3D-TSP) is an extension of TSP. It plays an important role in the fields of 3D path
Hongtai Yang   +5 more
doaj   +1 more source

Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network [PDF]

open access: yesEAI Endorsed Transactions on Industrial Networks and Intelligent Systems, 2017
The shortest path finding algorithm is used in many problems on graphs and networks. This article will introduce the algorithm to find the shortest path between two vertices on the extended graph.
Chien Tran Quoc, Hung Ho Van
doaj   +1 more source

Shortest Paths between Shortest Paths and Independent Sets [PDF]

open access: yes, 2011
We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length.
Kaminski, Marcin   +2 more
openaire   +2 more sources

Path planning for autonomous mobile robots using multi-objective evolutionary particle swarm optimization.

open access: yesPLoS ONE, 2022
In this article, a new path planning algorithm is proposed. The algorithm is developed on the basis of the algorithm for finding the best value using multi-objective evolutionary particle swarm optimization, known as the MOEPSO. The proposed algorithm is
Ittikon Thammachantuek, Mahasak Ketcham
doaj   +1 more source

Home - About - Disclaimer - Privacy