Generalized path-finding algorithms on semirings and the fuzzy shortest path problem

@inproceedings{Boulmakoul2004GeneralizedPA,
  title={Generalized path-finding algorithms on semirings and the fuzzy shortest path problem},
  author={Azedine Boulmakoul},
  year={2004}
}
A new dioid structure (ωk;,⊕, ⊗, e, e) is proposed to solve a path-finding problem in a fuzzy graph. This algebraic structure is adapted precisely to solve the problem of the K-best fuzzy shortest paths. We demonstrate that the generalized Gauss-Seidel's algorithm always converges for the solving of the K-best fuzzy shortest paths problem on a valued fuzzy graph without cycles of negative weight. This work starts a safe extension of the path algebra paradigm to valued fuzzy graphs for the… CONTINUE READING

Similar Papers

Citations

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

A Hybrid Method in Informed Search: Fuzzy Simplified Memory-Bounded A* Approach

  • 2010 International Conference on Computational Intelligence and Communication Networks
  • 2010
VIEW 1 EXCERPT
CITES METHODS