Route selection algorithms for networks with multiple constraints
In this dissertation, we implemented the shortest path algorithms and proposed a multi-constrainted routine algorithm that finds the k-shortest paths or routes with respect to a cost function based on the link weights and constraints.
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Theses and Dissertations |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/4834 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |