Results 21 to 30 of about 569,188 (376)
The Steiner bi-objective shortest path problem
EURO 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
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem
IEEE Access, 2021 The clustered shortest-path tree problem (CluSPTP) is an extension of the classical single-source shortest-path problem, in which, given a graph with the set of nodes partitioned into a predefined, mutually exclusive and exhaustive set of clusters, we ...
Ovidiu Cosma +2 more
doaj +1 more source
The Shortest-Path Problem: Analysis and Comparison of Methods
The Shortest-Path Problem, 2014 Hector Ortega-Arranz +2 more
semanticscholar +2 more sources
A Novel Method for Solving Multi-objective Shortest Path Problem in Respect of Probability Theory
Tehnič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
A Pathfinding Problem for Fork-Join Directed Acyclic Graphs with Unknown Edge Length
Algorithms, 2021 In a previous paper by the author, a pathfinding problem for directed trees is studied under the following situation: each edge has a nonnegative integer length, but the length is unknown in advance and should be found by a procedure whose computational ...
Kunihiko Hiraishi
doaj +1 more source
On Dynamic Shortest Paths Problems [PDF]
Algorithmica, 2004 From the authors' abstract: ``We obtain the following results related to dynamic versions of the shortest-paths problem:'' (i) ``Reductions that show that the incremental and decremental single-source shortest-paths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static all-pairs shortest-paths ...
Roditty, Liam, Zwick, Uri
openaire +2 more sources
Analysis of Dijkstra’s Algorithm and A* Algorithm in Shortest Path Problem
Journal of Physics: Conference Series, 2020 Finding the shortest path in direction effective is essential. To solve this shortest path problem, we usually using Dijkstra or A* algorithm. These two algorithms are often used in routing or road networks. This paper’s objective is to compare those two
D. Rachmawati, Lysander Gustin
semanticscholar +1 more source
TD-H2H: Shortest Path Query on Time-Dependent Graphs [PDF]
Jisuanji kexue yu tansuo, 2023 A shortest path query on road networks is a fundamental problem, which has been studied widely. Existing studies usually model road networks as a static graph and query the path with the shortest distance between given vertices.
LI Xinling, WANG Yishu, YUAN Ye, GU Xiang, WANG Guoren
doaj +1 more source
A genetic algorithm for the fuzzy shortest path problem in a fuzzy network
Complex & Intelligent Systems, 2020 The shortest path problem (SPP) is an optimization problem of determining a path between specified source vertex s and destination vertex t in a fuzzy network.
Lihua Lin, Chu-Tao Wu, Li Ma
semanticscholar +1 more source
An Analysis of Stochastic Shortest Path Problems [PDF]
Mathematics of Operations Research, 1991 We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a probability distribution over the set of successor nodes so as to reach a certain destination node with minimum expected cost. The costs of transition between successive nodes can be positive as well as negative.
Dimitri P. Bertsekas, John N. Tsitsiklis
openalex +3 more sources