Share Email Print
cover

Proceedings Paper

Research of SoPC-based improved genetic algorithm on shortest path
Author(s): Hang Ruan; Aifeng Ren; Ming Meng; Wei Zhao; Ming Luo
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The shortest path problem is a classic problem and is unlikely to find an efficient algorithm for solving it directly. It is applied broadly in practice. Thus rapid and effective solving shortest path problem is very important application value in practice. Genetic Algorithm (GA) is a kind of heuristic global optimization search algorithm that simulates the biology evolutionary system. It is resolved efficiently by this improvement Genetic Algorithm. In this paper, a SoPC-based GA framework is proposed .The experiment results show that improved Genetic Algorithm enhances extremely in the same environment.

Paper Details

Date Published: 1 October 2011
PDF: 7 pages
Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 828553 (1 October 2011); doi: 10.1117/12.913373
Show Author Affiliations
Hang Ruan, Xidian Univ. (China)
Aifeng Ren, Xidian Univ. (China)
Ming Meng, Xidian Univ. (China)
Wei Zhao, Xidian Univ. (China)
Ming Luo, Xidian Univ. (China)


Published in SPIE Proceedings Vol. 8285:
International Conference on Graphic and Image Processing (ICGIP 2011)
Yi Xie; Yanjun Zheng, Editor(s)

© SPIE. Terms of Use
Back to Top