Genetic Artificial Hummingbird Algorithm-Support Vector Machine for Timely Power Theft Detection
Utilities face serious obstacles from power theft, which calls for creative ways to maintain income and improve operational effectiveness. This study presents a novel hybrid genetic artificial hummingbird algorithm-support vector machine classifier to detect power theft. The proposed algorithm combi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2024/5568922 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Utilities face serious obstacles from power theft, which calls for creative ways to maintain income and improve operational effectiveness. This study presents a novel hybrid genetic artificial hummingbird algorithm-support vector machine classifier to detect power theft. The proposed algorithm combines the artificial hummingbird algorithm exploration phase with the genetic algorithm’s mutation and crossover operators, to optimize the support vector machine’s hyperparameters and categorize users as fraudulent or nonfraudulent. It utilizes 7,270 rows of labeled historical electricity consumption data from the Liberia Electricity Corporation over 15 independent runs. The methodology entailed data preprocessing, data split into training, validation, and testing sets in an 80-10-10 ratio, z-score normalization, optimization, training, validation, testing, and computation of six evaluation metrics. Its performance is compared with 13 metaheuristic classifiers and the conventional support vector machine. Findings indicate that the genetic artificial hummingbird algorithm-support vector machine outperforms the 13 rivals and the standard support vector machine in the six assessment measures with an accuracy score of 0.9986, precision of 0.9971, f_score of 0.9986, recall of 1, Matthews correlation coefficient of 0.9972, and g_mean of 0.9987. Furthermore, 90% of the time, Wilcoxon rank-sum tests revealed statistically significant differences between the algorithm and its rivals, demonstrating its superiority. The average run time is 4,656 seconds, the 3rd highest among its competitors. Despite the time complexity trade-off, its excellent performance on the unimodal and multimodal benchmark test functions, placing joint best in 7 out of 7 and 5 out of 6, respectively, provides important insights into the model’s capacity to balance exploitation and exploration, improve local search, and avoid becoming stuck in the local optimum. These findings address important metaheuristic optimization gaps highlighting the model’s potential for power theft detection. |
|---|---|
| ISSN: | 1537-744X |