By Topic

An Algorithm for Dynamic Optimal Path Selection with Constraint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaogang Qi ; Dept. of Appl. Math., Xidian Univ., Xi''an ; Lifang Liu ; Sanyang Liu

Optimal path selection (OPS) with unique or multiple constraints is one of key issues in the dynamic networks, in which arc' weight metric is an interval number. Firstly, some existing solutions for this problem are analyzed, and some shortages and flaws are pointed out. Secondly, regularities of distribution of the summation of multiple independent random numbers with same and different distributions are analyzed and formulated by data simulating and fitting. Furthermore, an algorithm named DOPS_Const for the OPS with an additive arc weight is proposed based on the above analysis, and the randomness and subjectivity in path selection can be avoided according to the algorithm. Finally, the theoretical and statistical probabilities of the selected path satisfying the given constraint are compared, and our algorithm is feasible and valid to solve the OPS with constraint in the dynamic networks.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008