| 一种改进的禁忌搜索算法求解背包问题 |
| |
| 引用本文： | 廖飞雄,马良,王攀.一种改进的禁忌搜索算法求解背包问题[J].计算机应用与软件,2009,26(3). |
| |
| 作者姓名： | 廖飞雄 马良 王攀 |
| |
| 作者单位： | 1. 上海理工大学管理学院,上海,200093
2. 武汉理工大学自动化学院,湖北,武汉,430070 |
| |
| 基金项目： | 上海市重点学科建设项目，上海市教委科技发展基金 |
| |
| 摘 要： | 提出一种改进的禁忌搜索算法来求解背包问题.该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局部最优解的变异算子.改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象.通过对具体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能.
|
| 关 键 词： | 禁忌搜索 背包问题 |
AN IMPROVED TABU SEARCH ALGORITHM FOR KNAPSACK PROBLEM |
| |
| LIAO Feixiong,MA Liang,WANG Pan.AN IMPROVED TABU SEARCH ALGORITHM FOR KNAPSACK PROBLEM[J].Computer Applications and Software,2009,26(3). |
| |
| Authors: | LIAO Feixiong MA Liang WANG Pan |
| |
| Affiliation: | College of Management;University of Shanghai for Science and Technology;Shanghai 200093;China;College of Automation;Wuhan University of Technology;Wuhan 430070;Hubei;China |
| |
| Abstract: | In this paper it proposes an improved tabu search algorithm for the knapsack problem.The algorithm is based on standard tabu search and adopts I&D strategy,as well as designs two mutation operators against local optimum solution at the same time.The improved algorithm can efficiently make up the weakness of standard tabu search algorithm in its dependence on initial solution and meanwhile avoids the phenomenon of searching stagnancy.Numerical tests on concrete instance and random problems show the efficienc... |
| |
| Keywords: | I&D |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
