A dynamic shortest path algorithm based on an improved ant colony algorithm

The shortest path problem is the key problem in intelligent transportation systems. In this paper, the shortcomings of classical shortest path algorithms in solving the dynamic shortest path problem are analyzed. A dynamic traffic network model is constructed, and the characteristics of an ant colon...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of physics. Conference series Ročník 1168; číslo 5; s. 52045 - 52049
Hlavní autor: Zhang, S J
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 01.02.2019
Témata:
Algorithms
Ant colony optimization
Graphs
Intelligent transportation systems
Traffic models
Transportation networks
ISSN:1742-6588, 1742-6596
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The shortest path problem is the key problem in intelligent transportation systems. In this paper, the shortcomings of classical shortest path algorithms in solving the dynamic shortest path problem are analyzed. A dynamic traffic network model is constructed, and the characteristics of an ant colony algorithm are analyzed. According to the characteristics of the traffic network, a dynamic shortest path algorithm is proposed based on an improved ant colony algorithm. A simulation experiment showed that the algorithm proposed in this paper could effectively find the shortest path in a dynamic traffic network.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1168/5/052045