摘要
在SD{0-1}KP的基础上对项集中的物品数由两个扩展为三个,提出扩展SD{0-1}KP问题。在扩展问题中,各项集中物品组合选择情况采取三元组进行编码表示,建立扩展SD{0-1}KP模型,再将贪心策略与遗传算法融合构造求解模型的算法。为验证算法的求解效果,随机生成四种扩展SD{0-1}KP大规模数据实例。求解结果表明:该算法适合求解扩展SD{0-1}KP大规模数据,且效果较好。
The number of items in the item set is extended from two to three on the basis of SD{0-1}KP,and the extended SD{0-1}KP problem is proposed.The combinational selection of various centralized items in the extended problem is represented by triple coding and an extended SD{0-1}KP model is established.Then,greedy strategy and genetic algorithm are integrated for constructing an algorithm to solve the model.Four large-scale data instances of extended SD{0-1}KP are randomly generated to verify the solution effect of the algorithm.The solution results show that the algorithm is suitable and more efficient for solving large-scale data of extended SD{0-1}KP.
作者
张琴
潘大志
ZHANG Qin;PAN Dazhi(College of Mathematics and Information,Nanchong Sichuan 637009,China;Institute of Computing Method and Application Software,China West Normal University,Nanchong Sichuan 637009,China)
出处
《西华师范大学学报(自然科学版)》
2020年第2期214-220,共7页
Journal of China West Normal University(Natural Sciences)
基金
国家自然科学基金项目(11871059)
四川省教育厅自然科学基金项目(18ZA0469)
西华师范大学英才科研基金项目(17YC385)
西华师范大学校级科研团队项目(CXTD2015-4)。
