[1] DANTZIG G B. Discrete-variable extremum problems[J]. Operations Research, 1957, 5(2):266-277. [2] KELLERER H, PFERSCHY U, PISINGER D. Knapsack Problems[M]. Berlin:Springer, 2004:1-445. [3] KARP R M, MILLER R E, THATCHER J W. Reducibility among combinatorial problems[J]. Journal of Symbolic Logic, 2010, 40(4):618-619. [4] MARTELLO S, TOTH P. Knapsack Problems:Algorithms and Computer Implementations[M]. New York:John Wiley & Sons, 1990:13-102. [5] 王熙照,贺毅朝.求解背包问题的演化算法[J].软件学报,2017,28(1):1-16.(WANG X Z, HE Y C. Evolutionary algorithms for knapsack problems[J]. Journal of Software, 2017, 28(1):1-16.) [6] 贺毅朝,王熙照,李文斌,等.求解随机时变背包问题的精确算法与进化算法[J].软件学报,2017,28(2):185-202.(HE Y C, WANG X Z, LI W B, et al. Exact algorithms and evolutionary algorithms for randomized time-varying knapsack problem[J]. Journal of Software, 2017, 28(2):185-202.) [7] GUDER J. Discounted knapsack problems for pairs of items[D]. Erlangen:Friedrich-Alexander-Universität Erlangen-Nürnberg, 2005. [8] GULDAN B. Heuristic and exact algorithms for discounted knapsack problems[D]. Erlangen:Friedrich-Alexander-Universität Erlangen-Nürnberg, 2007. [9] RONG A. FIGUEIRA J R. KLAMROTH K. Dynamic programming based algorithms for the discounted {0-1} knapsack problem[J]. Applied Mathematics and Computation, 2012, 218(12):6921-6933. [10] 贺毅朝,王熙照,李文斌,等.基于遗传算法求解折扣{0-1}背包问题的研究[J].计算机学报,2016,39(12):2614-2630.(HE Y C, WANG X Z, LI W B, et al. Research on genetic algorithms for the discounted {0-1} knapsack problem[J]. Chinese Journal of Computers, 2016,39(12):2614-2630.) [11] HE Y-C, WANG X-Z, HE Y-L, et al. Exact and approximate algorithms for discounted {0-1} knapsack problem[J]. Information Sciences, 2016, 369:634-647. [12] FENG Y, WANG G-G, LI W, et al. Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem[J]. Neural Computing and Applications, 2018, 30(10):3019-3036. [13] 冯艳红,杨娟,贺毅朝,等.差分进化帝王蝶优化算法求解折扣{0-1}背包问题[J].电子学报,2018,46(6):1343-1350.(FENG Y H, YANG J, HE Y C, et al. Monarch butterfly optimization algorithm with differential evolution for the discounted {0-1} knapsack problem[J]. Acta Electronica Sinica, 2018, 46(6):1343-1350.) [14] FENG Y, WANG G-G. Binary moth search algorithm for discounted {0-1} knapsack problem[J]. IEEE Access, 2018, 6(99):10708-10719. [15] 刘雪静,贺毅朝,路凤佳,等.基于Lévy飞行的差分乌鸦算法求解折扣{0-1}背包问题[J].计算机应用,2018,38(2):433-442.(LIU X J, HE Y C, LU F J, et al. Differential crow search algorithm based on Lévy flight for solving discount {0-1} knapsack problem[J]. Journal of Computer Applications, 2018, 38(2):433-442.) [16] 刘雪静,贺毅朝,路凤佳,等.基于差分演化策略的混沌乌鸦算法求解折扣{0-1}背包问题[J].计算机应用,2018,38(1):137-145.(LIU X J, HE Y C, LU F J, et al. Chaotic crow search algorithm based on differential evolution strategy for solving discount {0-1} knapsack problem[J]. Journal of Computer Applications, 2018,38(1):137-145.) [17] 吴聪聪,贺毅朝,陈嶷瑛,等.变异蝙蝠算法求解折扣{0-1}背包问题[J].计算机应用,2017,37(5):1292-1299.(WU C C, HE Y C, CHEN Y Y, et al. Mutated bat algorithm for solving discounted {0-1} knapsack problem[J]. Journal of Computer Applications, 2017, 37(5):1292-1299.) [18] 刘雪静,贺毅朝,吴聪聪,等.基于细菌觅食算法求解折扣{0-1}背包问题的研究[J].计算机工程与应用,2018,54(2):155-162.(LIU X J, HE Y C, WU C C, et al. Research on bacterial foraging optimization algorithm for discounted {0-1} knapsack problem[J]. Computer Engineering and Applications, 2018, 54(2):155-162.) [19] 杨洋,潘大志,贺毅朝.改进修复策略遗传算法求解折扣{0-1}背包问题[J/OL].计算机工程与应用,2018[2018-07-30].http://kns.cnki.net/kcms/detail/11.2127.TP.20180319.1806.006.html.(YANG Y, PAN D Z, HE Y C. Improved repair strategy genetic algorithm solve discount {0-1} knapsack problem[J]. Computer Engineering and Applications, 2018[2018-07-30]. http://kns.cnki.net/kcms/detail/11.2127.TP.20180319.1806.006.html.) [20] MICHALEWICZ Z, SCHOENAUER M. Evolutionary algorithms for constrained parameter optimization problems[J]. Evolutionary Computation, 1996, 4(1):1-32. [21] RUNARSSON T P, YAO X. Stochastic ranking for constrained evolutionary optimization[J]. IEEE Transactions on Evolutionary Computation, 2000, 4(3):284-294. [22] COELLO C A. Theoretical and numerical constraint-handling techniques used with evolutionary algorithm:a survey of the state of art[J]. Computer Methods in Applied Mechanics and Engineering, 2002, 191(11/12):1245-1287. [23] RUDOLPH G. Convergence analysis of canonical genetic algorithms[J]. IEEE Transactions on Neural Networks, 1994, 5(1):96-101. [24] GOLDBERG D E. Genetic algorithms in search[J]. Optimization and Machine Learning, 1989, 13(7):2104-2116. [25] HOLLAND J H. Adaptation in Natural and Artificial Systems[M]. Cambridge, MA:MIT Press, 1992:1-13. [26] SCHMITT L M. Theory of genetic algorithms[J]. Theoretical Computer Science, 2001, 259(1/2):1-61. [27] SIVANANDAM S N, DEEPA S N. Introduction to Genetic Algorithms[M]. Berlin:Springer, 2008:1-19. [28] 陈国良,王熙法,庄镇泉,等.遗传算法及其应用[M].北京:人民邮电出版社,1999:1-25.(CHEN G L, WANG X F, ZHUANG Z Q, et al. Genetic Algorithm and Its Application[M]. Beijing:Posts & Telecom Press, 1999:1-25.) [29] 刘勇.非数值并行算法.第二册,遗传算法[M]. 北京:科学出版社,1995:36-45.(LIU Y. Non-numerical Parallel Algorithm. Book 2, Genetic Algorithm[M]. Beijing:Science Press, 1995:36-45.) [30] PIRKUL H. A heuristic solution procedure for the multiconstraint zero-one knapsack problem[J]. Naval Research Logistics, 1987, 34(2):161-172. [31] LV J, WANG X, HUANG M, et al. Solving 0-1 knapsack problem by greedy degree and expectation efficiency[J]. Applied Soft Computing, 2016, 41(C):94-103. [32] TESSEMA B, YEN G G. An adaptive penalty formulation for constrained evolutionary optimization[J]. IEEE Transactions on Systems, Man and Cybernetics-Part A:Systems and Humans, 2009, 39(3):565-578. |