scholarly journals Expansion: A Novel Mutation Operator for Genetic Programming

Author(s):  
Mohiul Islam ◽  
Nawwaf Kharma ◽  
Peter Grogono
2009 ◽  
Vol 05 (02) ◽  
pp. 487-496 ◽  
Author(s):  
WEI FANG ◽  
JUN SUN ◽  
WENBO XU

Mutation operator is one of the mechanisms of evolutionary algorithms (EAs) and it can provide diversity in the search and help to explore the undiscovered search place. Quantum-behaved particle swarm optimization (QPSO), which is inspired by fundamental theory of PSO algorithm and quantum mechanics, is a novel stochastic searching technique and it may encounter local minima problem when solving multi-modal problems just as that in PSO. A novel mutation mechanism is proposed in this paper to enhance the global search ability of QPSO and a set of different mutation operators is introduced and implemented on the QPSO. Experiments are conducted on several well-known benchmark functions. Experimental results show that QPSO with some of the mutation operators is proven to be statistically significant better than the original QPSO.


2009 ◽  
Vol 197 (2) ◽  
pp. 830-833 ◽  
Author(s):  
Li-Ning Xing ◽  
Ying-Wu Chen ◽  
Ke-Wei Yang

2014 ◽  
Vol 989-994 ◽  
pp. 2491-2494
Author(s):  
Jian Cao ◽  
Gang Li ◽  
Cen Rui Ma

We study the strong stability of linear forms of pairwise negatively quadrant dependent (NQD) identically distributed random variables sequence under some suitable conditions. To overcome the weakness of collaborative services ability in different grid portal, a new grid portal architecture based on CSGPA (Collaborative Services Grid Portal Architecture), is proposed. This paper aims to enhance the performance of PSO in complex optimization problems and proposes an improved PSO variant by incorporating a novel mutation operator. The results obtained extend and improve the corresponding theorem for independent identically distributed random variables sequence.


2015 ◽  
Vol 78 ◽  
pp. 251-257 ◽  
Author(s):  
Kh. Mortezazadeh ◽  
A. Norouzi ◽  
A. Zolfaghari ◽  
M. Aghaie

2022 ◽  
Vol 31 (1) ◽  
pp. 1-52
Author(s):  
Man Zhang ◽  
Andrea Arcuri

REST web services are widely popular in industry, and search techniques have been successfully used to automatically generate system-level test cases for those systems. In this article, we propose a novel mutation operator which is designed specifically for test generation at system-level, with a particular focus on REST APIs. In REST API testing, and often in system testing in general, an individual can have a long and complex chromosome. Furthermore, there are two specific issues: (1) fitness evaluation in system testing is highly costly compared with the number of objectives (e.g., testing targets) to optimize for; and (2) a large part of the genotype might have no impact on the phenotype of the individuals (e.g., input data that has no impact on the execution flow in the tested program). Due to these issues, it might be not suitable to apply a typical low mutation rate like 1/ n (where n is the number of genes in an individual), which would lead to mutating only one gene on average. Therefore, in this article, we propose an adaptive weight-based hypermutation, which is aware of the different characteristics of the mutated genes. We developed adaptive strategies that enable the selection and mutation of genes adaptively based on their fitness impact and mutation history throughout the search. To assess our novel proposed mutation operator, we implemented it in the EvoMaster tool, integrated in the MIO algorithm, and further conducted an empirical study with three artificial REST APIs and four real-world REST APIs. Results show that our novel mutation operator demonstrates noticeable improvements over the default MIO. It provides a significant improvement in performance for six out of the seven case studies, where the relative improvement is up to +12.09% for target coverage, +12.69% for line coverage, and +32.51% for branch coverage.


2016 ◽  
Author(s):  
Ahmad B Hassanat ◽  
Esra’a Alkafaween ◽  
Nedal A Alnawaiseh ◽  
Mohammad A Abbadi ◽  
Mouhammd Alkasassbeh ◽  
...  

Mutation is one of the most important stages of the genetic algorithm because of its impact on the exploration of global optima, and to overcome premature convergence. There are many types of mutation, and the problem lies in selection of the appropriate type, where the decision becomes more difficult and needs more trial and error. This paper investigates the use of more than one mutation operator to enhance the performance of genetic algorithms. Novel mutation operators are proposed, in addition to two selection strategies for the mutation operators, one of which is based on selecting the best mutation operator and the other randomly selects any operator. Several experiments on some Travelling Salesman Problems (TSP) were conducted to evaluate the proposed methods, and these were compared to the well-known exchange mutation and rearrangement mutation. The results show the importance of some of the proposed methods, in addition to the significant enhancement of the genetic algorithm’s performance, particularly when using more than one mutation operator.


Sign in / Sign up

Export Citation Format

Share Document