Learning automata-based algorithms for solving stochastic minimum spanning tree problem

@article{Torkestani2011LearningAA,
  title={Learning automata-based algorithms for solving stochastic minimum spanning tree problem},
  author={Javad Akbari Torkestani and Mohammad Reza Meybodi},
  journal={Appl. Soft Comput.},
  year={2011},
  volume={11},
  pages={4064-4077}
}
Due to the hardness of solving the minimum spanning tree (MST) problem in stochastic environments, the stochastic MST (SMST) problem has not received the attention it merits, specifically when the probability distribution function (PDF) of the edge weight is not a priori known. In this paper, we first propose a learning automata‐based sampling algorithm (Algorithm 1) to solve the MST problem in stochastic graphs where the PDF of the edge weight is assumed to be unknown. At each stage of the… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 18 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 53 REFERENCES

Similar Papers

Loading similar papers…