文章基本信息

标题：Hybridizing PSM and RSM Operator for Solving NP-Complete Problems: Application to Traveling Salesman
本地全文：下载
作者：Chakir Tajani ; Otman Abdoun ; Jaafar Abouchabaka 等
期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2012
卷号：9
期号：1
出版社：IJCSI Press
摘要：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.
关键词：NP;complete problem; Traveling Salesman Problem; Mutation operator.