Disentangling the Core–periphery Structure in Marine Reserve Networks Based on a Genetic Algorithm

2020 ◽  
Vol 108 (sp1) ◽  
Author(s):  
Jiannan Yu
2008 ◽  
Vol 1 (1) ◽  
pp. 44-51 ◽  
Author(s):  
Carissa Joy Klein ◽  
Charles Steinback ◽  
Astrid J. Scholz ◽  
Hugh P. Possingham

2014 ◽  
Vol 10 (1) ◽  
pp. 111
Author(s):  
Rahman Erama ◽  
Retantyo Wardoyo

AbstrakModifikasi Algoritma Genetika pada penelitian ini dilakukan berdasarkan temuan-temuan para peneliti sebelumnya tentang kelemahan Algoritma Genetika. Temuan-temuan yang dimakasud terkait proses crossover sebagai salah satu tahapan terpenting dalam Algoritma Genetika dinilai tidak menjamin solusi yang lebih baik oleh beberapa peneliti. Berdasarkan temuan-temuan oleh beberapa peneliti sebelumnya, maka penelitian ini akan mencoba memodifikasi Algoritma Genetika dengan mengeliminasi proses crossover yang menjadi inti permasalahan dari beberapa peneliti tersebut. Eliminasi proses crossover ini diharapkan melahirkan algoritma yang lebih efektif sebagai alternative untuk penyelesaian permasalahan khususnya penjadwalan pelajaran sekolah.Tujuan dari penelitian ini adalah Memodifikasi Algoritma Genetika menjadi algoritma alternatif untuk menyelesaikan permasalahan penjadwalan sekolah, sehingga diharapkan terciptanya algoritma alternatif ini bisa menjadi tambahan referensi bagi para peneliti untuk menyelesaikan permasalahan penjadwalan lainnya.Algoritma hasil modifikasi yang mengeliminasi tahapan crossover pada algoritma genetika ini mampu memberikan performa 3,06% lebih baik dibandingkan algoritma genetika sederhana dalam menyelesaikan permasalahan penjadwalan sekolah. Kata kunci—algoritma genetika, penjadwalan sekolah, eliminasi crossover  AbstractModified Genetic Algorithm in this study was based on the findings of previous researchers about the weakness of Genetic Algorithms. crossover as one of the most important stages in the Genetic Algorithms considered not guarantee a better solution by several researchers. Based on the findings by previous researchers, this research will try to modify the genetic algorithm by eliminating crossover2 which is the core problem of several researchers. Elimination crossover is expected to create a more effective algorithm as an alternative to the settlement issue in particular scheduling school.This study is intended to modify the genetic algorithm into an algorithm that is more effective as an alternative to solve the problems of school scheduling. So expect the creation of this alternative algorithm could be an additional resource for researchers to solve other scheduling problems.Modified algorithm that eliminates the crossover phase of the genetic algorithm is able to provide 2,30% better performance than standard genetic algorithm in solving scheduling problems school. Keywords—Genetic Algorithm, timetabling school, eliminate crossover


2010 ◽  
Vol 107 (43) ◽  
pp. 18286-18293 ◽  
Author(s):  
S. D. Gaines ◽  
C. White ◽  
M. H. Carr ◽  
S. R. Palumbi

Coral Reefs ◽  
2009 ◽  
Vol 28 (2) ◽  
pp. 339-351 ◽  
Author(s):  
G. R. Almany ◽  
S. R. Connolly ◽  
D. D. Heath ◽  
J. D. Hogan ◽  
G. P. Jones ◽  
...  

2011 ◽  
Vol 63 (4) ◽  
pp. 429-442 ◽  
Author(s):  
William D. Heyman ◽  
Dawn J. Wright

2001 ◽  
Vol 2 (3) ◽  
pp. 10-17 ◽  
Author(s):  
Callum M. Roberts ◽  
Benjamin Halpern ◽  
Stephen R. Palumbi ◽  
Robert R. Warner

2007 ◽  
Vol 201 (1) ◽  
pp. 82-88 ◽  
Author(s):  
L.D. Wagner ◽  
J.V. Ross ◽  
H.P. Possingham

Information ◽  
2019 ◽  
Vol 10 (12) ◽  
pp. 392
Author(s):  
Zhenglong Xiang ◽  
Hongrun Wu ◽  
Fei Yu

The test oracle problem exists widely in modern complex software testing, and metamorphic testing (MT) has become a promising testing technique to alleviate this problem. The inference of efficient metamorphic relations (MRs) is the core problem of metamorphic testing. Studies have proven that the combination of simple metamorphic relations can construct more efficient metamorphic relations. In most previous studies, metamorphic relations have been mainly manually inferred by experts with professional knowledge, which is an inefficient technique and hinders the application. In this paper, a genetic algorithm-based approach is proposed to construct composite metamorphic relations automatically for the program to be tested. We use a set of relation sequences to represent a particular class of MRs and turn the problem of inferring composite MRs into a problem of searching for suitable sequences. We then dynamically implement multiple executions of the program and use a genetic algorithm to search for the optimal set of relation sequences. We conducted empirical studies to evaluate our approach using scientific functions in the GNU scientific library (abbreviated as GSL). From the empirical results, our approach can automatically infer high-quality composite MRs, on average, five times more than basic MRs. More importantly, the inferred composite MRs can increase the fault detection capabilities by at least 30 % more than the original metamorphic relations.


Sign in / Sign up

Export Citation Format

Share Document