Abstract:
An optimization algorithm for multiple-choice knapsack problem based on ant colony system is presented.By using positive feedback properties of ant algorithm and mutation parameter, the algorithm has faster computing speed and higher solution precision .The experimental results show that it is a fast and efficient method for knapsack problem.
摘要: 提出了一种用蚁群系统求解多选择背包问题的优化算法。该方法利用蚂蚁算法所具有的正反馈特性,再结合变异参数,使算法既有较快的求解速度又有较高的求解精度。实验结果表明,采用此算法能快速有效地解决背包问题。
关键词:
蚁群系统,
背包问题,
变异参数,
优化
CLC Number:
YU Yongxin,ZHANG Xinrong. Optimization Algorithm for Multiple-choice Knapsack Problem Based on Ant Colony System[J]. , 2003, 29(20): 75-.
于永新,张新荣. 基于蚁群系统的多选择背包问题优化算法[J]. , 2003, 29(20): 75-.