%A ZHENG Jian %T Discrete sine cosine algorithm for solving large-scale 0-1 knapsack problems %0 Journal Article %D 2020 %J JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) %R 10.6040/j.issn.1671-9352.4.2020.109 %P 87-95 %V 55 %N 11 %U {http://lxbwk.njournal.sdu.edu.cn/CN/abstract/article_3365.shtml} %8 %X According to the mathematical characteristics of the 0-1 knapsack problem(0-1 KP), this paper redesigns a discrete version of SCA(DSCA)for 0-1 KP. Within the framework of basic SCA, DSCA uses the real code to generate initial individuals, a new nonlinear exponential decreasing function is applied to adjust the individual update step size. A greedy-based repair operator is included to fix and optimize the infeasible solution. The performance of the improved algorithm was tested on two sets of large-scale 0-1 KP. The comparison with some state-of-arts algorithms confirms that DSCA is efficient and concise, not only can it provide an effective solution for 0-1 KP, but also it expands the application fields of SCA.