A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO

Applied Soft Computing Journal

Volumn 59, Issue , 2017, Pages 182-196

  Islam, Md Jakirul ^a   Li, Xiaodong ^a   Mei, Yi ^b  

^a RMIT UNIVERSITY   (Australia)

^b VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Binary particle swarm optimization; Discrete optimization problems; The 0 1 knapsack problem; The truss optimization problem; Transfer function

Indexed keywords

BINS; COMBINATORIAL OPTIMIZATION; CONVEX OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); TRANSFER FUNCTIONS; TRUSSES;

BINARY PARTICLE SWARM OPTIMIZATION; CONVEX OPTIMIZATION METHODS; DISCRETE OPTIMIZATION PROBLEMS; EXPLORATION AND EXPLOITATION; KNAPSACK PROBLEMS; META HEURISTIC ALGORITHM; TIME-VARYING TRANSFER FUNCTIONS; TRUSS OPTIMIZATION;

OPTIMIZATION;

EID: 85020254175     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2017.04.050     Document Type: Article

References (48)

1. Zou, D., Gao, L., Li, S., Wu, J., Solving 0–1 knapsack problem by a novel global harmony search algorithm. Appl. Soft Comput. 11 (2011), 1556–1564.
2. Pisinger, D., Where are the hard knapsack problems?. Comput. Oper. Res. 32 (2005), 2271–2284.
3. Geng, X., Chen, Z., Yang, W., Shi, D., Zhao, K., Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Appl. Soft Comput. 11 (2011), 3680–3689.
4. Pedrasa, M.A.A., Spooner, T.D., MacGill, I.F., Scheduling of demand side resources using binary particle swarm optimization. IEEE Trans. Power Syst. 24 (2009), 1173–1181.
5. Chen, P.-H., Kuo, C.-C., Chen, F.-H., Chen, C.-C., Refined binary particle swarm optimization and application in power system. WSEAS Trans. Syst., 2009, 169–178.
6. Parker, R.G., Rardin, R.L., Discrete Optimization. Computer Science and Applied Mathematics. 1988, Academic Press.
7. Yang, X.-S., Nature-inspired Metaheuristic Algorithms. 2010, Luniver press.
8. Kennedy, J., Eberhart, R.C., A discrete binary version of the particle swarm algorithm. Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, vol. 5, 1997, 4104–4108.
9. Liao, C.-J., Tseng, C.-T., Luarn, P., A discrete version of particle swarm optimization for flowshop scheduling problems. Comput. Oper. Res. 34 (2007), 3099–3111.
10. Jarboui, B., Damak, N., Siarry, P., Rebai, A., A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl. Math. Comput. 195 (2008), 299–308.
11. Naeem, M., Pareek, U., Lee, D.C., Swarm intelligence for sensor selection problems. IEEE Sens. J. 12 (2012), 2577–2585.
12. Lin, J.C.-W., Yang, L., Fournier-Viger, P., Hong, T.-P., Voznak, M., A binary PSO approach to mine high-utility itemsets. Soft Comput., 2016, 1–19.
13. Han, L., Huang, C., Zheng, S., Zhang, Z., Xu, L., Vanishing point detection and line classification with BPSO. Signal Image Video Process. 11 (2017), 17–24.
14. Bansal, J.C., Deep, K., A modified binary particle swarm optimization for knapsack problems. Appl. Math. Comput. 218 (2012), 11042–11061.
15. Mirjalili, S., Lewis, A., S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm Evol. Comput. 9 (2013), 1–14.
16. Jian-Hua, L., Rong-Hua, Y., Shui-Hua, S., The analysis of binary particle swarm optimization. J. Nanjing Univ. (Nat. Sci.) 47 (2011), 504–514.
17. Ting, T., Rao, M.V.C., Loo, C.K., A novel approach for unit commitment problem via an effective hybrid particle swarm optimization. IEEE Trans. Power Syst. 21 (2006), 411–418.
18. Tassopoulos, I.X., Beligiannis, G.N., Solving effectively the school timetabling problem using particle swarm optimization. Expert Syst. Appl. 39 (2012), 6029–6040.
19. Tassopoulos, I.X., Beligiannis, G.N., A hybrid particle swarm optimization based algorithm for high school timetabling problems. Appl. Soft Comput. 12 (2012), 3472–3489.
20. Liu, D., Jiang, Q., Chen, J.X., Binary inheritance learning particle swarm optimisation and its application in thinned antenna array synthesis with the minimum sidelobe level. IET Microw. Antennas Propag. 9 (2015), 1386–1391.
21. Han, F., Yang, C., Wu, Y.Q., Zhu, J.S., Ling, Q.H., Song, Y.Q., Huang, D.S., A gene selection method for microarray data based on binary PSO encoding gene-to-class sensitivity information. IEEE/ACM Trans. Comput. Biol. Bioinf. 14 (2017), 85–96.
22. Liu, J., Mei, Y., Li, X., An analysis of the inertia weight parameter for binary particle swarm optimization. IEEE Trans. Evol. Comput., 2015 1–1.
23. Wang, L., Yang, R., Xu, Y., Niu, Q., Pardalos, P.M., Fei, M., An improved adaptive binary harmony search algorithm. Inf. Sci. 232 (2013), 58–87.
24. Wang, L., Wang, X., Fu, J., Zhen, L., A novel probability binary particle swarm optimization algorithm and its application. J. Softw. 3 (2008), 28–35.
25. Jeong, Y.W., Park, J.B., Jang, S.H., Lee, K.Y., A new quantum-inspired binary PSO: application to unit commitment problems for power systems. IEEE Trans. Power Syst. 25 (2010), 1486–1495.
26. Modiri, A., Kiasaleh, K., Modification of real-number and binary PSO algorithms for accelerated convergence. IEEE Trans. Antennas Propag. 59 (2011), 214–224.
27. Beheshti, Z., Shamsuddin, S.M., Yuhaniz, S.S., Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems. J. Global Optim. 57 (2013), 549–573.
28. Banka, H., Dara, S., A hamming distance based binary particle swarm optimization (HDBPSO) algorithm for high dimensional feature selection, classification and validation. Pattern Recognit. Lett. 52 (2015), 94–100.
29. Jordehi, A.R., Jasni, J., Particle swarm optimisation for discrete optimisation problems: a review. Artif. Intell. Rev. 43 (2015), 243–258.
30. Wang, D., Tan, D., Liu, L., Particle swarm optimization algorithm: an overview. Soft Comput., 2017, 1–22.
31. Lee, S., Soak, S., Oh, S., Pedrycz, W., Jeon, M., Modified binary particle swarm optimization. Prog. Nat. Sci. 18 (2008), 1161–1166.
32. Shen, Q., Jiang, J.-H., Jiao, C.-X., Li Shen, G., Yu, R.-Q., Modified particle swarm optimization algorithm for variable selection in MLR and PLS model: QSAR studies of antagonism of angiotensin II antagonists. Eur. J. Pharm. Sci. 22 (2004), 145–152.
33. Wang, L., Wang, X., Fu, J., Zhen, L., A novel probability binary particle swarm optimization algorithm and its application. J. Softw. 3 (2008), 28–35.
34. Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.-P., Auger, A., Tiwari, S., Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL report 2005005, 2005, 2005.
35. Eberhart, R.C., Shi, Y., Particle swarm optimization: developments, applications and resources. Proceedings of the 2001 Congress on Evolutionary Computation, vol. 1, 2001, IEEE, 81–86.
36. del Valle, Y., Venayagamoorthy, G.K., Mohagheghi, S., Hernandez, J.-C., Harley, R.G., Particle swarm optimization: basic concepts, variants and applications in power systems. IEEE Trans. Evol. Comput. 12 (2008), 171–195.
37. Jin, N., Rahmat-Samii, Y., Advances in particle swarm optimization for antenna designs: real-number, binary, single-objective and multiobjective implementations. IEEE Trans. Antennas Propag. 55 (2007), 556–567.
38. Montalvo, I., Izquierdo, J., Prez, R., Tung, M.M., Particle swarm optimization applied to the design of water supply systems. Comput. Math. Appl. 56 (2008), 769–776.
39. Chuang, L.-Y., Chang, H.-W., Tu, C.-J., Yang, C.-H., Improved binary PSO for feature selection using gene expression data. Comput. Biol. Chem. 32 (2008), 29–38.
40. Shahzad, F., Baig, A.R., Masood, S., Kamran, M., Naveed, N., Opposition-based particle swarm optimization with velocity clamping (OVCPSO). Advances in Computational Intelligence, 2009, Springer, 339–348.
41. Yang, J., Zhang, H., Ling, Y., Pan, C., Sun, W., Task allocation for wireless sensor network using modified binary particle swarm optimization. IEEE Sens. J. 14 (2014), 882–892.
42. Hamming, R.W., Error detecting and error correcting codes. Bell Syst. Tech. J. 29 (1950), 147–160.
43. Spillers, W., MacBain, K., Structural Optimization. 2009, Springer, US.
44. Sonmez, M., Artificial bee colony algorithm for optimization of truss structures. Appl. Soft Comput. 11 (2011), 2406–2418.
45. Kaveh, A., Khayatazad, M., Ray optimization for size and shape optimization of truss structures. Comput. Struct. 117 (2013), 82–94.
46. Kaveh, A., Sheikholeslami, R., Talatahari, S., Keshvari-Ilkhichi, M., Chaotic swarming of particles: a new method for size optimization of truss structures. Adv. Eng. Softw. 67 (2014), 136–147.
47. Bekdas, G., Nigdeli, S.M., Yang, X.-S., Sizing optimization of truss structures using flower pollination algorithm. Appl. Soft Comput. 37 (2015), 322–331.
48. Dede, T., Ayvaz, Y., Combined size and shape optimization of structures with a new meta-heuristic algorithm. Appl. Soft Comput. 28 (2015), 250–258.