Abstract: This study explores the use of Genetic Algorithms (GA) to solve the NP-hard combinatorial optimization problem known as the Travelling Salesman Problem (TSP). The suggested GA, called GA-P, ...

Abstract: The traveling salesman problem (TSP) is a well-known combinatorial optimization problem (COP) with broad real-world applications. Recently, neural networks (NNs) have gained popularity in ...