Efficient algorithm for finding k shortest paths based on re-optimization technique
| Year of publication: |
2020
|
|---|---|
| Authors: | Chen, Bi Yu ; Chen, Xiao-Wei ; Chen, Hui-Ping ; Lam, William H. K. |
| Published in: |
Transportation research / E : an international journal. - Amsterdam : Elsevier, ISSN 1366-5545, ZDB-ID 1380969-6. - Vol. 133.2020, p. 1-13
|
| Subject: | K shortest path problem | Lifelong planning A* | Re-optimization technique | Algorithmus | Algorithm | Operations Research | Operations research | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
An approximation algorithm for multi-allocation hub location problems
Jost, Niklas, (2025)
-
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
Barkel, Mathijs, (2025)
-
A (slightly) improved approximation algorithm for metric TSP
Karlin, Anna R., (2024)
- More ...
-
Zhang, Junlong, (2016)
-
Zhang, Junlong, (2013)
-
Finding reliable shortest paths in road networks under uncertainty
Chen, Bi Yu, (2013)
- More ...