摘要
混合蚁群算法是基于群体的一类仿生算法, 适合于解困难的组合最优化问题. 本文对其做适当改进, 用于解凸整数规划问题. 结果表明: 用该算法求目标函数为正定二次型的整数规划问题的最小值, 找到的解比多起始点局部搜索方法好得多,
The hybrid ant colony system(HAC),a class of population-based meta-heuristic algorithm,is suitable for solving hard combinatorial optimization problems.In this paper it is improved appropriately and applied to the convex integer programming problems.Computational results show that our improved HAC is much more efficient than the multi-start local search and outperforms the original HAC.
出处
《福州大学学报（自然科学版）》
CAS
CSCD
1999年第6期5-9,共5页
Journal of Fuzhou University(Natural Science Edition)
基金
福建省自然科学基金!(F97006)
