Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
A modified ant colony system for finding the expected shortest path in networks with variable arc lengths and probabilistic nodes
Farhanchi, M ; Sharif University of Technology
595
Viewed
- Type of Document: Article
- DOI: 10.1016/j.asoc.2014.03.020
- Abstract:
- 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
- Keywords:
- Expected shortest path ; Random arc lengths ; Ant colony optimization ; Stochastic systems ; Ant colony systems ; Arc length ; Probabilistic nodes ; Shortest path ; Stochastic networks ; Graph theory
- Source: Applied Soft Computing Journal ; Vol. 21, issue , August , 2014 , p. 491-500
- URL: http://www.sciencedirect.com/science/article/pii/S1568494614001276