Results 61 to 70 of about 569,188 (376)
Dynamic Shortest Paths Methods for the Time-Dependent TSP
Algorithms, 2021 The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered.
Christoph Hansknecht +2 more
doaj +1 more source
International Journal of Analysis and Applications, 2023 The Shortest Path Problem is a core problem in network optimization, with applications in various scientific and engineering fields, such as communication, transportation, routing, scheduling, and computer networks.
K. Vidhya, A. Saraswathi
doaj +1 more source
Computing a rectilinear shortest path amid splinegons in plane
, 2017 We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain \calS to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define
DP Dobkin +16 more
core +1 more source
IEEE AccessPathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are known for their ability to guarantee optimal solutions ...
Amr Elshahed +4 more
doaj +1 more source
Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem
, 2018 Optimization is an effort to obtain the best results by considering the constraints, constraints, and limitations that exist on a problem; the goal is to minimize or suppress the things that harm and maximize the things that are considered profitable ...
A. Siahaan, M. Mesran
semanticscholar +1 more source
On the shortest $$\alpha$$-reliable path problem
TOP, 2021 In this variant of the constrained shortest path problem, the time of traversing an arc is given by a non-negative continuous random variable. The problem is to find a minimum cost path from an origin to a destination, ensuring that the probability of reaching the destination within a time limit meets a certain reliability threshold.
David Corredor-Montenegro +3 more
openaire +2 more sources
FEBS Open Bio, EarlyView.What factors make for an effective digital learning tool in Higher Education? This systematic review identifies elements of a digital tool that published examples reveal to be features of an engaging and impactful digital tool. A systematic literature search yielded 25 research papers for analysis.
Akmal Arzeman +4 more
wiley +1 more source
MATEC Web of Conferences, 2016 Under ideal condition, there are lots of Shortest Path Algorithms such as Dijkstra, Floyd, Johnson algorithms. However, putting these algorithms into use is not as we expected.
Luo Jian Feng, Chen Yu Qiang
doaj +1 more source
A fast layered path planning algorithm for job shop scheduling problem
IET Collaborative Intelligent Manufacturing, 2022 Job shop scheduling problem (JSP) is a classical system resource optimisation problem and also an NP hard problem. The search algorithm based on Akers obstacle graph model is an effective algorithm to solve JSP, which first removes part of jobs from the ...
Lin Huang, Shikui Zhao, Qing Han
doaj +1 more source
On the K shortest path trees problem [PDF]
European Journal of Operational Research, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sedeño-Noda, Antonio +1 more
openaire +1 more source