Performance Analysis of proposed Mutation Operator of Genetic Algorithm under Scheduling Problem
Rajiv Kumar, Minakshi Memoria, Aseem Chandel
Abstract
The present paper proposed the new mutation operator. The Efficiency of the genetic algorithm is directly or indirectly depends upon it operators and its parameter setting. Mutation operator is the one the important operator which diversify the population. Here we proposed new mutation operator i.e selective swap mutation (SSM) operator. We are tacking processor scheduling problem to analyze the performance of the operator. The scheduling is considered as NP hard problem. The efficiency and performance of the proposed algorithm will be analyzed through the simulation based study.
Topics & Concepts
Operator (biology)Computer scienceSwap (finance)Scheduling (production processes)MutationGenetic algorithmMathematical optimizationPopulationAlgorithmMathematicsDemographyGeneChemistryTranscription factorFinanceBiochemistryEconomicsSociologyRepressorScheduling and Optimization AlgorithmsMetaheuristic Optimization Algorithms ResearchAdvanced Wireless Network Optimization