ATArit Thammano

Arit Thammano

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Arit Thammano has a total of 26 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Genetic Algorithm with Guided Search and Multi-Heuristic Operators for Solving Traveling Salesman Problems

    by Jihan Alya Permata Mexda, Arit Thammano

    To address the poor solution quality, slow convergence, and susceptibility to premature convergence of genetic algorithm (GA) in solving the Traveling Salesman Problem (TSP), this study introduces a guided search framework with multi-heuristic operators. The proposed approach integrates three novel heuristic operators and an enhanced local search mechanism: (1) a hybrid initialization technique that combines a greedy approach to prioritize high-quality starting points with random sampling to maintain population variance; (2) a novel bidirectional greedy sequential constructive crossover integrated with order crossover (BGSCX-OX) to achieve an ideal equilibrium between local refinement and global search; (3) an adaptive hybrid mutation strategy that self-adjusts based on real-time search conditions; and (4) an improved 3-Opt for local refinement. The effectiveness of the proposed algorithm is validated using 26 benchmark instances from the TSPLIB dataset. Experimental results show that GA-GSMHO outperforms the original GA and six state-of-the-art metaheuristic algorithms. It achieves higher solution quality, faster convergence, and greater stability of results.

  • Open Access

    Discrete Evolutionary Algorithm with Distance-Based Crossover and Multiple Mutation Strategy for Traveling Salesman Problems

    by Rujira Jullapak, Arit Thammano

    The Traveling Salesman Problem (TSP) is a fundamental combinatorial optimization problem for which traditional evolutionary algorithms often converge prematurely and yield suboptimal solutions as problem complexity increases. This study aims to overcome these limitations by developing an optimization approach that maintains population diversity while accelerating convergence toward optimal routes. To address these challenges, we introduce Evolutionary Algorithm with Distance-based Crossover and Multiple Mutation Strategy (EADXMM), a novel evolutionary algorithm characterized by its unique hybrid mechanism. Unlike standard approaches, EADXMM employs a distance-based crossover operator to produce better-guided offspring and a multi-strategy mutation framework that actively preserves and enhances population diversity. Following the mutation phase, a complete 2-opt local search is executed to refine candidate solutions and ensure rapid convergence. The performance of EADXMM was rigorously evaluated on 22 benchmark TSP instances of varying scale from the TSPLIB repository and compared against four established metaheuristics: ACO, VTPSO, ABCSS, and DSMO. Experimental results demonstrate that EADXMM exhibits superior robustness and solution quality, consistently outperforming the competing algorithms on 15 of the 22 benchmark instances. These findings confirm that the strategic integration of distance-based crossover, diversified mutation methods, and complete 2-opt local search effectively navigates the complex search space, enabling highly efficient route determination for large-scale TSPs.

  • Open Access

    A Self-Adaptive Weights for K-Means Classification Algorithm

    by Cui Chenghu, Arit Thammano

    This paper presents an improved K-means clustering algorithm that addresses the traditional algorithm’s sensitivity to outlier and susceptibility to local optima by introducing an adaptive weight adjustment mechanism. It employs an exponential decay function to dynamically reduce the feature weights of outlier data points, effectively suppressing outliers while preserving the structure of the normal data. The proposed method retains the computational efficiency of standard K-means. Key contributions include: (a) A novel distance-based weighting strategy that progressively reduces the influence of noisy points, mitigating the impact of outliers on clustering performance. (b) An innovative form of "local dimensionality reduction" for outlier points via weight decay, which interferes only with the feature space of noisy regions while preserving the global topological structure of clean data. Extensive experiments on three benchmark datasets Iris (4-dimensional, balanced classes), Wine (13-dimensional, correlated features), and Wisconsin Breast Cancer Diagnosis (30-dimensional, imbalanced data) demonstrate the effectiveness of the approach. Compared to standard K-means, the proposed algorithm achieves accuracy improvements of 7.47% on Iris, 13.89% on Wine, and 19% on WBCD. This adaptive strategy offers a practical and efficient solution for clustering in noisy, high-dimensional environments, without the added complexity of mixture models.


  • Open Access

    Differential Evolution With Self-Adaptive Mutation and Population Improvement Strategy for Optimization Problems

    by Irfan Farda, Arit Thammano, John Morris

    Differential Evolution (DE) algorithms are widely recognized as effective metaheuristic techniques used to solve continuous optimization problems. However, DE algorithms encounter limitations in exploration and exploitation due to their sensitivity to parameter settings and reliance on mutation strategies. To overcome these drawbacks, we introduced a self-adaptive mutation and population improvement strategy in differential evolution, SAMPIDE. The algorithm adjusts the mutation operator automatically according to the successful mutation operator value from the previous generation. Additionally, to enhance the algorithm’s convergence, we adopted a random learning mechanism to update the population. SAMPIDEwas compared with nine state-of-the-art DE variants and four other metaheuristic algorithms across thirty-two benchmark functions. SAMPIDE consistently outperformed others on unimodal, step and noisy functions, while maintaining competitive performance on multimodal functions. Additionally, when tested on five real-world problems, SAMPIDE outperformed other metaheuristic algorithms. Thus, the self-adaptive mutation and population improvement strategy incorporated into SAMPIDE positioned it as a promising solution for a wide range of optimization problems.


  • Open Access

    A Novel Classification Model Based on Hybrid K-Means and Neural Network for Classification Problems

    by Cui Chenghu, Arit Thammano

    We propose a new classification model—a new classification model for clustering overlapping problems based on K-Means and neural networks. K-means clustering algorithm belongs to unsupervised learning. It is a classic algorithm for solving clustering problems. Since this algorithm calculates its categories based on distance, the results tend to converge to the local optimal solution and have poor boundary clustering properties. The K-Means classification algorithm defines clusters by the distance between the cluster center value and the target object, and the optimal result is obtained through continuous iteration. Therefore, clustering results are overlapped, and there are often outliers that do not belong to the current cluster, resulting in unsatisfactory clustering results. Our model offers a new method to segment non-ideal data in overlapping regions. Since clustering algorithms cannot effectively identify and classify this part of the data, we split this part of the data and train it using a neural network. The results are then integrated into the clustered data. In the experiment, the k-fold cross-validation method ensures the model stability of the results. We used the accuracy to evaluate the quality of the model, and we used standard deviation and mean deviation to detect clustering results. Five sets of experimental data from the cross-experiment show that compared with the K-Means classification model, the accuracy of our model is effectively improved. Doi: 10.28991/HIJ-2024-05-03-012 Full Text: PDF


  • Open Access

    An Improved Differential Evolution Algorithm for Numerical Optimization Problems

    by Irfan Farda, Arit Thammano

    The differential evolution algorithm has gained popularity for solving complex optimization problems because of its simplicity and efficiency. However, it has several drawbacks, such as a slow convergence rate, high sensitivity to the values of control parameters, and the ease of getting trapped in local optima. In order to overcome these drawbacks, this paper integrates three novel strategies into the original differential evolution. First, a population improvement strategy based on a multi-level sampling mechanism is used to accelerate convergence and increase the diversity of the population. Second, a new self-adaptive mutation strategy balances the exploration and exploitation abilities of the algorithm by dynamically determining an appropriate value of the mutation parameters; this improves the search ability and helps the algorithm escape from local optima when it gets stuck. Third, a new selection strategy guides the search to avoid local optima. Twelve benchmark functions of different characteristics are used to validate the performance of the proposed algorithm. The experimental results show that the proposed algorithm performs significantly better than the original DE in terms of the ability to locate the global optimum, convergence speed, and scalability. In addition, the proposed algorithm is able to find the global optimal solutions on 8 out of 12 benchmark functions, while 7 other well-established metaheuristic algorithms, namely NBOLDE, ODE, DE, SaDE, JADE, PSO, and GA, can obtain only 6, 2, 1, 1, 1, 1, and 1 functions, respectively. Doi: 10.28991/HIJ-2023-04-02-014 Full Text: PDF