[1] KENNEDY J,EBERHART R C. Particle swarm optimization[C]//Proceedings of the 1995 International Conference on Neural Networks. Piscataway:IEEE,1995:1942-1948. [2] MEISSNER M, SCHMUKER M, SCHNEIDER G. Optimized Particle Swarm Optimization(OPSO)and its application to artificial neural network training[J]. BMC Bioinformatics, 2006, 7:No. 125. [3] EI-GALLAND A I,EI-HAWARY M E,SSLLAM A A. Swarming of intelligent particles for solving the nonlinear constrained optimization problem[J]. International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications, 2001,9(3):155-163. [4] 张其亮, 陈永生, 韩斌. 改进的粒子群算法求解置换流水车间调度问题[J]. 计算机应用,2012,32(4):1022-1024,1029. (ZHANG Q L,CHEN Y S,HAN B. Improved particle swarm optimization for permutation flowshop scheduling problem[J]. Journal of Computer Applications,2012,32(4):1022-1024, 1029.) [5] KENNEDY J,EBERHART R C. A discrete binary version of the particle swarm algorithm[C]//Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Piscataway:IEEE,1997:4104-4108. [6] MIRJALILI S, LEWIS A. S-shaped versus V-shaped transfer functions for binary particle swarm optimization[J]. Swarm and Evolutionary Computation,2013,9:1-14. [7] MARCHAND H,WOLSEY L A. The 0-1 Knapsack problem with a single continuous variable[J]. Mathematical Programming,1999, 85(1):15-33. [8] LIN G,ZHU W,ALI M M. An exact algorithm for the 0-1 knapsack problem with a single continuous variable[J]. Journal of Global Optimization,2011,50(4):657-673. [9] 贺毅朝, 张新禄, 曲文龙, 等. 求解具有单连续变量背包问题的精确算法[J]. 数学的实践与认识,2018,48(13):216-223.(HE Y C,ZHANG X L,QU W L,et al. Exact algorithm for solving knapsack problem with a single continuous variable[J]. Mathematics in Practice and Theory,2018,48(13):216-223.) [10] ZHAO C,LI X. Approximation algorithms on 0-1 linear knapsack problem with a single continuous variable[J]. Journal of Combinatorial Optimization,2014,28(4):910-916. [11] 贺毅朝, 王熙照, 张新禄, 等. 基于离散差分演化的KPC问题降维建模与求解[J]. 计算机学报,2019,42(10):2267-2280. (HE Y C,WANG X Z,ZHANG X L,et al. Modeling and solving by dimensionality reduction of KPC problem based on discrete differential evolution[J]. Chinese Journal of Computers,2019,42(10):910-916.) [12] 贺毅朝, 王熙照, 寇应展. 一种具有混合编码的二进制差分演化算法[J]. 计算机研究与发展,2007,44(9):1476-1484.(HE Y C,WANG X Z,KOU Y Z. A binary differential evolution algorithm with hybrid encoding[J]. Journal of Computer Research and Development,2007,44(9):1476-1484.) [13] 贺毅朝, 王彦祺, 刘建芹. 一种适于求解离散问题的二进制粒子群优化算法[J]. 计算机应用与软件,2007,24(1):157-159. (HE Y C,WANG Y Q,LIU J Q. A new binary particle swarm optimization for solving discrete problems[J]. Computer Applications and Software,2007,24(1):157-159.) [14] MAFARJA M,ELEYAN D,ABDULLAH S,et al. S-shaped vs. V-shaped transfer functions for ant lion optimization algorithm in feature selection problem[C]//Proceedings of the 2017 International Conference on Future Networks and Distributed Systems. New York:ACM,2017:No. 21. [15] LEE S,SOAK S,OH S,et al. Modified binary particle swarm optimization[J]. Progress in Natural Science,2008,18(9):1161-1166. [16] CORMEN T H, LEISERSON C E, RIVEST R L, et al. Introduction to Algorithms:3rd Ed[M]. Cambridge:MIT Press, 2009:71-112. [17] EMARY E,ZAWBAA H M,HASSANIEN A E. Binary grey wolf optimization approaches for feature selection[J]. Neurocomputing,2016,172:371-381. [18] CHVATAL V. A greedy heuristic for the set-covering problem[J]. Mathematics of Operations Research,1979,4(3):233-235. [19] BALCIK B,BEAMON B M. Facility location in humanitarian relief[J]. International Journal of Logs Research and Applications,2008,11(2):101-121. |