资料下载
×
基于LabVIEW的全局最短路径的遗传算法设计
消耗积分:10 |
格式:rar |
大小:1711 |
2010-11-24
分享资料个
为了利用遗传算法解决全局最短路径问题，提出了一种基于矩阵判断的编码方法。随机产生种群个体，每个种群个体都可以直观反映一种连线的方法。定义一个判断矩阵，每次使用种群个体前用判断矩阵进行合法性判断。为了适应这种编码方法，提出了新的遗传策略。利用LabVIEW进行仿真。仿真结果表明LabVIEW独有的数组运算规则可以方便有效的实现这种遗传算法。相比较一般的编码方法，该编码方法更简单、实用，不需要解码过程，更高效，适用于无线模块组网、灌溉网络管道连接、配电网设置等多类工程设计。
- Abstract:
- GA (genetic algorithms) was used to solve the shortest path problem of multi-branch network. An encoding method based on judgment matrix was proposed. Lots of individuals were generated randomly. Each of them could intuitively reflect a connection method. A judgment matrix was defined and used to judge the matrix legitimacy before using the individuals. A new genetic strategy was proposed to adapt the encoding method. LabVIEW was used to do a simulation experiment. The result shows that the particular array operation rules can achieve the GA efficiently. Compared with the general encoding method， the new encoding method is simple and practical. It is efficient， because the decode procedure is not necessary. The method can be applied to many types of engineering design， such as construction of wireless networks， pipe connection of irrigation network， distribution system installation and so on.
声明：本文内容及配图由入驻作者撰写或者入驻合作网站授权转载。文章观点仅代表作者本人，不代表电子发烧友网立场。文章及其配图仅供工程师学习之用，如有内容侵权或者其他违规问题，请联系本站处理。 举报投诉
评论(0)
发评论
- 相关下载
- 相关文章
