Heuristic methods for delay constrained least cost routing using κ-shortest-paths
Zhanfeng Jia
Varaiya, P.
Electr. Eng. & Comput. Sci. Dept., Univ. of California, Berkeley, CA, USA;
This paper appears in: Automatic Control, IEEE Transactions on
Publication Date: April 2006
Volume: 51,
Issue: 4
On page(s): 707- 712
ISSN: 0018-9286
INSPEC Accession Number: 8934986
Digital Object Identifier: 10.1109/TAC.2006.872827
Current Version Published: 2006-04-10
Abstract
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 is NP-complete. Many heuristic methods have been proposed for it. This note presents two new methods based on the κ-shortest-path (κ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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
