A binary firefly algorithm for knapsack problems
作者： Kaushik Kumar Bhattacharjee , S.P. Sarmah
DOI: 10.1109/IEEM.2015.7385611
关键词:
摘要: Knapsack problems are one of the classical NP-hard problem and it offers many practical applications in vast field different areas. Several traditional as well population based metaheuristic algorithms applied to solve this problem. In paper, we introduce binary version firefly algorithm (FA) for solving knapsack problems, specially 01 The modified utilizes advantages variable distance move along with opposition-based learning mechanism efficiently. So far FA is generally continuous optimization problems. order investigate performance on combinatorial problem, an attempt made paper. To demonstrate efficiency proposed extensive computational study provided standard bench mark instances comparison particle swarm also carried out.
sci-hub.se 参考文章(20)
Jochen Thiel, Stefan Voss, Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms Infor. ,vol. 32, pp. 226- 242 ,(1994) , 10.1080/03155986.1994.11732253
Gilang Kusuma Jati, Suyanto, Evolutionary Discrete Firefly Algorithm for Travelling Salesman Problem Adaptive and Intelligent Systems. pp. 393- 403 ,(2011) , 10.1007/978-3-642-23857-4_38
Xin-She Yang, Firefly algorithms for multimodal optimization international conference on stochastic algorithms foundations and applications. pp. 169- 178 ,(2009) , 10.1007/978-3-642-04944-6_14
Bin Ye, Jun Sun, Wen-Bo Xu, Solving the Hard Knapsack Problems with a Binary Particle Swarm Approach Computational Intelligence and Bioinformatics. pp. 155- 163 ,(2006) , 10.1007/11816102_17
Supravo Palit, Saptarshi Neil Sinha, Mostafiz Amin Molla, Atreyee Khanra, Malay Kule, A cryptanalytic attack on the knapsack cryptosystem using binary Firefly algorithm international conference on computer and communication technology. pp. 428- 432 ,(2011) , 10.1109/ICCCT.2011.6075143
K. Chandrasekaran, Sishaj P. Simon, Network and reliability constrained unit commitment problem using binary real coded firefly algorithm International Journal of Electrical Power & Energy Systems. ,vol. 43, pp. 921- 932 ,(2012) , 10.1016/J.IJEPES.2012.06.004
Kaushik Kumar Bhattacharjee, S.P. Sarmah, Shuffled frog leaping algorithm and its application to 0/1 knapsack problem Applied Soft Computing. ,vol. 19, pp. 252- 263 ,(2014) , 10.1016/J.ASOC.2014.02.010
Aizhen Liu, Jiazhen Wang, Guodong Han, Suzhen Wang, Jiafu Wen, Improved Simulated Annealing Algorithm Solving for 0/1 Knapsack Problem intelligent systems design and applications. ,vol. 2, pp. 1159- 1164 ,(2006) , 10.1109/ISDA.2006.253776
Sangwook Lee, Sangmoon Soak, Sanghoun Oh, Witold Pedrycz, Moongu Jeon, Modified binary particle swarm optimization Progress in Natural Science. ,vol. 18, pp. 1161- 1166 ,(2008) , 10.1016/J.PNSC.2008.03.018
Ragheb Rahmaniani, Abdolsalam Ghaderi, A combined facility location and network design problem with multi-type of capacitated links Applied Mathematical Modelling. ,vol. 37, pp. 6400- 6414 ,(2013) , 10.1016/J.APM.2013.01.001