Affordable Access

Publisher Website

A modified ant colony system for finding the expected shortest path in networks with variable arc lengths and probabilistic nodes

Authors
Journal
Applied Soft Computing
1568-4946
Publisher
Elsevier
Volume
21
Identifiers
DOI: 10.1016/j.asoc.2014.03.020
Keywords
  • Ant Colony System (Acs)
  • Stochastic Networks
  • Expected Shortest Path
  • Probabilistic Nodes
  • Random Arc Lengths
Disciplines
  • Communication
  • Computer Science
  • Mathematics

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.