By Topic

A Path Adjustment Algorithm of the Combination of Genetic Algorithm and Ant Colony Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shengzhuo Liang ; Inf. Eng. Sch., Nanchang Univ., Nanchang, China ; Zhengru Fang

Under the premise of using Ford algorithm to obtain the shortest path in the link map, in this paper the path adjustment algorithm which is the combination of the genetic algorithm and ant colony algorithm is introduced. And the path adjustment algorithm is used to adjust and optimize the current shortest path. The definition of the genetic algorithm control function was to control the appropriate combination opportunity of the two algorithms. Taking advantage of genetic algorithm to produce the original results, they were transformed into the initial pheromones value needed by ant colony algorithm, then ant colony algorithm to get the best results. Through numerical simulation analysis, it is further description that the path adjustment algorithm's effectiveness and necessity.

Published in:

Information Science and Engineering (ICISE), 2009 1st International Conference on

Date of Conference:

26-28 Dec. 2009