摘要
针对有界背包问题,提出一种混沌小生境萤火虫算法.采用混沌理论对萤火虫种群初始化,为了增加种群多样性,使用小生境技术计算个体共享适应度,以一定概率将共享半径内相似个体进行排挤处理,对所有被排挤个体实行Levy飞行操作,同时对较优个体进行局部搜索,对陷入早熟的个体使用混沌理论重新随机产生位置进行更新.仿真实验表明新改进算法能有效求解有界背包问题.
To solve the Bounded Knapsack Problem,a chaotic niche firefly algorithm has been proposed.The chaotic theory has been used to initialize the firefly population.In order to increase the diversity of the population,the niche technology has been used to calculate the individual shared fitness.The similar individuals in the shared radius have been excluded by a certain probability,and the Levy flight operation has been performed on all the excluded individuals.Excellent individuals perform local searches,and the precocious individuals have re-randomly been generated to update their positions using chaos theory.The simulation results show that the improved algorithm can effectively solve the Bounded Knapsack Problem.
作者
任静敏
潘大志
REN Jing-min;PAN Da-zhi(College of Mathematics and Information, China West Normal University, Nanchong Sichuan 637009, China;Institute of computing Method and Application Software, China West Normal University, Nanchong Sichuan 637009, China)
出处
《西南师范大学学报（自然科学版）》
CAS
北大核心
2020年第11期59-65,共7页
Journal of Southwest China Normal University(Natural Science Edition)
基金
国家自然科学基金项目(11871059)
四川省教育厅自然科学基金项目(18ZA0469)
西华师范大学英才科研基金项目(17YC385)
西华师范大学校级科研团队项目(CXTD2015-4).
作者简介
任静敏(1993-),女,硕士研究生,中国计算机学会(CCF)会员,主要从事智能算法研究;通信作者:潘大志,博士,教授,硕士生导师.
