CFP last date

by
Murinto,
Adhi Prahara,
Erik Iman Heri Ujianto

International Journal of Computer Applications |

Foundation of Computer Science (FCS), NY, USA |

Volume 183 - Number 21 |

Year of Publication: 2021 |

Authors: Murinto, Adhi Prahara, Erik Iman Heri Ujianto |

10.5120/ijca2021921580 |

Murinto, Adhi Prahara, Erik Iman Heri Ujianto . An Investigation of Logarithm Decreasing Inertia Weight Particle Swarm Optimization in Global Optimization Problem. International Journal of Computer Applications. 183, 21 ( Aug 2021), 35-40. DOI=10.5120/ijca2021921580

@article{
10.5120/ijca2021921580,

author = {
Murinto,
Adhi Prahara,
Erik Iman Heri Ujianto
},

title = { An Investigation of Logarithm Decreasing Inertia Weight Particle Swarm Optimization in Global Optimization Problem },

journal = {
International Journal of Computer Applications
},

issue_date = { Aug 2021 },

volume = { 183 },

number = { 21 },

month = { Aug },

year = { 2021 },

issn = { 0975-8887 },

pages = {
35-40
},

numpages = {9},

url = {
https://ijcaonline.org/archives/volume183/number21/32051-2021921580/
},

doi = { 10.5120/ijca2021921580 },

publisher = {Foundation of Computer Science (FCS), NY, USA},

address = {New York, USA}

}

%0 Journal Article

%1 2024-02-07T01:17:27.561159+05:30

%A Murinto

%A Adhi Prahara

%A Erik Iman Heri Ujianto

%T An Investigation of Logarithm Decreasing Inertia Weight Particle Swarm Optimization in Global Optimization Problem

%J International Journal of Computer Applications

%@ 0975-8887

%V 183

%N 21

%P 35-40

%D 2021

%I Foundation of Computer Science (FCS), NY, USA

This research investigates Logarithm Decreasing Inertia Weight (LogDIW) to improve the performance of Particle Swarm Optimization (PSO). The general problem of PSO algorithm is premature convergence when solving complex optimization problem. Some researchers try to solve the problem by modifying the PSO or proposing another PSO variants. Some PSO variants proved to have a better performance than the original PSO. The purpose of this research is to obtain some experimental facts to prove the efficiency of LogDIWPSO if the parameters are tuned correctly and to show that the LogDIWPSO performs better compared to the other PSO variants. In the early step of the experiment, a percentage value of search space boundary is obtained. This step is important to compute the velocity threshold of LogDIW based on the optimization problem. The next experiment is done to measure the performance of LogDIWPSO using six benchmark functions in optimization problems and to prove the superiority of LogDIWPSO compared to the other PSO variants. The experiment result shows that LogDIW achieves better performance than the other PSO variants.

- Eberhart, R. and Kennedy, J.1995. Particle swarm optimization, IEEE Int. Conf. Neural Networks, pp. 1942–8.
- Shi, E. and Eberhart,R. 1998. Modified particle swarm optimizer, Proc. IEEE Conf. Evol. Comput. ICEC, pp. 69–73.
- Eberhart and Yuhui Shi. 2002. Particle swarm optimization: developments, applications and resources,” no. February 2001, pp. 81–86.
- Yong, D. Chuansheng,W. and Haimin, G. 2018. Particle Swarm Optimization Algorithm with Adaptive Chaos Perturbation, Cybern. Inf. Technol., vol. 15, no. 6, pp. 70–80.
- Dileep, M. V. and Kamath, S. 2015. A review on particle swarm optimization algorithm and its devolopments,” Glob. J. Pure Appl. Math., vol. 11, no. 6, pp. 4997–5018.
- Mengxia, L. Ruiquan, L. and Yong, D. 2016. The Particle Swarm Optimization Algorithm with Adaptive Chaos Perturbation,” vol. 11, no. December, pp. 804–818.
- Xin, J. Chen, G. and Hai, Y. 2009. A particle swarm optimizer with multi-stage linearly-decreasing inertia weight,” Proc. 2009 Int. Jt. Conf. Comput. Sci. Optim. CSO 2009, vol. 1, pp. 505–508, 2009, doi: 10.1109/CSO.2009.420.
- Khare, A. and Rangnekar, S. 2013. A review of particle swarm optimization and its applications in Solar Photovoltaic system,” Appl. Soft Comput. J., vol. 13, no. 5, pp. 2997–3006.
- Feng, Y. Teng, G. F. Wang, A. X. and Yao, Y. M. 2008.Chaotic inertia weight in particle swarm optimization, Second Int. Conf. Innov. Comput. Inf. Control. ICICIC 2007, pp. 7–10.
- Malik, R. Rahman, F. T. a . Hashim, S. Z. M. and Ngah, R. 2007. New Particle Swarm Optimizer with Sigmoid Increasing Inertia Weight,” Int. J. Comput. Sci. Secur. IJCSS, vol. 1, no. 1, pp. 35–44.
- Kentzoglanakis, K. and Poole, M. 2009. Particle swarm optimization with an oscillating inertia weight,” Proc. 11th Annu. Genet. Evol. Comput. Conf. GECCO-2009, no. January 2009, pp. 1749–1750.
- Gao, Y.L. An, X. H. and Liu, J.M. 2008. A particle swarm optimization algorithm with logarithm decreasing inertia weight and chaos mutation,” Proc. - 2008 Int. Conf. Comput. Intell. Secur. CIS 2008, vol. 1, pp. 61–65, 2008.
- Li, H. R. and Gao, Y. L.2009. Particle swarm optimization algorithm with exponent decreasing inertia weight and stochastic mutation,” 2009 2nd Int. Conf. Inf. Comput. Sci. ICIC 2009, vol. 1, no. 3, pp. 66–69.
- Borowska, B. 2017. Exponential inertia weight in particle swarm optimization,” Adv. Intell. Syst. Comput., vol. 524, no. January 2015, pp. 265–275, 2017.
- Cui, Q. 2017. Globally-optimal prediction-based adaptive mutation particle swarm optimization,” Inf. Sci. (Ny)., vol. 418–419, pp. 186–217.

Computer Science

Information Sciences