Solving the 0/1 Knapsack Problem Using a Galactic Swarm Optimization with Data-Driven Binarization Approaches-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Solving the 0/1 Knapsack Problem Using a Galactic Swarm Optimization with Data-Driven Binarization Approaches

Published:2020 Issue: Volume: Page:511-526
ISSN:0302-9743
Container-title:Computational Science and Its Applications – ICCSA 2020
language:
Short-container-title:

Author:

Vásquez Camilo,Lemus-Romani José,Crawford Broderick,Soto Ricardo,Astorga Gino,Palma Wenceslao,Misra Sanjay,Paredes Fernando

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-58817-5_38

Reference13 articles.

1. Crawford, B., Soto, R., Astorga, G., García, J., Castro, C., Paredes, F.: Putting continuous metaheuristics to work in binary search spaces. Complexity 2017(2), 1–19 (2017)

2. Crawford, B., Soto, R., Astorga, G., Lemus-Romani, J., Misra, S., Rubio, J.-M.: An adaptive intelligent water drops algorithm for set covering problem. In: 2019 19th International Conference on Computational Science and Its Applications (ICCSA), pp. 39–45. IEEE (2019)

3. García, J., Crawford, B., Soto, R., Astorga, G.: A clustering algorithm applied to the binarization of swarm intelligence continuous metaheuristics. Swarm Evol. Comput. 44, 646–664 (2019)

4. García, J., et al.: A Db-scan binarization algorithm applied to matrix covering problems. Comput. Intell. Neurosci. 2019, 3238516–3238572 (2019)

5. Mavrotas, G., Diakoulaki, D., Kourentzis, A.: Selection among ranked projects under segmentation, policy and logical constraints. Eur. J. Oper. Res. 187(1), 177–192 (2008)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Novel Binary Artificial Jellyfish Search Algorithm for Solving 0–1 Knapsack Problems;Neural Processing Letters;2023-03-16

2. Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review;Mathematics;2022-12-27

3. Hybrid quantum genetic algorithm with adaptive rotation angle for the 0-1 Knapsack problem in the IBM Qiskit simulator;Soft Computing;2022-09-05

4. Population Size Management in a Cuckoo Search Algorithm Solving Combinatorial Problems;Informatics and Intelligent Applications;2022

5. Reinforcement Learning Based Whale Optimizer;Computational Science and Its Applications – ICCSA 2021;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3