New genetic algorithm to solve 0-1 knapsack problem

doi:10.3778/j.issn.1002-8331.2009.30.015

Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (30): 45-47.DOI: 10.3778/j.issn.1002-8331.2009.30.015

• 研究、探讨 • Previous Articles Next Articles

New genetic algorithm to solve 0-1 knapsack problem

ZHOU Ben-da¹，CHEN Ming-hua²，REN Zhe³

1.Dept. of Mathematics & Physics，West Anhui University，Liu’an，Anhui 237012，China
2.Dept. of Computer Science & Technology，West Anhui University，Liu’an，Anhui 237012，China
3.Dept. of Mathematics and Physics，Hefei University，Hefei 230022，China

Received:2008-06-18 Revised:2008-09-03 Online:2009-10-21 Published:2009-10-21
Contact: ZHOU Ben-da

一种求解0-1背包问题的新遗传算法

周本达¹，陈明华²，任哲³

1.皖西学院数理系，安徽六安 237012
2.皖西学院计算机科学与技术系，安徽六安 237012
3.合肥学院数理系，合肥 230022

通讯作者: 周本达

Abstract

Abstract: It is well known that the GA is a guided random search and the guiding direction always aims at the family whose ancestors have schemata with high fitness.Based on the results，the crossover operation in GA is redesigned by using the principle of random uniform design sampling.Then a new GA called Genetic Algorithm based on Random Uniform Design Sampling is presented.The new GA is applied to solve the 0-1 knapsack question.Compared to simple GA and Good Point GA for solving this problem，the simulation results show that the new GA has superiority in speed，accuracy and overcoming premature.

Key words: Genetic Algorithm（GA）, Random Uniform Design Sampling（RUDS）, Genetic Algorithm Based on Random Uniform Design Sampling（RUDSGA）

摘要： 众所周知，遗传算法的运行机理及特点是具有定向制导的随机搜索技术，其定向制导的原则是：导向以高适应度模式为祖先的“家族”方向。以此结论为基础，利用随机化均匀设计的理论和方法，对遗传算法中的交叉操作进行了重新设计，给出了一个新算法，称之为随机化均匀设计遗传算法。最后将随机化均匀设计遗传算法应用于求解0-1背包问题，并与简单遗传算法和佳点集遗传算法进行比较。通过模拟比较，可以看出新的算法不但提高了算法的速度和精度，而且避免了其他方法常有的早期收敛现象。

关键词: 遗传算法, 随机化均匀设计, 随机化均匀设计遗传算法

CLC Number:

TP301.6

ZHOU Ben-da¹，CHEN Ming-hua²，REN Zhe³. New genetic algorithm to solve 0-1 knapsack problem[J]. Computer Engineering and Applications, 2009, 45(30): 45-47.

周本达¹，陈明华²，任哲³. 一种求解0-1背包问题的新遗传算法[J]. 计算机工程与应用, 2009, 45(30): 45-47.

[1]	WU Congcong, HE Yichao, ZHAO Jianli. New Genetic Algorithm for Discounted {0-1} Knapsack Problem [J]. Computer Engineering and Applications, 2020, 56(7): 57-66.
[2]	QIN Qin, LIANG Chengji. Optimization of Equipment Coordination Scheduling with Considering Buffer Space in Automated Container Terminal [J]. Computer Engineering and Applications, 2020, 56(6): 262-270.
[3]	LIANG Chengji, YU Jian. Research on Dispatching of Container Terminals Quay Crane Scheduling with Interference Constraints [J]. Computer Engineering and Applications, 2020, 56(10): 273-278.
[4]	DONG Hao1, ZHANG Haiping2, LI Zhongjin1, LIU Hui1. Computation Offloading for Service Workflow in Mobile Edge Computing [J]. Computer Engineering and Applications, 2019, 55(2): 36-43.
[5]	XUE Meng, JIANG Shujuan, WANG Rongcun. Systematic review of test data generation based on intelligent optimization algorithm [J]. Computer Engineering and Applications, 2018, 54(17): 16-23.
[6]	LOU Gaoxiang, CAI Zongyan, LIU Qingtao. Application of new hybrid algorithm in mixed model assembly scheduling [J]. Computer Engineering and Applications, 2018, 54(16): 254-259.
[7]	WANG Xinyue, GUO Jianquan. Subsidy strategy model of multi-period closed-loop hybrid system under carbon tax [J]. Computer Engineering and Applications, 2018, 54(14): 236-240.
[8]	LUO Xianglong1，2, ZHANG Shengrui1, NIU Liyao2. Short-term traffic flow prediction based on detector optimal selection [J]. Computer Engineering and Applications, 2017, 53(8): 199-202.
[9]	LIANG Chengji, WU Yu. Simultaneous berth and quay crane scheduling under uncertainty environments in container terminals [J]. Computer Engineering and Applications, 2017, 53(7): 212-219.
[10]	CAO Xiaoning, XUE Han, WANG Yongming. Optimization for control strategy of serial production system with machine breakdowns [J]. Computer Engineering and Applications, 2017, 53(16): 199-204.
[11]	CUI Yongfeng, ZHOU Dingding. Analysis of optimal scheduling model in variable speed environment at night [J]. Computer Engineering and Applications, 2016, 52(9): 239-242.
[12]	XU Xian1，2, LU Xianling1，2, WANG Hongbin1，2. Accelerometer data feature selection for activity recognition based on GA optimization [J]. Computer Engineering and Applications, 2016, 52(6): 139-143.
[13]	LU Yan1, HUI Qiaojuan2. Improved framework for 3D face feature points extraction method based on statistic deformable model [J]. Computer Engineering and Applications, 2016, 52(24): 166-170.
[14]	YAN Han, LIU Juan, ZHOU Xuanyu. Optimal proportion of training data for Chinese coreference resolution [J]. Computer Engineering and Applications, 2016, 52(17): 140-145.
[15]	WANG Lucai, CAO Pengxia, JIANG Xiaolong. Improved method for speech endpoint detection with noise [J]. Computer Engineering and Applications, 2016, 52(15): 162-167.

New genetic algorithm to solve 0-1 knapsack problem

一种求解0-1背包问题的新遗传算法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics