social group optimization
Recently Published Documents


TOTAL DOCUMENTS

47
(FIVE YEARS 29)

H-INDEX

7
(FIVE YEARS 4)

2022 ◽  
Vol 11 (1) ◽  
pp. 55-72 ◽  
Author(s):  
Anima Naik ◽  
Pradeep Kumar Chokkalingam

In this paper, we propose the binary version of the Social Group Optimization (BSGO) algorithm for solving the 0-1 knapsack problem. The standard Social Group Optimization (SGO) is used for continuous optimization problems. So a transformation function is used to convert the continuous values generated from SGO into binary ones. The experiments are carried out using both low-dimensional and high-dimensional knapsack problems. The results obtained by the BSGO algorithm are compared with other binary optimization algorithms. Experimental results reveal the superiority of the BSGO algorithm in achieving a high quality of solutions over different algorithms and prove that it is one of the best finding algorithms especially in high-dimensional cases.


2021 ◽  
Vol 2070 (1) ◽  
pp. 012139
Author(s):  
V MNSSVKR Gupta ◽  
KVSS Murthy ◽  
R Shiva Shankar

Abstract Image denoising is essential to extract the information contained in an image without errors. A technique of using both wavelets and evolutionary computing tools is proposed to denoise and to improve the image quality. An adaptive thresholding-based wavelet denoising technique in the threshold function is coordinated by novel social group optimization (SGO) and accelerated particle swarm optimization (APSO) is proposed. The simulation oriented experimentation is taken out employing MATLAB and the analysis is carried out using the image property metrics similar to peak signal to noise ratio (PSNR), mean square error (MSE) and other structural similarity index metrics (SSIM).


2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Minh Quan Duong ◽  
Thang Trung Nguyen ◽  
Thuan Thanh Nguyen

In this paper, a modified equilibrium algorithm (MEA) is proposed for optimally determining the position and capacity of wind power plants added in a transmission power network with 30 nodes and effectively selecting operation parameters for other electric components of the network. Two single objectives are separately optimized, including generation cost and active power loss for the case of placing one wind power plant (WPP) and two wind power plants (WPPs) at predetermined nodes and unknown nodes. In addition to the proposed MEA, the conventional equilibrium algorithm (CEA), heap-based optimizer (HBO), forensic-based investigation (FBI), and modified social group optimization (MSGO) are also implemented for the cases. Result comparisons indicate that the generation cost and power loss can be reduced effectively, thanks to the suitable location selection and appropriate power determination for WPPs. In addition, the generation cost and loss of the proposed MEA are also less than those from other compared methods. Thus, it is recommended that WPPs should be placed in power systems to reduce cost and loss, and MEA is a powerful method for the placement of wind power plants in power systems.


2021 ◽  
pp. 15-26
Author(s):  
A. V. Sunil Kumar ◽  
R. Prakash ◽  
R. S. Shivakumara Aradhya ◽  
Mahesh Lamsal

Author(s):  
Dilip Golda ◽  
B. Prabha ◽  
K. Murali ◽  
K. Prasuna ◽  
Sai Sri Vatsav ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document