Results 241 to 250 of about 286,038 (288)
Some of the next articles are maybe not open access.
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
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.
Aneja, Y. P., Nair, K. P. K.
openaire +2 more sources
1970
The first image that comes to mind when the word ‘network’ is mentioned is a traffic network, whether it be road or air traffic. Most of us are familiar with such networks since one rarely travels from one location to another without consulting a ‘map’, which is, in our terminology, a ‘network’.
openaire +1 more source
The first image that comes to mind when the word ‘network’ is mentioned is a traffic network, whether it be road or air traffic. Most of us are familiar with such networks since one rarely travels from one location to another without consulting a ‘map’, which is, in our terminology, a ‘network’.
openaire +1 more source
Uncertain random shortest path problem
Soft Computing, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheng, Yuhong, Mei, Xuehui
openaire +1 more source
Reoptimization procedures in shortest path problem
Rivista di Matematica per le Scienze Economiche e Sociali, 1980In most algorithms for Transportation and Communication Models a sequence of Shortest Path Problems must be solved, where each problem is only slightly different from the preceding. Computational procedures are proposed to find the new shortest paths starting from the old shortest paths in two cases: i) the node from which the shortest paths are to be ...
openaire +2 more sources
Stochastic shortest-path problems
1991Abstract The final section of Chapter 8 introduced multistate systems: those in which the components assume a finite number of distinct modes. One particular instance of this type of system frequently arises in the modelling of various transportation, communication, and project planning networks.
openaire +1 more source