BSMA: A novel metaheuristic algorithm for multi-dimensional knapsack problems: Method and comprehensive analysis
出版年份 2021 全文链接
标题
BSMA: A novel metaheuristic algorithm for multi-dimensional knapsack problems: Method and comprehensive analysis
作者
关键词
Multi-dimensional knapsack problem (MKP), Slime mould algorithm (SMA), Transfer function, Penalty function, Infeasible solution
出版物
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 159, Issue -, Pages 107469
出版商
Elsevier BV
发表日期
2021-06-11
DOI
10.1016/j.cie.2021.107469
参考文献
相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。- Slime mould algorithm: A new method for stochastic optimization
- (2020) Shimin Li et al. Future Generation Computer Systems-The International Journal of eScience
- A parallel hybrid krill herd algorithm for feature selection
- (2020) Laith Abualigah et al. International Journal of Machine Learning and Cybernetics
- A binary multi-verse optimizer for 0-1 multidimensional knapsack problems with application in interactive multimedia systems
- (2019) Mohamed Abdel-Basset et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Hybrid clustering analysis using improved krill herd algorithm
- (2018) Laith Mohammad Abualigah et al. APPLIED INTELLIGENCE
- A new binary salp swarm algorithm: development and application for optimization tasks
- (2018) Rizk M. Rizk-Allah et al. NEURAL COMPUTING & APPLICATIONS
- A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem
- (2017) Mohamed Abdel-Basset et al. International Journal of Machine Learning and Cybernetics
- A Binary differential search algorithm for the 0–1 multidimensional knapsack problem
- (2016) Jianjun Liu et al. APPLIED MATHEMATICAL MODELLING
- Binary artificial algae algorithm for multidimensional knapsack problems
- (2016) Xuedong Zhang et al. APPLIED SOFT COMPUTING
- A human learning optimization algorithm and its application to multi-dimensional knapsack problems
- (2015) Ling Wang et al. APPLIED SOFT COMPUTING
- Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem
- (2015) Mingchang Chih APPLIED SOFT COMPUTING
- Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems
- (2015) Djaafar Zouache et al. SOFT COMPUTING
- An order-based estimation of distribution algorithm for stochastic hybrid flow-shop scheduling problem
- (2014) Sheng-yao Wang et al. INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING
- A new hybrid combinatorial genetic algorithm for multidimensional knapsack problems
- (2014) Guoming Lai et al. JOURNAL OF SUPERCOMPUTING
- A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm
- (2013) Madjid Tavana et al. ANNALS OF OPERATIONS RESEARCH
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- (2013) Mingchang Chih et al. APPLIED MATHEMATICAL MODELLING
- A hybrid quantum inspired harmony search algorithm for 0–1 optimization problems
- (2013) Abdesslem Layeb JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
- Improved binary artificial fish swarm algorithm for the 0–1 multidimensional knapsack problems
- (2013) Md. Abul Kalam Azad et al. Swarm and Evolutionary Computation
- S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization
- (2012) Seyedali Mirjalili et al. Swarm and Evolutionary Computation
- Solution of multidimensional knapsack problems via cooperation of dynamic programming and branch and bound
- (2010) Vincent Boyer et al. European Journal of Industrial Engineering
- A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning
- (2008) Yanzhi Li et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- (2007) Min Kong et al. COMPUTERS & OPERATIONS RESEARCH
- A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem
- (2007) Stefan Balev et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreFind the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
Search