Heuristic Methods for Delay Constrained Least Cost Routing Using%24k-Shortest-Paths
The delay constrained least cost (DCLC) problem is to find the least cost path in a graph subject to a delay constraint. First formulated in the context of routing in computer networks, the DCLC model also applies to problems of path planning and other decision problems. DCLC isNP-complete. Many heu...
Saved in:
| Published in | IEEE transactions on automatic control Vol. 51; no. 4; pp. 707 - 712 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
01.04.2006
|
| Online Access | Get full text |
| ISSN | 0018-9286 |
| DOI | 10.1109/TAC.2006.872827 |
Cover
| Summary: | The delay constrained least cost (DCLC) problem is to find the least cost path in a graph subject to a delay constraint. First formulated in the context of routing in computer networks, the DCLC model also applies to problems of path planning and other decision problems. DCLC isNP-complete. Many heuristic methods have been proposed for it. This note presents two new methods based on thek-shortest-path(k SP)approach. These heuristic methods - one centralized, the other distributed - are both polynomial. In numerical experiments the proposed algorithms almost always find the optimal paths. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 content type line 23 ObjectType-Feature-1 |
| ISSN: | 0018-9286 |
| DOI: | 10.1109/TAC.2006.872827 |