Article Per Year (5 Year)
p-Index From 2021 - 2026
0.61
P-Index
This Author published in this journals
All Journal Bulletin of Electrical Engineering and Informatics
Wetweerapong, Jeerayut
Unknown Affiliation
Electrical & Electronics Engineering

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
Self-adaptive differential evolution algorithm with dynamic fitness-ranking mutation and pheromone strategy Singsathid, Pirapong; Wetweerapong, Jeerayut; Puphasuk, Pikul
Bulletin of Electrical Engineering and Informatics Vol 13, No 1: February 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v13i1.6590

Abstract

Differential evolution (DE) is a population-based optimization algorithm widely used to solve a variety of continuous optimization problems. The self-adaptive DE algorithm improves the DE by encoding individual parameters to produce and propagate better solutions. This paper proposes a self-adaptive differential evolution algorithm with dynamic fitness-ranking mutation and pheromone strategy (SDE-FMP). The algorithm introduces the dynamical mutation operation using the fitness rank of the individuals to divide the population into three groups and then select groups and their vectors with adaptive probabilities to create a mutant vector. Mutation and crossover operations use the encoded scaling factor and the crossover rate values in a target vector to generate the corresponding trial vector. The values are changed according to the pheromone when the trial vector is inferior in the selection, whereas the pheromone is increased when the trial vector is superior. In addition, the algorithm also employs the resetting operation to unlearn and relearn the dominant pheromone values in the progressing search. The proposed SDE-FMP algorithm using the suitable resetting periods is compared with the well-known adaptive DE algorithms on several test problems. The results show that SDE-FMP can give high-precision solutions and outperforms the compared methods.
Differential evolution with adaptive mutation and crossover strategies for nonlinear regression problems Wongsa, Watchara; Puphasuk, Pikul; Wetweerapong, Jeerayut
Bulletin of Electrical Engineering and Informatics Vol 13, No 5: October 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v13i5.6417

Abstract

This paper presents the differential evolution algorithm with adaptive mutation and crossover strategies (DEAMC) for solving nonlinear regression problems. The DEAMC algorithm adaptively uses two mutation strategies and two ranges of crossover rate. We evaluate its performance on the National Institute of Standards and Technology (NIST) nonlinear-regression benchmark containing many models of varying levels of difficulty and compare it with classic differential evolution (DE), enhanced differential evolution algorithm with an adaptation of switching crossover strategy (DEASC), and controlled random search methods (CRS4HC, CRS4HCe). We also apply the proposed method to solve parameter identification applications and compare it with enhanced chaotic grasshopper optimization algorithms (ECGOA), self-adaptive differential evolution with dynamic mutation and pheromone strategy (SDE-FMP), and JAYA and its variant methods. The experimental results show that DEAMC is more reliable and gives more accurate results than the compared methods.
Non-centroid-based discrete differential evolution for data clustering Poonthong, Tanapon; Wetweerapong, Jeerayut
Bulletin of Electrical Engineering and Informatics Vol 14, No 1: February 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v14i1.8811

Abstract

Data clustering can find similarities and hidden patterns within data. Given a predefined number of groups, most partitional clustering algorithms use representative centers to determine their corresponding clusters. These algorithms, such as K-means and optimization-based algorithms, create and update centroids to give (hyper) spherical shape clusters. This research proposes a non-centroid-based discrete differential evolution (NCDDE) algorithm to solve clustering problems and provide non-spherical shape clusters. The algorithm directs the population of discrete vectors to search for data group labels. It uses a novel discrete mutation strategy analogous to the continuous mutation in classical differential evolution. It also combines a sorting mutation to enhance convergence speed. The algorithm adaptively selects crossover rates in high and low ranges. We use the UCI datasets to compare the NCDDE with other continuous centroid-based algorithms by intra-cluster distance and clustering accuracy. The results show that NCDDE outperforms the compared algorithms overall by intra-cluster distance and achieves the best accuracy for several datasets.
Co-Authors Poonthong, Tanapon Puphasuk, Pikul Singsathid, Pirapong Wongsa, Watchara