文献类型：期刊文献

英文题名：Comparative study of several intelligent algorithms for knapsack problem

作者：Zhang, Jing[1]

通讯作者：Zhang, J.

机构：[1] Basic Courses Department, Beijing Union University, Beijing, China

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

年份：2011

卷号：11

期号：PART A

起止页码：163-168

外文期刊名：Procedia Environmental Sciences

收录：EI(收录号：20120914816293)

语种：英文

外文关键词：Tabu search - Problem solving - Computational complexity - Ant colony optimization - Combinatorial optimization

摘要：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. ? 2011 Published by Elsevier Ltd.