Journal
APPLIED SOFT COMPUTING
Volume 21, Issue -, Pages 491-500Publisher
ELSEVIER
DOI: 10.1016/j.asoc.2014.03.020
Keywords
Ant colony system (ACS); Stochastic networks; Expected shortest path; Probabilistic nodes; Random arc lengths
Ask authors/readers for more resources
The problem of finding the expected shortest path in stochastic networks, where the presence of each node is probabilistic and the arc lengths are random variables, have numerous applications, especially in communication networks. The problem being NP-hard we use an ant colony system (ACS) to propose a metaheuristic algorithm for finding the expected shortest path. A new local heuristic is formulated for the proposed algorithm to consider the probabilistic nodes. The arc lengths are randomly generated based on the arc length distribution functions. Examples are worked out to illustrate the applicability of the proposed approach. (C) 2014 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available