By Topic

A gene-constrained genetic algorithm for solving shortest path problem

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)
Wu wei ; Inst. of Inf. Sci., Beijing Jiaotong Univ., China ; Ruan Qiuqi

In this paper, a gene-constrained genetic algorithm (G-C GA) to solve shortest path problem is proposed. In this genetic algorithm (GA), gene is constrained to ensure that each chromosome represents a feasible path without loop during the whole process of search. Contrasting with other genetic algorithm for SP problem, our algorithm can improve the searching capacity with a more accurate solution and more rapid speed of convergence. The G-C GA is more general and flexible no matter in a directed graph or in an undirected graph and it provides the foundation for more complicated shortest path problems.

Published in:

Signal Processing, 2004. Proceedings. ICSP '04. 2004 7th International Conference on  (Volume:3 )

Date of Conference:

31 Aug.-4 Sept. 2004