A Modified Binary Particle Swarm Optimization for Knapsack Problems

Author:

Bansal Jagdish Chand,Deep Kusum

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Mathematics

Reference53 articles.

1. Discrete variable extremum problems;Dantzig;Operations Research,1957

2. Improved simulated annealing algorithm solving for 0/1 knapsack problem;Liu,2006

3. J. Thiel, S. Voss, Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms, INFOR, Canada, vol. 32, 1994, pp. 226–242.

4. A genetic algorithm for the multidimensional knapsack problem;Chu;Journal of Heuristics,1998

5. Solving 0/1 knapsack problem using genetic algorithm;Huo;Journal of Xidian University,1999

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

1. Two-Stage Seismic Resilience Enhancement of Electrical Distribution Systems;Reliability Engineering & System Safety;2024-01

2. A fractional order friction model;ISA Transactions;2023-11

3. A Chebyshev polynomial approach to approximate solution of differential equations using differential evolution;Engineering Applications of Artificial Intelligence;2023-11

4. An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems;Information Sciences;2023-11

5. Binary Honey Badger Algorithm for 0-1 Knapsack Problem;Journal of Intelligent Systems: Theory and Applications;2023-08-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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