2009•Techniques of Automation and ApplicationsRequires access

Research An Improved Ant Colony Algorithm of the Optimal Routing Problem

Zhang Hang

Abstract

Search for the shortest path in transportation network is one of the most important problem of ITS.This paper analyzes the basic ant colony algorithm and presents an improved algorithm on the heuristic direction information and renewal of pheromone.The results of the experimentation proved that the improved algorithm could find the shortest path more accurately and quickly than the basic algorithm,and it's feasible.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Key concepts: Ant colony optimization algorithms, Shortest path problem, Yen's algorithm, Path (computing), Heuristic, Shortest Path Faster Algorithm, K shortest path routing, Computer science