| 基于进化规划算法的背包问题求解研究 |
| |
| 引用本文： | 王丽,孔繁利.基于进化规划算法的背包问题求解研究[J].内蒙古民族大学学报(自然科学版),2011,26(2). |
| |
| 作者姓名： | 王丽 孔繁利 |
| |
| 作者单位： | 1. 内蒙古民族大学,数学学院,内蒙古,通辽,028043
2. 内蒙古民族大学,经济管理学院,内蒙古,通辽,028043 |
| |
| 基金项目： | 内蒙古自治区人才开发基金项目 |
| |
| 摘 要： | 背包问题是一个具有较强应用价值的NP完全问题.如何设计求解此类问题的算法,则具有很强的实用价值和理论意义.目前已有很多的求解方法,但背包问题并没有完全解决.本文在启发式算法的理论基础上,改进了进化规划算法求解背包问题,此方法简单通用、易于操作.数值实验表明该方法具有较高的准确率,能较快的收敛到全局最优点.
|
| 关 键 词： | 0-1背包问题 进化规划 收敛性 |
The Study of the Knapsack Problem Based on the Improved Evolutionary Programming |
| |
| WANG Li,KONG Fan-li.The Study of the Knapsack Problem Based on the Improved Evolutionary Programming[J].Journal of Inner Mongolia University for the Nationalities(Natural Sciences),2011,26(2). |
| |
| Authors: | WANG Li KONG Fan-li |
| |
| Affiliation: | WANG Li~1,KONG Fan-li~2 (1.College of Mathmatics,Inner Mongolia University for Nationalities,Tongliao 028043,China,2.College of Economics and Management,China) |
| |
| Abstract: | Knapsack problem,an NP-complete problem,is widely used in many aspects.It has theoretical and practical significance for proposing an efficient algorithm to solve the kind of problem.Now,there are many kinds of algorithm in solving the problem,however,it is difficult to solve.This paper put forward a new evolutionary programming to solve the knapsack problem based on the heuristic theory.The algorithm is simple and easy to operation.Experimental results show that the algorithm has the more effectiveness and... |
| |
| Keywords: | 0-1 knapsack problem Evolutionary Programming Convergence |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
