Study on Single Source Shortest Path Algorithms

UIU Institutional Repository

    • Login
    View Item 
    •   UIU DSpace Home
    • School of Science and Engineering (SoSE)
    • Department of Computer Science and Engineering (CSE)
    • B.Sc Thesis/Project
    • View Item
    •   UIU DSpace Home
    • School of Science and Engineering (SoSE)
    • Department of Computer Science and Engineering (CSE)
    • B.Sc Thesis/Project
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Study on Single Source Shortest Path Algorithms

    Thumbnail
    View/Open
    GA_FINAL_Single_Source_Shortest-path.pdf (3.165Mb)
    Date
    2017-12-18
    Author
    Ferdous, Jannatul
    Afser, Md.
    Shameem, Mejbah Uddin
    Milon, Md. Mahtab Hossain
    Metadata
    Show full item record
    Abstract
    Single Source Shortest Path Algorithm is one of the most used algorithm for routing and tracking path around the world for communication. Nowadays various famous apps are also using this algorithm to track the path and gaining information through the Google Map using different API. We implement Dijkstra, Floyd Warshall, Bellman Ford, Nearest Neighbor, Johnson algorithm for analysis then we implement shortest path algorithm using Genetic Algorithm. Genetic algorithms are used to solve optimization problems and we have tried to implement this optimization idea into shortest path algorithm to make an innovative shortest path calculation algorithm. The advantage of the algorithm is the more number of edges the less it will take time to calculate shortest path. This paper evaluates the various single source shortest path algorithms. We have implemented algorithms with graph to analysis the algorithm and then try to calculate shortest path with the Genetic Algorithm and then compare them with each other.
    URI
    http://dspace.uiu.ac.bd/handle/52243/152
    Collections
    • B.Sc Thesis/Project [82]

    Related items

    Showing items related by title, author, creator and subject.

    • Study on Single Source Shortest Path Algorithms 

      Afser, Md.; Shameem, Mejbah Uddin; Ferdous, Jannatul; Milon, Md. Mahtab Hossain (United International University, 2017-12-13)
      Single Source Shortest Path Algorithm is one of the most used algorithm for routing and tracking path around the world for communication. Nowadays various famous apps are also using this algorithm to track the path and ...
    • Study on Selected Greedy Algorithms 

      Rahman, Fairooz Maliha; Bhowmick, Supta; Eva, Luthfun Naher; Anu, Anwara Khatun (United International University, 2018-02-12)
      We studied some Greedy Algorithms, implemented to observe the in depth functionalities. We used the main idea of Knapsack problem to solve some problems which are inspired by real life applications. Afterwards we thought ...
    • Study on Selected Greedy Algorithms 

      Rahman, Fairooz Maliha; Bhowmick, Supta; Eva, Luthfun Naher; Anu, Anwara Khatun (United International University, 2018-01-31)
      We studied some Greedy Algorithms, implemented to observe the in depth functionalities. We used the main idea of Knapsack problem to solve some problems which are inspired by real life applications. Afterwards we thought ...

    Copyright 2003-2017 United International University
    Contact Us | Send Feedback
    Developed by UIU CITS
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Copyright 2003-2017 United International University
    Contact Us | Send Feedback
    Developed by UIU CITS