Solving Algorithm of Knapsack Problem based on HDEA

被引：0

作者：

Xiong, Yongfu ^{[1
]}

Yu, Chao ^{[1
]}

Yuan, Mengting ^{[2
]}

机构：

[1] CCNIIT, Chengdu 611844, Sichuan, Peoples R China

[2] Wuhan Univ, Wuhan 430072, Hubei, Peoples R China

来源：

CONFERENCE ON WEB BASED BUSINESS MANAGEMENT, VOLS 1-2 | 2010年

关键词：

HDEA; knapsack problem; greedy method;

D O I：

暂无

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

Finding the optimized solution from Feasible solution is the goal for solving combination problems. In this paper, we obtain a new Hybrid Dynamic Evolutionary Algorithm(HDEA) to solve combination, which is derived from original Dynamic Evolutionary Algorithm integrated with local search strategy and simulated annealing strategy. An example on 0-1 knapsack problem is also given, in which we presents the description for problem solving algorithm based on HDEA. Corporations on the performance between HEDA and the greedy method are made, which shows that our HDEA has the better performance than greedy method on accuracy.

引用

页码：1098 / +

页数：2