• Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


      Shortest path problem; Fuzzy random arc; Dijkstra’s algorithm; Network; Trapezoidal fuzzy number.

    • Abstract


      This paper considers a shortest path problem in an imprecise and random environment. The edges in the network represent the approximate time required to cover the distance from one vertex to another vertex while the traffic conditions change randomly for each edge. The approximate time has been defined by using trapezoidal fuzzy number whereas the traffic conditions has been defined in linguistic term. Such type of network problem can be called as Fuzzy Stochastic Shortest Path Problem (FSSPP) in imprecise and random environment. In order to solve the model, a method has been proposed based on the Dijkstra’s algorithm and some numerous example have been solved to present its effectiveness

    • Author Affiliations



      1. Department of Mathematics, VNIT Nagpur, Nagpur, India
      2. Department of Mathematics, IIT Kharaghpur, Kharaghpur, India
    • Dates

  • Sadhana | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.