2019
DOI: 10.5194/isprs-archives-xlii-4-w18-201-2019
|View full text |Cite
|
Sign up to set email alerts
|

Introducing a Novel Method to Solve Shortest Path Problems Based on Structure of Network Using Genetic Algorithm

Abstract: Abstract. The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination. Network analysis provides strong decision support for users in searching shortest path. A lot of algorithms are designed for solving shortest path but most of them did not considered the conditions of the networks. Genetic Algorithm is a kind of Algorithm that has a lot of efficiency … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 26 publications
0
2
0
Order By: Relevance
“…One of the problems with the Dijkstra algorithm was that to find the shortest path, it checked all the vertices in all directions and after this long process, reached the top of the destination (Behzadi and Alesheikh, 2008b;Behzadi and Alesheikh, 2014b;Behzadi et al, 2008;Behzadi and Kolbadinejad, 2019). To solve this problem, algorithm A* was proposed.…”
Section: Algorithm A*mentioning
confidence: 99%
“…One of the problems with the Dijkstra algorithm was that to find the shortest path, it checked all the vertices in all directions and after this long process, reached the top of the destination (Behzadi and Alesheikh, 2008b;Behzadi and Alesheikh, 2014b;Behzadi et al, 2008;Behzadi and Kolbadinejad, 2019). To solve this problem, algorithm A* was proposed.…”
Section: Algorithm A*mentioning
confidence: 99%
“…Tehran has an area of about 730 square kilometers. Tehran Municipality has divided the city into 22 municipal districts as seen in Figure 1 (Behzadi & Alesheikh, 2008;Behzadi & Kolbadinejad, 2019;Jafarian & Behzadi, 2020).…”
Section: The Study Areamentioning
confidence: 99%