Results 311 to 320 of about 779,089 (370)
Some of the next articles are maybe not open access.
An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints
Transportation Science, 2016The elementary shortest path problem with resource constraints ESPPRC is an NP-hard problem that often arises in the context of column generation for vehicle routing problems. We propose an exact solution method that relies on implicit enumeration with a
Leonardo Lozano, D. Duque, A. Medaglia
semanticscholar +1 more source
Computation of shortest path problem in a network with SV-trapezoidal neutrosophic numbers
International Conference on Advanced Mechatronic Systems, 2016In this work, a neutrosophic network method is proposed for finding the shortest path length with single valued trapezoidal neutrosophic number. The proposed algorithm gives the shortest path length using score function from source node to destination ...
S. Broumi +4 more
semanticscholar +1 more source
Shortest path problem on single valued neutrosophic graphs
International Symposium on Networks, Computers and Communications, 2017A single valued neutrosophic graph is a generalized structure of fuzzy graph, intuitionistic fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs and ...
S. Broumi, M. Talea
semanticscholar +1 more source
Shortest Path Problem in Network with Type-2 Triangular Fuzzy Arc Length
, 2017In traditional shortest path problem it is always determined that the parameters (Time, Cost and Distance etc.) are fixed between different nodes. But in real life situations where uncertain parameters exist, parameters are considered as fuzzy numbers ...
Ranjan Kumar, S. Jha, Ramayan Singh
semanticscholar +1 more source
On the difficulty of some shortest path problems
ACM Transactions on Algorithms, 2003We prove superlinear lower bounds for some shortest path problems in directed graphs, where no such bounds were previously known. The central problem in our study is the replacement paths problem: Given a directed graph G with non-negative edge weights, and a shortest path P
Subhash Suri +2 more
openaire +3 more sources
Cost Projection Methods for the Shortest Path Problem with Crossing Costs
Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, 2017Real world routing problems, e.g., in the airline industry or in public and rail transit, can feature complex non-linear cost functions. An important case are costs for crossing regions, such as countries or fare zones.
Marco Blanco +6 more
semanticscholar +1 more source
Shortest Path Problem under Bipolar Neutrosphic Setting
, 2016This main purpose of this paper is to develop an algorithm to find the shortest path on a network in which the weights of the edges are represented by bipolar neutrosophic numbers.
S. Broumi +4 more
semanticscholar +1 more source
The constrained shortest path problem
Naval Research Logistics Quarterly, 1978AbstractThe shortest path problem between two specified nodes in a general network possesses the unimodularity property and, therefore, can be solved by efficient labelling algorithms. However, the introduction of an additional linear constraint would, in general, destroy this property and the existing algorithms are not applicable in this case.
Yash P. Aneja, K. P. K. Nair
openaire +2 more sources
Comput. Aided Civ. Infrastructure Eng., 2015
This article employs a robust optimization approach for the shortest path problem where travel cost is uncertain and exact information on the distribution function is unavailable. We show that under such conditions the robust shortest path problem can be
M. Shahabi, A. Unnikrishnan, S. Boyles
semanticscholar +1 more source
This article employs a robust optimization approach for the shortest path problem where travel cost is uncertain and exact information on the distribution function is unavailable. We show that under such conditions the robust shortest path problem can be
M. Shahabi, A. Unnikrishnan, S. Boyles
semanticscholar +1 more source
On the Robust Shortest Path Problem
Computers & Operations Research, 1998Abstract The shortest path problem is of great importance to the real world in such areas as transportation, network design, telecommunication, etc. The deterministic version of the problem is easily solved. However, in the real world, uncertainty is frequently encountered and must be dealt with.
Gang Yu, Jian Yang
openaire +2 more sources