Genetic algorithm based on dissipative theory and It’s application

doi:10.3778/j.issn.1002-8331.2008.21.031

Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (21): 113-115.DOI: 10.3778/j.issn.1002-8331.2008.21.031

• 机器学习 • Previous Articles Next Articles

Genetic algorithm based on dissipative theory and It’s application

YU Hui¹,WANG Hong-guo¹,ZHUANG Bo²,GUO Yan-wei¹,XU Wei-zhi¹

1.School of Information Science and Engineering，Shandong Normal University，Ji’nan 250014，China
2.Department of Computer Science and Technology，Binzhou University，Binzhou，Shandong 256603，China

Received:2008-04-30 Revised:2008-05-27 Online:2008-07-21 Published:2008-07-21
Contact: YU Hui

一种基于耗散理论的遗传算法及其应用

于惠¹,王洪国¹,庄波²,郭彦伟¹,徐卫志¹

1.山东师范大学信息科学与工程学院，济南 250014
2.滨州学院计算机科学技术系，山东滨州 256603

通讯作者: 于惠

Abstract

Abstract: In this paper，an adaptive genetic algorithm which includes crossover and mutation matrix is proposed.The dissipative structure theory is introduced，and the relationship between the number of the successfully crossovered individuals and the mutation probability is established，so the number of the successfully crossovered individuals can affect the mutation probability.A greedy algorithm is used to process the illegal individuals.According to the experiments，the algorithm gets better results when solving the 0-1 knapsack problem.

Key words: Knapsack problem, dissipative structure theory, Hamming distance, mutation matrix

摘要： 在含有交叉和变异矩阵的自适应遗传算法的基础上，引入耗散结构理论，在交叉成功的个体数和变异概率之间建立联系，使交叉成功的个体影响变异概率，并且对非法个体进行贪婪处理。实验表明，该算法在解决0-1背包问题时获得较好的效果。

关键词: 背包问题, 耗散结构理论, 海明距离, 变异矩阵

YU Hui¹,WANG Hong-guo¹,ZHUANG Bo²,GUO Yan-wei¹,XU Wei-zhi¹. Genetic algorithm based on dissipative theory and It’s application[J]. Computer Engineering and Applications, 2008, 44(21): 113-115.

于惠¹,王洪国¹,庄波²,郭彦伟¹,徐卫志¹. 一种基于耗散理论的遗传算法及其应用[J]. 计算机工程与应用, 2008, 44(21): 113-115.

[1]	HAO Xiang, HE Yichao, ZHU Xiaobin, ZHAI Qinglei. Discrete Hybrid Multi-verse Optimization Algorithm for Solving Discounted {0-1} Knapsack Problem [J]. Computer Engineering and Applications, 2021, 57(18): 103-113.
[2]	ZHANG Ming, DENG Wenhan, LIN Juan, ZHONG Yiwen. Modified Ant Colony Optimization Algorithm for Discounted {0-1} Knapsack Problem [J]. Computer Engineering and Applications, 2021, 57(13): 85-95.
[3]	FAN Jianping, CHENG Rui, WU Meiqin. Distance Measure of Interval-Valued Complex Fuzzy Soft Sets and Its Application [J]. Computer Engineering and Applications, 2020, 56(9): 248-259.
[4]	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.
[5]	CHEN Changqian, MU Xiaodong, NIU Ben, WANG Lizhi. Improved Binary Grey Wolves Optimization Algorithm Combined with Gaussian Distribution [J]. Computer Engineering and Applications, 2019, 55(13): 145-150.
[6]	YANG Yang1, PAN Dazhi1, HE Yichao2. Improved repair strategy genetic algorithm solve discount {0-1} knapsack problem [J]. Computer Engineering and Applications, 2018, 54(21): 37-42.
[7]	ZHANG Jian, GUO Xing, LI Wei. Application of improved?fruit fly optimization?algorithm on multi object search [J]. Computer Engineering and Applications, 2018, 54(2): 131-136.
[8]	LIU Xuejing, HE Yichao, WU Congcong, CAI Xiufeng. Research on bacterial foraging optimization algorithm for discounted {0-1} knapsack problem [J]. Computer Engineering and Applications, 2018, 54(2): 155-162.
[9]	LIU Xuejing1, HE Yichao1, WU Congcong1, LI Liang2. Adaptive bacterial foraging optimization algorithm for discounted {0-1} knapsack problem [J]. Computer Engineering and Applications, 2018, 54(18): 139-146.
[10]	LIU Xuejing1, HE Yichao1, WU Congcong1, LI Liang2. Chaotic binary crow search algorithm for 0-1 knapsack problem [J]. Computer Engineering and Applications, 2018, 54(10): 173-179.
[11]	QIAN Xi, ZENG Cheng, WANG Tian. Most stably continuous service set recommend algorithm in changing time [J]. Computer Engineering and Applications, 2017, 53(10): 73-78.
[12]	CUI Jianshuang, WANG Chongjing. Solving multiple knapsack problem with speed limit particle swarm algorithm [J]. Computer Engineering and Applications, 2015, 51(9): 244-247.
[13]	WU Congcong, HE Yichao, CHEN Yiying, LIU Xuejing, CAI Xiufeng. Binary bat algrorithm for solving 0-1 knapsack problem [J]. Computer Engineering and Applications, 2015, 51(19): 71-74.
[14]	YU Juan, HE Yuyao. Hybrid algorithm based on Genetic Algorithm and estimation of distribution algorithm for 0-1 knapsack problem [J]. Computer Engineering and Applications, 2014, 50(9): 12-16.
[15]	WU Jiagao1, ZHANG Xi1, ZHUANG Songjie1, ZOU Zhiqiang1, HU Bin2. Research on cache replacement strategy for space vector data of multi-layer [J]. Computer Engineering and Applications, 2014, 50(7): 89-93.

Genetic algorithm based on dissipative theory and It’s application

一种基于耗散理论的遗传算法及其应用

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics