Solving Stochastic Path Problem: Particle Swarm Optimization Approach

Authors:
Saeedeh Momtazi;Somayeh Kafi;Hamid Beigy
Affiliations:
Computer Engineering Department, Sharif University of Technology, Tehran, Iran;Computer Engineering Department, Sharif University of Technology, Tehran, Iran;Computer Engineering Department, Sharif University of Technology, Tehran, Iran and Institutes for Studies in Theoretical Physics and Mathematics (IPM), School of Computer Science, Tehran, Iran
Venue:
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Year:
2008

Citing 2
Cited 0

Stochastic shortest path problems with piecewise-linear concave utility functions

Management Science
Optimal paths in graphs with stochastic or multidimensional weights

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

An stochastic version of the classical shortest path problem whereby for each node of a graph, a probability distribution over the set of successor nodes must be chosen so as to reach a certain destination node with minimum expected cost. In this paper, we propose a new algorithm based on Particle Swarm Optimization (PSO) for solving Stochastic Shortest Path Problem (SSPP). The comparison of our algorithm with other algorithms indicates that its performance is suitable even by the less number of iterations.