Results 1 to 10 of about 1,363,530 (305)

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

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

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

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

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

The Steiner bi-objective shortest path problem

open access: yesEURO Journal on Computational Optimization, 2021
In this paper, we introduce the Steiner Bi-objective Shortest Path Problem. This problem is defined on a directed graph G=(V,A), with a subset T⊂V of terminals. Arcs are labeled with travel time and cost.
Hamza Ben Ticha   +3 more
doaj   +1 more source

INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM [PDF]

open access: yesThe International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2019
The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination.
S. Behzadi, M. Kolbadinejad
doaj   +1 more source

A Novel Method for Solving Multi-objective Shortest Path Problem in Respect of Probability Theory

open access: yesTehnički Glasnik, 2023
Transportation process or activity can be considered as a multi-objective problem reasonably. However, it is difficult to obtain an absolute shortest path with optimizing the multiple objectives at the same time by means of Pareto approach. In this paper,
Maosheng Zheng, Jie Yu
doaj   +1 more source

Random assignment and shortest path problems [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by
Johan Wästlund
doaj   +1 more source

Home - About - Disclaimer - Privacy