Research of SoPC-Based Improved Genetic Algorithm on Shortest Path
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.
Genetic Algorithm selection crossover mutation SoPC Nlos U
Ruan Hang Ren Aifeng Meng Ming Zhao Wei Luo Ming
School of Electronic Engineering Xidian University Xian, Shaanxi, P. R. China
国际会议
2010 International Conference on Signal and Information Processing(2010年IEEE信号与信息处理国际会议 ICSIP2010)
长沙
英文
598-601
2010-12-14(万方平台首次上网日期,不代表论文的发表时间)