CAJ | 학술논문

背包问题是计算机算法中的一个 NP 完备类困难问题，使用传统的优化方法在求解较大规模的背包问题时，都存在计算量大、迭代时间长的缺陷。人类进化算法是模拟人类进化机理而建立的一种智能优化算法，本文阐述了人类进化算法的基本原理和实现方法。为提高背包问题的求解速度和精度，将人类进化算法应用于背包问题的求解，演示了算法的工作过程。试验结果表明，使用该方法求解背包问题是完全可行的和有效的，与众多优化算法相比，人类进化算法具有更高的求解效率。
배포문제시계산궤산법중적일개 NP 완비류곤난문제，사용전통적우화방법재구해교대규모적배포문제시，도존재계산량대、질대시간장적결함。인류진화산법시모의인류진화궤리이건립적일충지능우화산법，본문천술료인류진화산법적기본원리화실현방법。위제고배포문제적구해속도화정도，장인류진화산법응용우배포문제적구해，연시료산법적공작과정。시험결과표명，사용해방법구해배포문제시완전가행적화유효적，여음다우화산법상비，인류진화산법구유경고적구해효솔。
Knapsack problem is regarded as a difficult NP completeness problem in computer algorithms. When the knapsack problems with large scale are solved by traditional optimization methods, the computation is large and the iteration time is long. Human Evolutionary Algorithm (HEA) is an intelligent optimization algorithm simulating human evolutionary mechanism. The basic principle and realization method of this algorithm is discussed. In order to improve the speed and precision of the solution, Human evolutionary algorithm is used to solve Knapsack problems. The work process of algorithm is analyzed. The experimental results prove its feasibility and validity in solving Knapsack problems. Human evolutionary algorithm is more efficient compared with many other optimization algorithms.