| 基于初始路径优化的蚁群算法及应用 |
| |
| 引用本文： | 许世杰,刘弘. 基于初始路径优化的蚁群算法及应用[J]. 计算机工程与设计, 2010, 31(5) |
| |
| 作者姓名： | 许世杰 刘弘 |
| |
| 作者单位： | 山东师范大学信息科学与工程学院,山东,济南,250014 |
| |
| 基金项目： | 国家自然科学基金项目(60743010):山东省自然科学基金项目 |
| |
| 摘 要： | 为解决蚁群算法在初始阶段执行效率低、信息素随机分布、路径杂乱无章的缺点,提出将正交设计方法引入初始优化中.创建正交离散过程,形成正交优化的路径设置;优化初始化过程,形成初始解;以动态概率转移规则来构造路径;精练的选路策略等4项改进措施的初始路径优化模型.该模型提高了算法的执行效率,模拟算例成功应用于连续域问题的饲料配方设计方面,表明该算法有效且可行,开辟了一条饲料配方设计的新途径,同时对蚁群算法解决连续域问题提供可参考技的模型和求解方法.
|
| 关 键 词： | 蚁群算法 初始路径优化 正交设计 正交离散 连续优化 饲料配方设计 |
Ant colony algorithm based on initial path optimization and its application |
| |
| XU Shi-jie,LIU Hong. Ant colony algorithm based on initial path optimization and its application[J]. Computer Engineering and Design, 2010, 31(5) |
| |
| Authors: | XU Shi-jie LIU Hong |
| |
| Affiliation: | XU Shi-jie,LIU Hong (School of Information Science , Engineering,Sh,ong Normal University,Jinan 250014,China) |
| |
| Abstract: | To solve the problems of low efficiency,randomly distributed pheromone,scrambled paths in the initial stage of the ant colony algorithm,several methods are adopted to solve the optimization model that orthogonal design is proposed to create orthogonal discrete points and continuous optimization course is formulated as discrete optimization and is designed to optimize the initial route set in order to get initial solution. Dynamical transfer rules are used to construct the probably paths and other refined pa... |
| |
| Keywords: | ant colony algorithm initial route optimization orthogonal design orthogonal discrete continuous optimization feed formula design |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
