Results 81 to 90 of about 3,311 (160)

Differential evolution in shortest path problems

open access: yes, 2011
This paper proves that the Di erential Evolution (DE) algorithm is valid to solve the Shortest Path (SP) problem in random, median sized networks. From the trials, we have obtained an 9% accuracy, in the worst case scenario.
Guerreiro, Pedro   +2 more
openaire   +2 more sources

Variants of the Shortest Path Problem [PDF]

open access: yes, 2011
The shortest path problem in which the \((s,t)\)-paths \(P\) of a given digraph \(G =(V,E)\) are compared with respect to the sum of their edge costs is one of the best known problems in combinatorial optimization. The paper is concerned with a number of variations of this problem having different objective functions like bottleneck, balanced, minimum ...
openaire   +1 more source

On Shortest Path Problems with “Non-Markovian” Link Contribution to Path Lengths

open access: bronze, 2000
Arunabha Sen   +4 more
openalex   +1 more source

Home - About - Disclaimer - Privacy