Solving Routing Problem of Vehicle Navigation System by Ant Colony Optimization Algorithm

Computer & Telecommunication

Current Issue | Archive | Adv Search

Che Gaofeng，Lu Yueran，Tan Jun

College of Information Engineering

Download:

PDF(0KB)
Export: BibTeX | EndNote (RIS)

Abstract Using the properties of ergodicity, randomicity and regularity of ant colony algorithm, ant colony optimization (ACO) algorithm is analyzed to solve routing problem of vehicle navigation system. Simulation results show that chaos ant colony optimization is a simple and effective algorithm.

Key words： ant colony optimization algorithm vehicle navigation system routing problem

TP301

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors
	Che Gaofeng
	Lu Yueran
	Tan Jun

Cite this article:

Che Gaofeng, Lu Yueran, Tan Jun. Solving Routing Problem of Vehicle Navigation System by Ant Colony Optimization Algorithm. Computer & Telecommunication, 2015, 1(11): 46-47.

URL:

https://www.computertelecom.com.cn/EN/ OR https://www.computertelecom.com.cn/EN/Y2015/V1/I11/46

[1]	JIN Zhi. Research on Grid Task Scheduling Based on Ant Algorithm[J]. 电脑与电信, 2017, 1(12): 20-22.
[2]	Xu Xiangyi. Comparison of Two Intelligent Optimization Algorithms Applied in Traffic Control[J]. 电脑与电信, 2016, 1(9): 67-69.
[3]	Xu Hongyun. Research on the Application of VR Technology in Virtual Tour[J]. 电脑与电信, 2016, 1(7): 36-38.
[4]	Huang Quan. Exploration and Practice of Teaching Reform of VB Course under CDIO Mode[J]. 电脑与电信, 2016, 1(7): 127-128.
[5]	Yang Suhan, Jiang Hongwei. Comprehensive Survey on Artificial Bee Colony Algorithm[J]. 电脑与电信, 2015, 1(5): 15-18.
[6]	Song Qian, Wang Dongming. Text Classification Algorithm Based on Genetic Algorithm and Probability Theory[J]. 电脑与电信, 2015, 1(3): 49-52.

Viewed

Full text

Abstract

Cited

Shared

Discussed