Results 11 to 20 of about 569,188 (376)
A Bio-Inspired Method for the Constrained Shortest Path Problem [PDF]
The Scientific World Journal, 2014 The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem.
Hongping Wang +4 more
doaj +3 more sources
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem [PDF]
The Scientific World Journal, 2014 Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P.
Xiaoge Zhang +5 more
doaj +3 more sources
Solving the Network Shortest Path Problem on a Quantum Annealer
IEEE Transactions on Quantum Engineering, 2020 This article addresses the formulation for implementing a single source, single-destination shortest path algorithm on a quantum annealing computer. Three distinct approaches are presented.
Thomas Krauss, Joey McCollum
doaj +2 more sources
On Solving the Quadratic Shortest Path Problem [PDF]
INFORMS Journal on Computing, 2017 The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized.
Hao Hu, R. Sotirov
semanticscholar +6 more sources
Neutrosophic Shortest Path Problem [PDF]
Neutrosophic 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 +2 more sources
The shortest path problem in the stochastic networks with unstable topology. [PDF]
Springerplus, 2016 Shirdel GH, Abdolhosseinzadeh M.
europepmc +3 more sources
Interval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem
Mathematics, 2016 The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. The uncertainty existing in the real world problems makes it difficult to determine the arc lengths exactly.
Arindam Dey, Anita Pal, Tandra Pal
doaj +2 more sources
Shortest Path Problem under Interval Valued Neutrosophic Setting
, 2015 Said Broumi
openalex +2 more sources
On the Quadratic Shortest Path Problem [PDF]
The Sea, 2015 Finding the shortest path in a directed graph is one of the most important combinatorial optimization problems, having applications in a wide range of fields. In its basic version, however, the problem fails to represent situations in which the value of the objective function is determined not only by the choice of each single arc, but also by the ...
Borzou Rostami +3 more
semanticscholar +4 more sources
Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
Journal 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