摘要
针对蚁群算法在解决组合优化问题时存在演化过程收敛慢、耗时长的缺点,提出了将确定性搜索移动引入蚁群算法中,并研究了改进后蚁群算法在啤酒配方优化中的应用.在满足生产指标前提下,实现配方的原料总成本最低.应用结果表明:针对啤酒配方优化问题,改进的蚁群算法,具有更强的全局搜索能力和鲁棒性,并易于实现,具有较好的应用价值.
Aiming at the disadvantages of slow convergence and time-consuming in the process of evolution when ant colony algorithm（ACA） slove the eombinatoral optimization, the determinately searching motion is added in the ACA, and the study of new ACA of the formulation of beer recipe is presented in the paper, which in meeting production targets premise, achieve the lowest total cost of the raw materials. The results show that compared with the traditional ACA, the improved ACA has more global search capability and robustness, and ease of implementation, has practical value.
出处
《江南大学学报（自然科学版）》
CAS
2008年第4期387-391,共5页
Joural of Jiangnan University (Natural Science Edition)
基金
国家自然科学基金重点项目(NSFC-50505045)
关键词
优化
蚁群算法
全局搜索
啤酒配方
optimization
ant colony algorithm
global search
beer recipe
