A New AS Algorithm to Solve the Zero-One Knapsack Problem

摘要：

AS Algorithm has been successfully applied to solve the TSP problem and combinatorial optimization problem. For using it to solve the zero-one knapsack problem, this paper compares the difference between the zero-one knapsack and the TSP problem. It expands the scope of application to solve the zero-one knapsack problem. Meanwhile, some parameters have been optimized. The experiment indicates that the strength of the AS algorithm and the potention for solving the combinatorial optimization problems as a heuristic algorithm.

关键词： AS Algorithm zero-one knapsack optimization

作者: Yuanni Wang Fei Ge Xiang Li Li Zhu

作者单位: State Key Laboratory of Information Engineering in Surveying, Mapping and Remote sensing, Wuhan Univ Computer science and technology department of Center Normal China430079, wuhan, hubei, China. Computer College of China University of Geosciences, 430074,wuhan, hubei, China Computer College of China University of Geosciences, 430074,wuhan, hubei, China.

会议类型: 国际会议

会议名称: The Second International Symposium on Intelligence Computation and Applications(ISICA 2007)(第二届智能计算及其应用国际会议)

会议地点: 武汉

会议语种:英文

在线出版日期: 2007-09-21（万方平台首次上网日期，不代表论文的发表时间）