Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem
Author:
Publisher
Springer International Publishing
Link
http://link.springer.com/content/pdf/10.1007/978-3-319-07857-1_86
Reference22 articles.
1. Aickelin, U.: An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society 53, 1118–1126 (2002)
2. Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research 44(6), 875–890 (1996)
3. Beasley, J., Chu, P.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94(2), 392–404 (1996)
4. Beasley, J.E., Jornsten, K.: Enhancing an algorithm for set covering problems. European Journal of Operational Research 58(2), 293–300 (1992)
5. Brusco, M.J., Jacobs, L.W., Thompson, G.M.: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems. Annals of Operations Research 86, 611–627 (1999)
Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Interval Type-2 Fuzzy Dynamic Parameter Adaptation in Bee Colony Optimization for Autonomous Mobile Robot Navigation;Recent Developments and the New Direction in Soft-Computing Foundations and Applications;2020-07-11
2. Ambidextrous Socio-Cultural Algorithms;Computational Science and Its Applications – ICCSA 2020;2020
3. Cat Swarm Optimization with Different Transfer Functions for Solving Set Covering Problems;Computational Science and Its Applications – ICCSA 2016;2016
4. A Weed Colonization Inspired Algorithm for the Weighted Set Cover Problem;Computational Science and Its Applications – ICCSA 2016;2016
5. An Approach to Solve the Set Covering Problem with the Soccer League Competition Algorithm;Computational Science and Its Applications – ICCSA 2016;2016
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3