TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems
- 7 March 2023
- journal article
- research article
- Published by Springer Nature in Neural Computing and Applications
- Vol. 35 (17) , 12691-12713
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (No. 61762092)
- Open Foundation of the Key Laboratory in Software Engineering of Yunnan Province (No. 2020SE303)
- Major Science and Technology Project of Precious Metal Materials Genome Engineering in Yunnan Province (No. 2019ZE001-1 and 202002AB080001-6)
- Yunnan provincial major science and technology: Research and Application of key Technologies for Resource Sharing and Collaboration Toward Smart Tourism (202002AD080047)
- Major Science and Technology Projects in Yunnan Province (202202AD080007)
This publication has 49 references indexed in Scilit:
- Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problemNeural Computing and Applications, 2017
- Discrete differential evolutions for the discounted {0-1} knapsack problemInternational Journal of Bio-Inspired Computation, 2017
- Exact and approximate algorithms for discounted {0-1} knapsack problemInformation Sciences, 2016
- SCA: A Sine Cosine Algorithm for solving optimization problemsKnowledge-Based Systems, 2016
- A two-stage framework for bat algorithmNeural Computing and Applications, 2016
- Dynamic programming based algorithms for the discounted {0–1} knapsack problemApplied Mathematics and Computation, 2012
- Design and Analysis of Approximation Algorithms2012
- Opposition-Based Learning: A New Scheme for Machine Intelligence2006
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- Evolutionary Algorithms for Constrained Parameter Optimization ProblemsEvolutionary Computation, 1996