title: A genetic algorithm for the arrival probability in the stochastic networks.
abstract: A genetic algorithm is presented to find the arrival probability in a directed acyclic network with stochastic parameters, that gives more reliability of transmission flow in delay sensitive networks. Some sub-networks are extracted from the original network, and a connection is established between the original source node and the original destination node by randomly selecting some local source and the local destination nodes. The connections are sorted according to their arrival probabilities and the best established connection is determined with the maximum arrival probability. There is an established discrete time Markov chain in the network. The arrival probability to a given destination node from a given source node in the network is defined as the multi-step transition probability of the absorbtion in the final state of the established Markov chain. The proposed method is applicable on large stochastic networks, where the previous methods were not. The effectiveness of the proposed method is illustrated by some numerical results with perfect fitness values of the proposed genetic algorithm.
authors.affiliation: Department of Mathematics, Faculty of Basic Science, University of Qom, Qom, Iran.
authors.forename: Gholam H
authors.initials: GH
authors.lastname: Shirdel
authors.affiliation: Department of Mathematics, Faculty of Basic Science, University of Qom, Qom, Iran.
authors.forename: Mohsen
authors.initials: M
authors.lastname: Abdolhosseinzadeh
keywords: Arrival probability; Discrete time Markov chain; Genetic algorithm; Stochastic network