文献类型：会议论文

英文题名：Comparative Study of Several Intelligent Algorithms for Knapsack Problem

作者：Zhang, Jing[1]

通讯作者：Zhang, J[1]

机构：[1]Beijing Union Univ, Basic Courses Dept, Beijing, Peoples R China

第一机构：北京联合大学基础教学部

通讯机构：[1]corresponding author), Beijing Union Univ, Basic Courses Dept, Beijing, Peoples R China.|[1141788]北京联合大学基础教学部;[11417]北京联合大学;

会议论文集：2nd International Conference on Challenges in Environmental Science and Computer Engineering (CESCE)

会议日期：DEC 14-15, 2011

会议地点：Haikou, PEOPLES R CHINA

语种：英文

外文关键词：Knapsack problem; intelligent algorithms; simulated annealing; ant colony algorithm; taboo search

摘要：Knapsack problem in the field of combinatorial optimization is a typical, easy-to-describe but difficult to deal with NP-complete problems. Knapsack problem for large-scale, are not yet very effective way, how quickly and effectively solve the knapsack problem has important theoretical and practical significance, is widely used in engineering practice. We introduce the knapsack problem, discusses the current knapsack problem several intelligent algorithm is more effective (simulated annealing algorithm, ant colony algorithm, taboo search method), a simple illustration of their solution process, respectively, and pointed out their advantages and disadvantages the prospects for solving knapsack problem raised outlook. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of the Intelligent Information Technology Application Research Association.