99 citations · 104 across the 4 of their papers we have counts for
Showing 2012 · cs.NEShow all
2 papers · 2 filters
cs.NE2012★ 4 cited
Hybridizing PSM and RSM Operator for Solving NP-Complete Problems: Application to Travelling Salesman Problem
Otman Abdoun, Chakir Tajani, Jaafar Abouchabka
In this paper, we present a new mutation operator, Hybrid Mutation (HPRM), for a genetic algorithm that generates high quality solutions to the Traveling Salesman Problem (TSP). Th…
cs.NE2012★ 99 cited
Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem
Otman Abdoun, Jaafar Abouchabaka, Chakir Tajani
The genetic algorithm includes some parameters that should be adjusted, so as to get reliable results. Choosing a representation of the problem addressed, an initial population, a…