Heuristic Methods for Delay Constrained Least Cost Routing Using$k$-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...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 51; no. 4; pp. 707 - 712
Main Authors Jia, Z., Varaiya, P.
Format Journal Article
LanguageEnglish
Published New York, NY Institute of Electrical and Electronics Engineers 01.04.2006
Subjects
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Control theory. Systems
Exact sciences and technology
Software
Graph path
Multicriteria analysis
Decision making
Multiobjective programming
Shortest path
Routing
Path planning
Distributed system
Modeling
Delay
multicriteria optimization
Computer network
Optimal trajectory
Heuristic method
NP complete problem
QoS routing
Optimal path
Combinatorics
Service quality
Numerical algorithm
Online AccessGet full text
ISSN0018-9286
DOI10.1109/TAC.2006.872827

Cover

More Information
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
ObjectType-Feature-1
content type line 23
ISSN:0018-9286
DOI:10.1109/TAC.2006.872827