[1] WILBAUT C, SALHI S, HANAFI S. An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem [J]. European Journal of Operational Research, 2009, 199(2): 339-348. [2] AGHEZZAF B, NAIMI M. The two-stage recombination operator and its application to the multiobjective 0/1 knapsack problem: a comparative study [J]. Computers & Operations Research, 2009, 36(12): 3247-3262. [3] HILL R R, CHO Y K, MOORE J T. Problem reduction heuristic for the 0-1 multidimensional knapsack problem [J]. Computers & Operations Research, 2012, 39(1): 19-26. [4] GIBSON M R, OHLMANN J W, FRY M J. An Agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition [J]. Computers & Operations Research, 2010, 37(3): 598-609. [5] YOON Y, KIM Y, MOON B. A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem [J]. European Journal of Operational Research, 2012, 218(2): 366-376. [6] LI Y, LI X. A continuous solution to linear 0-1 programming [J]. Journal of Dalian University of Technology, 2009, 49(2): 299-302.(李艳艳,李兴斯.求解线性0-1规划的一种连续化方法[J].大连理工大学学报,2009,49(2):299-302.) [7] LIN F. Solving the knapsack problem with imprecise weight coefficients using genetic algorithms [J]. European Journal of Operational Research, 2008, 185(1): 133-145. [8] MA F, XIE L, ZHENG Z. Attribute gene-reserved genetic algorithm for solving knapsack problem [J]. Journal of Tianjin University, 2010, 43(11): 1020-1024.(马丰宁,谢龙,郑重.求解背包问题的基因属性保留遗传算法[J].天津大学学报,2010,43(11):1020-1024.) [9] YAN Y, WANG D, WANG D, et al. MultiAgent-based evolutionary algorithm for dynamic knapsack problem [J]. Journal of Northeastern University: Natural Science, 2009, 30(7): 948-951.(闫杨,汪定伟,王大志,等.求解动态背包问题的多智能体进化算法[J].东北大学学报:自然科学版,2009,30(7):948-951.) [10] BANSAL J C, DEEP K. A modified binary particle swarm optimization for knapsack problems [J]. Applied Mathematics and Computation, 2012, 218(22): 11042-11061. [11] ZHOU S, PAN W, LUO B, et al. A novel quantum genetic algorithm based on particle swarm optimization method and its application [J]. Acta Electronica Sinica, 2006, 34(5): 897-901.(周殊,潘炜,罗斌,等.一种基于粒子群优化方法的改进量子遗传算法及应用[J].电子学报,2006,34(5):897-901.) [12] ZHANG W, LU T. The research of genetic ant colony algorithm and its application [J]. Procedia Engineering, 2012, 37: 101-106. [13] REN Z, FENF Z, ZHANG A. Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem [J]. Information Sciences, 2012, 182(1): 15-29. [14] SONG X, SUN D, XIE J. Improved artificial fish swarm algorithm based on polar coordinate coding [J]. System Engineering and Electronics, 2010, 32(10): 2248-2251.(宋潇潇,孙棣华,解佳.基于极坐标编码的改进人工鱼群算法[J].系统工程与电子技术,2010,32(10):2248-2251.) [15] PĂUN G. Computing with membranes [J]. Journal of Computer and System Sciences, 2000, 61(1): 108-143. [16] KARABOGA D. An idea based on honey bee swarm for numerical optimization, technical report TR06 [R]. Kayseri: Erciyes University, Engineering Faculty, Computer Engineering Department, 2005. [17] KARABOGA D, NASTURK B. A powerful and efficient algorithm for numerical function optimization: Artificial Bee Colony (ABC) algorithm [J]. Journal of Global Optimization, 2007, 39(3): 459-471. [18] KARABOGA D, BASTURK B. On The performance of Artificial Bee Colony (ABC) algorithm [J]. Applied Soft Computing, 2008, 8(1): 687-697. [19] KARABOGA D, AKAY B. A comparative study of artificial bee colony algorithm [J]. Applied Mathematics and Computation, 2009, 214(1): 108-132. [20] NISHIDA T Y. An application of P-system: a new algorithm for NP-complete optimization problems [C]// Proceedings of the 8th World Multi-Conference on Systems, Cybernetics and Informatics. Orlando: International Institute of Informations and Systemics, 2004: 109-112. [21] HUANG L, HE X, WANG N, et al. P systems based multi-objective optimization algorithm [J]. Progress in Natural Science, 2007, 17(4): 458-465. [22] CHENG J, ZHANG G, ZENG X. A novel membrane algorithm based on differential evolution for numerical optimization [J]. International Journal of Unconventional Computing, 2011, 7(3): 159-183. [23] ZHANG G, GHEORGHE M, WU C. A quantum-inspired evolutionary algorithm based on P systems for knapsack problem [J]. Fundamenta Informaticae, 2008, 87(1): 93-116. [24] ZHANG G, GHEORGHE M, LI Y. A membrane algorithm with quantum-inspired subalgorithms and its application to image processing [J]. Natural Computing, 2012, 11(4): 701-717. [25] ZHANG G, CHENG J, GHEORGHE M, et al. A hybrid approach based on differential evolution and tissue membrane systems for solving constrained manufacturing parameter optimization problems [J]. Applied Soft Computing, 2013, 13(3): 1528-1542. [26] ZHANG G, ZHOU F, HUANG X. A novel membrane algorithm based on particle swarm optimization for optimization for solving broadcasting problems [J]. Journal of Universal Computer Science, 2012, 18(13): 1821-1841. [27] TU M, WANG J, SONG X, et al. An artificial fish swarm algorithm based on P systems [J]. ICIC Express Letters, Part B: Applications, 2013, 4(3): 747-753. [28] WU H, QIAN S, XU Z. Immune genetic algorithm based on clonal selection and its application to 0/1 knapsack problem [J]. Journal of Computer Applications, 2013, 33(3): 845-848.(武慧虹,钱淑渠,徐志丹.克隆选择免疫遗传算法对高维0/1背包问题应用[J].计算机应用,2013,33(3):845-848.) [29] SONG X, WANG J. A membrane-inspired evolutionary algorithm based on artificial bee colony algorithm [C]// BIC-TA 2014: Proceedings of the 9th International Conference on Bio-Inspired Computing-Theories and Applications. Berlin: Springer, 2014: 395-410. |