ScholarLens Back to search
2019•Journal of Physics Conference SeriesOpen access

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

S J Zhang

Open full text 0 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Shortest path problem, K shortest path routing, Yen's algorithm, Constrained Shortest Path First, Shortest Path Faster Algorithm, Ant colony optimization algorithms, Computer science, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A dynamic shortest path algorithm based on an improved ant colony algorithm — Research Paper | ScholarLens