Matches in UGent Biblio for { <https://biblio.ugent.be/publication/3064680#aggregation> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- aggregation classification "A1".
- aggregation creator person.
- aggregation creator person.
- aggregation date "2012".
- aggregation format "application/pdf".
- aggregation hasFormat 3064680.bibtex.
- aggregation hasFormat 3064680.csv.
- aggregation hasFormat 3064680.dc.
- aggregation hasFormat 3064680.didl.
- aggregation hasFormat 3064680.doc.
- aggregation hasFormat 3064680.json.
- aggregation hasFormat 3064680.mets.
- aggregation hasFormat 3064680.mods.
- aggregation hasFormat 3064680.rdf.
- aggregation hasFormat 3064680.ris.
- aggregation hasFormat 3064680.txt.
- aggregation hasFormat 3064680.xls.
- aggregation hasFormat 3064680.yaml.
- aggregation isPartOf urn:issn:1365-8816.
- aggregation language "eng".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Science General".
- aggregation title "An effective heuristic for computing many shortest path alternatives in road networks".
- aggregation abstract "We propose a simple and effective heuristic that allows fast generation of a large set of shortest path alternatives in weighted directed graphs. The heuristic is based on existing deviation path algorithms for exact k shortest paths. It precalculates a backward shortest path tree and thus avoids doing many shortest path computations, but as a result it does not necessarily find the exact set of k shortest paths. Computational results on real-world road networks are reported. Our tests show that the quality of the paths produced by the heuristic is most satisfactory: typically, the kth path found by the heuristic is less than 1% longer than the exact kth shortest path, for values of k up to 10,000. Moreover, the heuristic runs very fast. We also show how the heuristic can be enhanced to an exact k shortest paths algorithm, which performs well in comparison with the existing exact k shortest path algorithms.".
- aggregation authorList BK768939.
- aggregation endPage "1050".
- aggregation issue "6".
- aggregation startPage "1031".
- aggregation volume "26".
- aggregation aggregates 3064854.
- aggregation isDescribedBy 3064680.
- aggregation similarTo 13658816.2011.620572.
- aggregation similarTo LU-3064680.