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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series Vol. 1168; no. 5; pp. 52045 - 52049
Main Author: Zhang, S J
Format: Journal Article
Language:English
Published: Bristol IOP Publishing 01.02.2019
Subjects:
Algorithms
Ant colony optimization
Graphs
Intelligent transportation systems
Traffic models
Transportation networks
ISSN:1742-6588, 1742-6596
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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