Computer Science – Neural and Evolutionary Computing
Scientific paper
2012-03-22
IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 1, No 1, 2012, 374-378
Computer Science
Neural and Evolutionary Computing
ISSN (Online): 1694-0814
Scientific paper
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). The Hybrid Mutation operator constructs an offspring from a pair of parents by hybridizing two mutation operators, PSM and RSM. The efficiency of the HPRM is compared as against some existing mutation operators; namely, Reverse Sequence Mutation (RSM) and Partial Shuffle Mutation (PSM) for BERLIN52 as instance of TSPLIB. Experimental results show that the new mutation operator is better than the RSM and PSM.
Abdoun Otman
Abouchabka Jaafar
Tajani Chakir
No associations
LandOfFree
Hybridizing PSM and RSM Operator for Solving NP-Complete Problems: Application to Travelling Salesman Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Hybridizing PSM and RSM Operator for Solving NP-Complete Problems: Application to Travelling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hybridizing PSM and RSM Operator for Solving NP-Complete Problems: Application to Travelling Salesman Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-382061