Generalized Shortest Path Problem in Uncertain Environment Based on PSO
Hayder A. Mukhef, Ekhlas M. Farhan and Mohammed R. Jassim
DOI : 10.3844/jcssp.2008.349.352
Journal of Computer Science
Volume 4, Issue 4
Generalized network problems describe situations in which flow can be generated or consumed through arcs. This research considers generalized shortest path problem in stochastic environment in which the changing rate of flow is random. To satisfy the demands of decision makers, three types of models have been formulated to solve the generalized shortest path problem under different decision criteria. The PSO algorithm is build to solve the generalized shortest path problem in stochastic environment. Finally, a numerical example is given to illustrate the effectiveness of the given algorithm.
© 2008 Hayder A. Mukhef, Ekhlas M. Farhan and Mohammed R. Jassim. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.