Rujira Jullapak

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

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 main...