Results 211 to 220 of about 22,360 (263)
Some of the next articles are maybe not open access.
Solvingk-shortest and constrained shortest path problems efficiently
Annals of Operations Research, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Skiscim, Christopher C. +1 more
openaire +2 more sources
Computers & Industrial Engineering, 1994
Abstract We discuss the problem of finding the shortest paths from a fixed origin to a specified nodes in a network with arcs represented as intervals on real line. As a preliminary, we define the order relation between intervals by using two parameters.
Shinkoh Okada, Mitsuo Gen
openaire +1 more source
Abstract We discuss the problem of finding the shortest paths from a fixed origin to a specified nodes in a network with arcs represented as intervals on real line. As a preliminary, we define the order relation between intervals by using two parameters.
Shinkoh Okada, Mitsuo Gen
openaire +1 more source
On Bounded Leg Shortest Paths Problems
Algorithmica, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roditty, Liam, Segal, Michael
openaire +2 more sources
Upgrading Shortest Path Problems
2023There are several areas where the shortest path problem exists.One well-known algorithm is the Dijkstra Algorithm.The "Dijkstra Algorithm" has one flaw, according to the results of the experiments, namely that it doesn't deal with the issue of adjacent vertices in the shortest path.The algorithm has seen substantial improvement.
Shra Fatima, Kamlesh Chandra Maurya
openaire +1 more source
The Fixed-Charge Shortest-Path Problem
INFORMS Journal on Computing, 2012Consider a network 𝒩 =(N, A) and associate with each arc e ∈ A a fixed cost ce for using arc e, an interval [le, ue] (le, ue ∈ ℤ) specifying the range of allowable resource consumption quantities along arc e, and a per-unit cost [Formula: see text] for resource consumed along e.
Engineer, Faramroze G. +3 more
openaire +2 more sources
2007
In this chapter we consider the shortest route problem where distances/costs are not known precisely and are modeled using fuzzy numbers. The fuzzy shortest route problem is outlined in the next section. We have previously used an evolutionary algorithm to solve an example problem (Section 6.5.1 of [2] and [3]).
James J. Buckley, Leonard J. Jowers
openaire +1 more source
In this chapter we consider the shortest route problem where distances/costs are not known precisely and are modeled using fuzzy numbers. The fuzzy shortest route problem is outlined in the next section. We have previously used an evolutionary algorithm to solve an example problem (Section 6.5.1 of [2] and [3]).
James J. Buckley, Leonard J. Jowers
openaire +1 more source
Shortest Paths with Shortest Detours
Journal of Optimization Theory and Applications, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carolin Torchiani +3 more
openaire +1 more source
On the Robust Shortest Path Problem
Computers & Operations Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gang, Yu, Jian, Yang
openaire +2 more sources
The Variance-Constrained Shortest Path Problem
Transportation Science, 1994This paper discusses the variance-constrained shortest path problem. This problem can be used to model any application in which the travel costs on a link are not deterministic, but follow a distribution that has possible correlation with travel cost on other links.
Sivakumar, Raj A., Batta, Rajan
openaire +2 more sources
Solving the shortest path tour problem
European Journal of Operational Research, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Festa P +3 more
openaire +3 more sources