Results 1 to 10 of about 1,088 (68)
The Steiner bi-objective shortest path problem
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
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
Reverse shortest path problem for unit-disk graphs
Given a set P of n points in the plane, the unit-disk graph Gr(P) with respect to a parameter r is an undirected graph whose vertex set is P such that an edge connects two points p, q \in P if the Euclidean distance between p and q is at most r (the ...
Haitao Wang, Yiming Zhao
doaj +1 more source
Neutrosophic Shortest Path Problem [PDF]
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
Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
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
A Novel Method for Solving Multi-objective Shortest Path Problem in Respect of Probability Theory
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
Solving the Network Shortest Path Problem on a Quantum Annealer
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 +1 more source
Study on single-valued neutrosophic graph with application in shortest path problem
Fuzzy set and neutrosophic set are two efficient tools to handle the uncertainties and vagueness of any real-world problems. Neutrosophic set is more useful than fuzzy set (intuitionistic fuzzy sets) to manage the uncertainties of a real-life problem ...
Ruxiang Liu
doaj +1 more source
Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space
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
Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times [PDF]
Network flow problems are considered a vital branch of operations research. These problems are classified into static and time-varying classes. Network flow problems are time-varying in real application, because any flow must take a given amount of time ...
Gholamhasan Shirdel, Hasan Rezapour
doaj +1 more source

