Studying the effect of Eliminating Repeated Individuals from the Population in a Genetic Algorithm: Solution Perspectives for the Travelling Salesman Problem
Laura Michele Báez Villegas & Santiago Omar Caballero Morales · Journal of Engineering Research and Reports · 2021
The Travelling Salesman Problem (TSP) is one of the main routing problems in the Logistics and Supply Chain Management fields. Given its computational complexity, metaheuristics are frequently needed to solve it to near-optimality. In this aspect, Genetic Algorithms (GA) are prom...
Open access
Research Article
10.9734/jerr/2021/v20i1017393