Classical and Heuristic Algorithms Used in Solving the Shortest Path Problem and Time Complexity

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Konuralp Journal of Mathematics
Volume:8 Issue:2
Classical and Heuristic Algorithms Used in Solving the Shortest Path Problem and Time Complexity

Classical and Heuristic Algorithms Used in Solving the Shortest Path Problem and Time Complexity

Authors : Öznur İŞÇİ GÜNERİ, Burcu DURMUŞ

Pages : 279-283

View : 69 | Download : 19

Publication Date : 2020-10-27

Article Type : Research Paper

Abstract :Optimization is the process of obtaining the most appropriate solution for a specific purpose and within the constraints given. In mathematical sense, it can be expressed as minimizing or maximizing a function. In this study, one of the optimization problems, the shortest path problem, is discussed. Classical and heuristic algorithms developed for solving shortest path problems are widely used. In this study, from the classical algorithms, Dijkstra, Bellman Ford, Johnson algorithms and from heuristic algorithms, Genetic, Scaling and Dinitz algorithms are examined. In this context, the complexities of the algorithms were investigated and comparisons were made. The results obtained from the examinations are presented with tables and graphs.
Keywords : Optimization, shortest path problems, Classic algorithm, Heuristic algorithms, Complexity

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.