CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: genetic modification.</title> <meta name="description" content="Search results for: genetic modification."> <meta name="keywords" content="genetic modification."> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="genetic modification." name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="genetic modification."> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 1050</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: genetic modification.</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1050</span> Modification of Rk Equation of State for Liquid and Vapor of Ammonia by Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Mousavian">S. Mousavian</a>, <a href="https://publications.waset.org/search?q=F.%20Mousavian"> F. Mousavian</a>, <a href="https://publications.waset.org/search?q=V.%20Nikkhah%20Rashidabad"> V. Nikkhah Rashidabad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Cubic equations of state like Redlich–Kwong (RK)  EOS have been proved to be very reliable tools in the prediction of  phase behavior. Despite their good performance in compositional  calculations, they usually suffer from weaknesses in the predictions  of saturated liquid density. In this research, RK equation was  modified. The result of this study show that modified equation has  good agreement with experimental data.</p> <p> </p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Equation%20of%20state" title="Equation of state">Equation of state</a>, <a href="https://publications.waset.org/search?q=modification" title=" modification"> modification</a>, <a href="https://publications.waset.org/search?q=ammonia" title=" ammonia"> ammonia</a>, <a href="https://publications.waset.org/search?q=genetic%20algorithm." title=" genetic algorithm."> genetic algorithm.</a> </p> <a href="https://publications.waset.org/9997021/modification-of-rk-equation-of-state-for-liquid-and-vapor-of-ammonia-by-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997021/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997021/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997021/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997021/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997021/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997021/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997021/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997021/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997021/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997021/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997021.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2774</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1049</span> Using Genetic Algorithm to Improve Information Retrieval Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ahmed%20A.%20A.%20Radwan">Ahmed A. A. Radwan</a>, <a href="https://publications.waset.org/search?q=Bahgat%20A.%20Abdel%20Latef"> Bahgat A. Abdel Latef</a>, <a href="https://publications.waset.org/search?q=Abdel%20Mgeid%20A.%20Ali"> Abdel Mgeid A. Ali</a>, <a href="https://publications.waset.org/search?q=Osman%20A.%20Sadek"> Osman A. Sadek</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study investigates the use of genetic algorithms in information retrieval. The method is shown to be applicable to three well-known documents collections, where more relevant documents are presented to users in the genetic modification. In this paper we present a new fitness function for approximate information retrieval which is very fast and very flexible, than cosine similarity fitness function. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cosine%20similarity" title="Cosine similarity">Cosine similarity</a>, <a href="https://publications.waset.org/search?q=Fitness%20function" title=" Fitness function"> Fitness function</a>, <a href="https://publications.waset.org/search?q=Genetic%0AAlgorithm" title=" Genetic Algorithm"> Genetic Algorithm</a>, <a href="https://publications.waset.org/search?q=Information%20Retrieval" title=" Information Retrieval"> Information Retrieval</a>, <a href="https://publications.waset.org/search?q=Query%20learning." title=" Query learning."> Query learning.</a> </p> <a href="https://publications.waset.org/8821/using-genetic-algorithm-to-improve-information-retrieval-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8821/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8821/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8821/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8821/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8821/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8821/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8821/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8821/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8821/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8821/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8821.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2756</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1048</span> A Genetic and Simulated Annealing Based Algorithms for Solving the Flow Assignment Problem in Computer Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tarek%20M.%20Mahmoud">Tarek M. Mahmoud </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Selecting the routes and the assignment of link flow in a computer communication networks are extremely complex combinatorial optimization problems. Metaheuristics, such as genetic or simulated annealing algorithms, are widely applicable heuristic optimization strategies that have shown encouraging results for a large number of difficult combinatorial optimization problems. This paper considers the route selection and hence the flow assignment problem. A genetic algorithm and simulated annealing algorithm are used to solve this problem. A new hybrid algorithm combining the genetic with the simulated annealing algorithm is introduced. A modification of the genetic algorithm is also introduced. Computational experiments with sample networks are reported. The results show that the proposed modified genetic algorithm is efficient in finding good solutions of the flow assignment problem compared with other techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20Algorithms" title="Genetic Algorithms">Genetic Algorithms</a>, <a href="https://publications.waset.org/search?q=Flow%20Assignment" title=" Flow Assignment"> Flow Assignment</a>, <a href="https://publications.waset.org/search?q=Routing" title=" Routing"> Routing</a>, <a href="https://publications.waset.org/search?q=Computer%20network" title="Computer network">Computer network</a>, <a href="https://publications.waset.org/search?q=Simulated%20Annealing." title=" Simulated Annealing."> Simulated Annealing.</a> </p> <a href="https://publications.waset.org/11820/a-genetic-and-simulated-annealing-based-algorithms-for-solving-the-flow-assignment-problem-in-computer-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11820/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11820/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11820/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11820/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11820/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11820/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11820/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11820/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11820/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11820/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11820.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2256</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1047</span> Gray Level Image Encryption </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Roza%20Afarin">Roza Afarin</a>, <a href="https://publications.waset.org/search?q=Saeed%20Mozaffari"> Saeed Mozaffari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The aim of this paper is image encryption using Genetic Algorithm (GA). The proposed encryption method consists of two phases. In modification phase, pixels locations are altered to reduce correlation among adjacent pixels. Then, pixels values are changed in the diffusion phase to encrypt the input image. Both phases are performed by GA with binary chromosomes. For modification phase, these binary patterns are generated by Local Binary Pattern (LBP) operator while for diffusion phase binary chromosomes are obtained by Bit Plane Slicing (BPS). Initial population in GA includes rows and columns of the input image. Instead of subjective selection of parents from this initial population, a random generator with predefined key is utilized. It is necessary to decrypt the coded image and reconstruct the initial input image. Fitness function is defined as average of transition from 0 to 1 in LBP image and histogram uniformity in modification and diffusion phases, respectively. Randomness of the encrypted image is measured by entropy, correlation coefficients and histogram analysis. Experimental results show that the proposed method is fast enough and can be used effectively for image encryption.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Correlation%20coefficients" title="Correlation coefficients">Correlation coefficients</a>, <a href="https://publications.waset.org/search?q=Genetic%20algorithm" title=" Genetic algorithm"> Genetic algorithm</a>, <a href="https://publications.waset.org/search?q=Image%20encryption" title=" Image encryption"> Image encryption</a>, <a href="https://publications.waset.org/search?q=Image%20entropy." title=" Image entropy."> Image entropy.</a> </p> <a href="https://publications.waset.org/9998460/gray-level-image-encryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998460/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998460/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998460/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998460/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998460/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998460/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998460/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998460/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998460/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998460/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998460.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2238</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1046</span> Application of Adaptive Genetic Algorithm in Function Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Panpan%20Xu">Panpan Xu</a>, <a href="https://publications.waset.org/search?q=Shulin%20Sui"> Shulin Sui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The crossover probability and mutation probability are the two important factors in genetic algorithm. The adaptive genetic algorithm can improve the convergence performance of genetic algorithm, in which the crossover probability and mutation probability are adaptively designed with the changes of fitness value. We apply adaptive genetic algorithm into a function optimization problem. The numerical experiment represents that adaptive genetic algorithm improves the convergence speed and avoids local convergence.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20algorithm" title="Genetic algorithm">Genetic algorithm</a>, <a href="https://publications.waset.org/search?q=Adaptive%20genetic%20algorithm" title=" Adaptive genetic algorithm"> Adaptive genetic algorithm</a>, <a href="https://publications.waset.org/search?q=Function%20optimization." title=" Function optimization."> Function optimization.</a> </p> <a href="https://publications.waset.org/10003327/application-of-adaptive-genetic-algorithm-in-function-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003327/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003327/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003327/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003327/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003327/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003327/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003327/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003327/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003327/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003327/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003327.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1724</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1045</span> Genetic Mining: Using Genetic Algorithm for Topic based on Concept Distribution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20M.%20Khalessizadeh">S. M. Khalessizadeh</a>, <a href="https://publications.waset.org/search?q=R.%20Zaefarian"> R. Zaefarian</a>, <a href="https://publications.waset.org/search?q=S.H.%20Nasseri"> S.H. Nasseri</a>, <a href="https://publications.waset.org/search?q=E.%20Ardil"> E. Ardil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, Genetic Algorithm has been used to solve wide range of optimization problems. Some researches conduct on applying Genetic Algorithm to text classification, summarization and information retrieval system in text mining process. This researches show a better performance due to the nature of Genetic Algorithm. In this paper a new algorithm for using Genetic Algorithm in concept weighting and topic identification, based on concept standard deviation will be explored. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20Algorithm" title="Genetic Algorithm">Genetic Algorithm</a>, <a href="https://publications.waset.org/search?q=Text%20Mining" title=" Text Mining"> Text Mining</a>, <a href="https://publications.waset.org/search?q=Term%20Weighting" title=" Term Weighting"> Term Weighting</a>, <a href="https://publications.waset.org/search?q=Concept%20Extraction" title="Concept Extraction">Concept Extraction</a>, <a href="https://publications.waset.org/search?q=Concept%20Distribution." title=" Concept Distribution."> Concept Distribution.</a> </p> <a href="https://publications.waset.org/10232/genetic-mining-using-genetic-algorithm-for-topic-based-on-concept-distribution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10232/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10232/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10232/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10232/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10232/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10232/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10232/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10232/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10232/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10232/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10232.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">3715</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1044</span> Fractal Dimension: An Index to Quantify Parameters in Genetic Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mahmoud%20R.%20Shaghaghian">Mahmoud R. Shaghaghian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genetic Algorithms (GAs) are direct searching methods which require little information from design space. This characteristic beside robustness of these algorithms makes them to be very popular in recent decades. On the other hand, while this method is employed, there is no guarantee to achieve optimum results. This obliged designer to run such algorithms more than one time to achieve more reliable results. There are many attempts to modify the algorithms to make them more efficient. In this paper, by application of fractal dimension (particularly, Box Counting Method), the complexity of design space are established for determination of mutation and crossover probabilities (Pm and Pc). This methodology is followed by a numerical example for more clarification. It is concluded that this modification will improve efficiency of GAs and make them to bring about more reliable results especially for design space with higher fractal dimensions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20Algorithm" title="Genetic Algorithm">Genetic Algorithm</a>, <a href="https://publications.waset.org/search?q=Fractal%20Dimension" title=" Fractal Dimension"> Fractal Dimension</a>, <a href="https://publications.waset.org/search?q=BoxCounting%20Method" title=" BoxCounting Method"> BoxCounting Method</a>, <a href="https://publications.waset.org/search?q=Weierstrass-Mandelbrot%20function." title=" Weierstrass-Mandelbrot function."> Weierstrass-Mandelbrot function.</a> </p> <a href="https://publications.waset.org/6312/fractal-dimension-an-index-to-quantify-parameters-in-genetic-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6312/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6312/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6312/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6312/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6312/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6312/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6312/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6312/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6312/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6312/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6312.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1467</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1043</span> Analog Circuit Design using Genetic Algorithm: Modified</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Amod%20P.%20Vaze">Amod P. Vaze</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Genetic Algorithm has been used to solve wide range of optimization problems. Some researches conduct on applying Genetic Algorithm to analog circuit design automation. These researches show a better performance due to the nature of Genetic Algorithm. In this paper a modified Genetic Algorithm is applied for analog circuit design automation. The modifications are made to the topology of the circuit. These modifications will lead to a more computationally efficient algorithm.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20algorithm" title="Genetic algorithm">Genetic algorithm</a>, <a href="https://publications.waset.org/search?q=analog%20circuits" title=" analog circuits"> analog circuits</a>, <a href="https://publications.waset.org/search?q=design." title=" design."> design.</a> </p> <a href="https://publications.waset.org/14807/analog-circuit-design-using-genetic-algorithm-modified" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14807/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14807/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14807/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14807/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14807/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14807/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14807/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14807/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14807/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14807/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14807.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2293</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1042</span> Selective Mutation for Genetic Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sung%20Hoon%20Jung">Sung Hoon Jung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a selective mutation method for improving the performances of genetic algorithms. In selective mutation, individuals are first ranked and then additionally mutated one bit in a part of their strings which is selected corresponding to their ranks. This selective mutation helps genetic algorithms to fast approach the global optimum and to quickly escape local optima. This results in increasing the performances of genetic algorithms. We measured the effects of selective mutation with four function optimization problems. It was found from extensive experiments that the selective mutation can significantly enhance the performances of genetic algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20algorithm" title="Genetic algorithm">Genetic algorithm</a>, <a href="https://publications.waset.org/search?q=selective%20mutation" title=" selective mutation"> selective mutation</a>, <a href="https://publications.waset.org/search?q=function%20optimization" title=" function optimization"> function optimization</a> </p> <a href="https://publications.waset.org/10404/selective-mutation-for-genetic-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10404/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10404/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10404/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10404/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10404/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10404/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10404/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10404/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10404/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10404/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10404.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1836</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1041</span> Restartings: A Technique to Improve Classic Genetic Algorithms Performance </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Grigorios%20N.%20Beligiannis">Grigorios N. Beligiannis</a>, <a href="https://publications.waset.org/search?q=Georgios%20A.%20Tsirogiannis"> Georgios A. Tsirogiannis</a>, <a href="https://publications.waset.org/search?q=Panayotis%20E.%20Pintelas"> Panayotis E. Pintelas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this contribution, a way to enhance the performance of the classic Genetic Algorithm is proposed. The idea of restarting a Genetic Algorithm is applied in order to obtain better knowledge of the solution space of the problem. A new operator of 'insertion' is introduced so as to exploit (utilize) the information that has already been collected before the restarting procedure. Finally, numerical experiments comparing the performance of the classic Genetic Algorithm and the Genetic Algorithm with restartings, for some well known test functions, are given.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20Algorithms" title="Genetic Algorithms">Genetic Algorithms</a>, <a href="https://publications.waset.org/search?q=Restartings" title=" Restartings"> Restartings</a>, <a href="https://publications.waset.org/search?q=Search%20space%20exploration" title=" Search space exploration"> Search space exploration</a>, <a href="https://publications.waset.org/search?q=Search%20space%20exploitation." title=" Search space exploitation."> Search space exploitation.</a> </p> <a href="https://publications.waset.org/12222/restartings-a-technique-to-improve-classic-genetic-algorithms-performance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12222/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12222/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12222/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12222/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12222/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12222/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12222/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12222/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12222/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12222/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12222.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2138</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1040</span> Initializing K-Means using Genetic Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Bashar%20Al-Shboul">Bashar Al-Shboul</a>, <a href="https://publications.waset.org/search?q=Sung-Hyon%20Myaeng"> Sung-Hyon Myaeng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> K-Means (KM) is considered one of the major algorithms widely used in clustering. However, it still has some problems, and one of them is in its initialization step where it is normally done randomly. Another problem for KM is that it converges to local minima. Genetic algorithms are one of the evolutionary algorithms inspired from nature and utilized in the field of clustering. In this paper, we propose two algorithms to solve the initialization problem, Genetic Algorithm Initializes KM (GAIK) and KM Initializes Genetic Algorithm (KIGA). To show the effectiveness and efficiency of our algorithms, a comparative study was done among GAIK, KIGA, Genetic-based Clustering Algorithm (GCA), and FCM [19]. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Clustering" title="Clustering">Clustering</a>, <a href="https://publications.waset.org/search?q=Genetic%20Algorithms" title=" Genetic Algorithms"> Genetic Algorithms</a>, <a href="https://publications.waset.org/search?q=K-means." title=" K-means."> K-means.</a> </p> <a href="https://publications.waset.org/12873/initializing-k-means-using-genetic-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12873/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12873/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12873/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12873/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12873/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12873/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12873/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12873/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12873/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12873/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12873.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2102</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1039</span> Solving the Quadratic Assignment Problems by a Genetic Algorithm with a New Replacement Strategy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yongzhong%20Wu">Yongzhong Wu</a>, <a href="https://publications.waset.org/search?q=Ping%20Ji"> Ping Ji</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a genetic algorithm based on a new replacement strategy to solve the quadratic assignment problems, which are NP-hard. The new replacement strategy aims to improve the performance of the genetic algorithm through well balancing the convergence of the searching process and the diversity of the population. In order to test the performance of the algorithm, the instances in QAPLIB, a quadratic assignment problem library, are tried and the results are compared with those reported in the literature. The performance of the genetic algorithm is promising. The significance is that this genetic algorithm is generic. It does not rely on problem-specific genetic operators, and may be easily applied to various types of combinatorial problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Quadratic%20assignment%20problem" title="Quadratic assignment problem">Quadratic assignment problem</a>, <a href="https://publications.waset.org/search?q=Genetic%20algorithm" title=" Genetic algorithm"> Genetic algorithm</a>, <a href="https://publications.waset.org/search?q=Replacement%20strategy" title=" Replacement strategy"> Replacement strategy</a>, <a href="https://publications.waset.org/search?q=QAPLIB." title=" QAPLIB."> QAPLIB.</a> </p> <a href="https://publications.waset.org/8342/solving-the-quadratic-assignment-problems-by-a-genetic-algorithm-with-a-new-replacement-strategy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8342/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8342/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8342/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8342/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8342/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8342/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8342/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8342/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8342/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8342/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8342.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2748</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1038</span> Application of Hybrid Genetic Algorithm Based on Simulated Annealing in Function Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Panpan%20Xu">Panpan Xu</a>, <a href="https://publications.waset.org/search?q=Shulin%20Sui"> Shulin Sui</a>, <a href="https://publications.waset.org/search?q=Zongjie%20Du"> Zongjie Du</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genetic algorithm is widely used in optimization problems for its excellent global search capabilities and highly parallel processing capabilities; but, it converges prematurely and has a poor local optimization capability in actual operation. Simulated annealing algorithm can avoid the search process falling into local optimum. A hybrid genetic algorithm based on simulated annealing is designed by combining the advantages of genetic algorithm and simulated annealing algorithm. The numerical experiment represents the hybrid genetic algorithm can be applied to solve the function optimization problems efficiently. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20algorithm" title="Genetic algorithm">Genetic algorithm</a>, <a href="https://publications.waset.org/search?q=Simulated%20annealing" title=" Simulated annealing"> Simulated annealing</a>, <a href="https://publications.waset.org/search?q=Hybrid%0D%0Agenetic%20algorithm" title=" Hybrid genetic algorithm"> Hybrid genetic algorithm</a>, <a href="https://publications.waset.org/search?q=Function%20optimization." title=" Function optimization."> Function optimization.</a> </p> <a href="https://publications.waset.org/10003238/application-of-hybrid-genetic-algorithm-based-on-simulated-annealing-in-function-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003238/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003238/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003238/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003238/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003238/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003238/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003238/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003238/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003238/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003238/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003238.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2550</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1037</span> A Genetic Algorithm Approach for Solving Fuzzy Linear and Quadratic Equations </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Hadi%20Mashinchi">M. Hadi Mashinchi</a>, <a href="https://publications.waset.org/search?q=M.%20Reza%20Mashinchi"> M. Reza Mashinchi</a>, <a href="https://publications.waset.org/search?q=Siti%20Mariyam%20H.%20J.%20Shamsuddin"> Siti Mariyam H. J. Shamsuddin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper a genetic algorithms approach for solving the linear and quadratic fuzzy equations Ãx虄=B虄 and Ãx虄<sup>2</sup> + B虄x虄=C虄 , where Ã, B虄, C虄 and x虄 are fuzzy numbers is proposed by genetic algorithms. Our genetic based method initially starts with a set of random fuzzy solutions. Then in each generation of genetic algorithms, the solution candidates converge more to better fuzzy solution x虄<sub>b</sub> . In this proposed method the final reached x虄<sub>b</sub> is not only restricted to fuzzy triangular and it can be fuzzy number.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fuzzy%20coefficient" title="Fuzzy coefficient">Fuzzy coefficient</a>, <a href="https://publications.waset.org/search?q=fuzzy%20equation" title=" fuzzy equation"> fuzzy equation</a>, <a href="https://publications.waset.org/search?q=genetic%0D%0Aalgorithms." title=" genetic algorithms."> genetic algorithms.</a> </p> <a href="https://publications.waset.org/11254/a-genetic-algorithm-approach-for-solving-fuzzy-linear-and-quadratic-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11254/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11254/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11254/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11254/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11254/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11254/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11254/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11254/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11254/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11254/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11254.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2189</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1036</span> A New Algorithm to Stereo Correspondence Using Rank Transform and Morphology Based On Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Razagh%20Hafezi">Razagh Hafezi</a>, <a href="https://publications.waset.org/search?q=Ahmad%20Keshavarz"> Ahmad Keshavarz</a>, <a href="https://publications.waset.org/search?q=Vida%20Moshfegh"> Vida Moshfegh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a novel algorithm of stereo correspondence with rank transform. In this algorithm we used the genetic algorithm to achieve the accurate disparity map. Genetic algorithms are efficient search methods based on principles of population genetic, i.e. mating, chromosome crossover, gene mutation, and natural selection. Finally morphology is employed to remove the errors and discontinuities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/search?q=morphology" title=" morphology"> morphology</a>, <a href="https://publications.waset.org/search?q=rank%20transform" title=" rank transform"> rank transform</a>, <a href="https://publications.waset.org/search?q=stereo%20correspondence" title=" stereo correspondence"> stereo correspondence</a> </p> <a href="https://publications.waset.org/2671/a-new-algorithm-to-stereo-correspondence-using-rank-transform-and-morphology-based-on-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2671/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2671/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2671/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2671/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2671/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2671/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2671/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2671/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2671/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2671/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2671.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2173</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1035</span> Statistical Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammad%20Ali%20Tabarzad">Mohammad Ali Tabarzad</a>, <a href="https://publications.waset.org/search?q=Caro%20Lucas"> Caro Lucas</a>, <a href="https://publications.waset.org/search?q=Ali%20Hamzeh"> Ali Hamzeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Adaptive Genetic Algorithms extend the Standard Gas to use dynamic procedures to apply evolutionary operators such as crossover, mutation and selection. In this paper, we try to propose a new adaptive genetic algorithm, which is based on the statistical information of the population as a guideline to tune its crossover, selection and mutation operators. This algorithms is called Statistical Genetic Algorithm and is compared with traditional GA in some benchmark problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20Algorithms" title="Genetic Algorithms">Genetic Algorithms</a>, <a href="https://publications.waset.org/search?q=Statistical%20Information%20ofthe%20Population" title=" Statistical Information ofthe Population"> Statistical Information ofthe Population</a>, <a href="https://publications.waset.org/search?q=PAUX" title=" PAUX"> PAUX</a>, <a href="https://publications.waset.org/search?q=SSO." title=" SSO."> SSO.</a> </p> <a href="https://publications.waset.org/3717/statistical-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3717/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3717/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3717/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3717/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3717/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3717/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3717/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3717/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3717/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3717/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3717.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1754</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1034</span> An Innovative Fuzzy Decision Making Based Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20A.%20Sharbafi">M. A. Sharbafi</a>, <a href="https://publications.waset.org/search?q=M.%20Shakiba%20Herfeh"> M. Shakiba Herfeh</a>, <a href="https://publications.waset.org/search?q=Caro%20Lucas"> Caro Lucas</a>, <a href="https://publications.waset.org/search?q=A.%20Mohammadi%20Nejad"> A. Mohammadi Nejad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Several researchers have proposed methods about combination of Genetic Algorithm (GA) and Fuzzy Logic (the use of GA to obtain fuzzy rules and application of fuzzy logic in optimization of GA). In this paper, we suggest a new method in which fuzzy decision making is used to improve the performance of genetic algorithm. In the suggested method, we determine the alleles that enhance the fitness of chromosomes and try to insert them to the next generation. In this algorithm we try to present an innovative vaccination in the process of reproduction in genetic algorithm, with considering the trade off between exploration and exploitation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20Algorithm" title="Genetic Algorithm">Genetic Algorithm</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20Decision%20Making." title=" Fuzzy Decision Making."> Fuzzy Decision Making.</a> </p> <a href="https://publications.waset.org/14568/an-innovative-fuzzy-decision-making-based-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14568/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14568/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14568/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14568/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14568/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14568/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14568/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14568/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14568/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14568/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14568.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1608</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1033</span> Fuzzy-Genetic Optimal Control for Four Degreeof Freedom Robotic Arm Movement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=V.%20K.%20Banga">V. K. Banga</a>, <a href="https://publications.waset.org/search?q=R.%20Kumar"> R. Kumar</a>, <a href="https://publications.waset.org/search?q=Y.%20Singh"> Y. Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present optimal control for movement and trajectory planning for four degrees-of-freedom robot using Fuzzy Logic (FL) and Genetic Algorithms (GAs). We have evaluated using Fuzzy Logic (FL) and Genetic Algorithms (GAs) for four degree-of-freedom (4 DOF) robotics arm, Uncertainties like; Movement, Friction and Settling Time in robotic arm movement have been compensated using Fuzzy logic and Genetic Algorithms. The development of a fuzzy genetic optimization algorithm is presented and discussed. The result are compared only GA and Fuzzy GA. This paper describes genetic algorithms, which is designed to optimize robot movement and trajectory. Though the model represents is a general model for redundant structures and could represent any n-link structures. The result is a complete trajectory planning with Fuzzy logic and Genetic algorithms demonstrating the flexibility of this technique of artificial intelligence. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Inverse%20kinematics" title="Inverse kinematics">Inverse kinematics</a>, <a href="https://publications.waset.org/search?q=Genetic%20algorithms%20%28GAs%29" title=" Genetic algorithms (GAs)"> Genetic algorithms (GAs)</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20logic%20%28FL%29" title="Fuzzy logic (FL)">Fuzzy logic (FL)</a>, <a href="https://publications.waset.org/search?q=Trajectory%20planning." title=" Trajectory planning."> Trajectory planning.</a> </p> <a href="https://publications.waset.org/2713/fuzzy-genetic-optimal-control-for-four-degreeof-freedom-robotic-arm-movement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2713/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2713/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2713/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2713/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2713/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2713/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2713/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2713/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2713/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2713/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2713.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2294</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1032</span> Genetic Algorithms with Oracle for the Traveling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Robin%20Gremlich">Robin Gremlich</a>, <a href="https://publications.waset.org/search?q=Andreas%20Hamfelt"> Andreas Hamfelt</a>, <a href="https://publications.waset.org/search?q=H%C3%A9ctor%20de%20Pereda"> H茅ctor de Pereda</a>, <a href="https://publications.waset.org/search?q=Vladislav%20Valkovsky"> Vladislav Valkovsky</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>By introducing the concept of Oracle we propose an approach for improving the performance of genetic algorithms for large-scale asymmetric Traveling Salesman Problems. The results have shown that the proposed approach allows overcoming some traditional problems for creating efficient genetic algorithms.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20algorithms" title="Genetic algorithms">Genetic algorithms</a>, <a href="https://publications.waset.org/search?q=Traveling%20Salesman%20Problem" title=" Traveling Salesman Problem"> Traveling Salesman Problem</a>, <a href="https://publications.waset.org/search?q=optimal%20decision%20distribution" title=" optimal decision distribution"> optimal decision distribution</a>, <a href="https://publications.waset.org/search?q=oracle." title=" oracle."> oracle.</a> </p> <a href="https://publications.waset.org/4895/genetic-algorithms-with-oracle-for-the-traveling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4895/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4895/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4895/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4895/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4895/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4895/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4895/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4895/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4895/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4895/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4895.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1724</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1031</span> Applications of Genetic Programming in Data Mining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Saleh%20Mesbah%20Elkaffas">Saleh Mesbah Elkaffas</a>, <a href="https://publications.waset.org/search?q=Ahmed%20A.%20Toony"> Ahmed A. Toony</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper details the application of a genetic programming framework for induction of useful classification rules from a database of income statements, balance sheets, and cash flow statements for North American public companies. Potentially interesting classification rules are discovered. Anomalies in the discovery process merit further investigation of the application of genetic programming to the dataset for the problem domain. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20programming" title="Genetic programming">Genetic programming</a>, <a href="https://publications.waset.org/search?q=data%20mining%20classification%0Arule." title=" data mining classification rule."> data mining classification rule.</a> </p> <a href="https://publications.waset.org/2372/applications-of-genetic-programming-in-data-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2372/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2372/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2372/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2372/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2372/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2372/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2372/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2372/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2372/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2372/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2372.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1545</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1030</span> Fast and Accurate Reservoir Modeling: Genetic Algorithm versus DIRECT Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohsen%20Ebrahimi">Mohsen Ebrahimi</a>, <a href="https://publications.waset.org/search?q=Milad%20M.%20Rabieh"> Milad M. Rabieh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, two very different optimization algorithms, Genetic and DIRECT algorithms, are used to history match a bottomhole pressure response for a reservoir with wellbore storage and skin with the best possible analytical model. No initial guesses are available for reservoir parameters. The results show that the matching process is much faster and more accurate for DIRECT method in comparison with Genetic algorithm. It is furthermore concluded that the DIRECT algorithm does not need any initial guesses, whereas Genetic algorithm needs to be tuned according to initial guesses. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=DIRECT%20algorithm" title="DIRECT algorithm">DIRECT algorithm</a>, <a href="https://publications.waset.org/search?q=Genetic%20algorithm" title=" Genetic algorithm"> Genetic algorithm</a>, <a href="https://publications.waset.org/search?q=Analytical%0Amodeling" title=" Analytical modeling"> Analytical modeling</a>, <a href="https://publications.waset.org/search?q=History%20match" title=" History match"> History match</a> </p> <a href="https://publications.waset.org/2594/fast-and-accurate-reservoir-modeling-genetic-algorithm-versus-direct-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2594/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2594/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2594/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2594/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2594/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2594/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2594/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2594/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2594/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2594/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2594.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1756</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1029</span> Using Morphological and Microsatellite (SSR) Markers to Assess the Genetic Diversity in Alfalfa (Medicago sativa L.)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=T.%20Cholastova">T. Cholastova</a>, <a href="https://publications.waset.org/search?q=D.%20Knotova"> D. Knotova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Utilization of diverse germplasm is needed to enhance the genetic diversity of cultivars. The objective of this study was to evaluate the genetic relationships of 98 alfalfa germplasm accessions using morphological traits and SSR markers. From the 98 tested populations, 81 were locals originating in Europe, 17 were introduced from USA, Australia, New Zealand and Canada. Three primers generated 67 polymorphic bands. The average polymorphic information content (PIC) was very high (> 0.90) over all three used primer combinations. Cluster analysis using Unweighted Pair Group Method with Arithmetic Means (UPGMA) and Jaccard麓s coefficient grouped the accessions into 2 major clusters with 4 sub-clusters with no correlation between genetic and morphological diversity. The SSR analysis clearly indicated that even with three polymorphic primers, reliable estimation of genetic diversity could be obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=genetic%20diversity" title="genetic diversity">genetic diversity</a>, <a href="https://publications.waset.org/search?q=Medicago%20sativa%20L." title=" Medicago sativa L."> Medicago sativa L.</a>, <a href="https://publications.waset.org/search?q=morphological%0D%0Atraits" title=" morphological traits"> morphological traits</a>, <a href="https://publications.waset.org/search?q=SSR%20markers" title=" SSR markers"> SSR markers</a> </p> <a href="https://publications.waset.org/10558/using-morphological-and-microsatellite-ssr-markers-to-assess-the-genetic-diversity-in-alfalfa-medicago-sativa-l" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10558/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10558/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10558/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10558/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10558/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10558/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10558/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10558/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10558/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10558/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10558.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">3101</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1028</span> Genetic Characterization of Barley Genotypes via Inter-Simple Sequence Repeat</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mustafa%20Yorganc%C4%B1lar">Mustafa Yorganc谋lar</a>, <a href="https://publications.waset.org/search?q=Emine%20Atalay"> Emine Atalay</a>, <a href="https://publications.waset.org/search?q=Necdet%20Akg%C3%BCn"> Necdet Akg眉n</a>, <a href="https://publications.waset.org/search?q=Ali%20Topal"> Ali Topal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this study, polymerase chain reaction based Inter-simple sequence repeat (ISSR) from DNA fingerprinting techniques were used to investigate the genetic relationships among barley crossbreed genotypes in Turkey. It is important that selection based on the genetic base in breeding programs via ISSR, in terms of breeding time. 14 ISSR primers generated a total of 97 bands, of which 81 (83.35%) were polymorphic. The highest total resolution power (RP) value was obtained from the F2 (0.53) and M16 (0.51) primers. According to the ISSR result, the genetic similarity index changed between 0.64–095; Lane 3 with Line 6 genotypes were the closest, while Line 36 were the most distant ones. The ISSR markers were found to be promising for assessing genetic diversity in barley crossbreed genotypes.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Barley" title="Barley">Barley</a>, <a href="https://publications.waset.org/search?q=crossbreed" title=" crossbreed"> crossbreed</a>, <a href="https://publications.waset.org/search?q=genetic%20similarity" title=" genetic similarity"> genetic similarity</a>, <a href="https://publications.waset.org/search?q=ISSR." title=" ISSR. "> ISSR. </a> </p> <a href="https://publications.waset.org/10007373/genetic-characterization-of-barley-genotypes-via-inter-simple-sequence-repeat" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007373/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007373/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007373/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007373/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007373/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007373/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007373/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007373/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007373/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007373/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007373.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">919</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1027</span> Factors Determining Intention to Pursue Genetic Testing for People in Taiwan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ju-Chun%20Chien">Ju-Chun Chien</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The Ottawa Charter for Health Promotion proposed that the role of health services should shift the focus from cure to prevention. Nowadays, besides having physical examinations, people could also conduct genetic tests to provide important information for diagnosing, treating, and/or preventing illnesses. However, because of the incompletion of the Chinese Genetic Database, people in Taiwan were still unfamiliar with genetic testing. The purposes of the present study were to: (1) Figure out people’s attitudes towards genetic testing. (2) Examine factors that influence people’s intention to pursue genetic testing by means of the Health Belief Model (HBM). A pilot study was conducted on 249 Taiwanese in 2017 to test the feasibility of the self-developed instrument. The reliability and construct validity of scores on the self-developed questionnaire revealed that this HBM-based questionnaire with 40 items was a well-developed instrument. A total of 542 participants were recruited and the valid participants were 535 (99%) between the ages of 20 and 86. Descriptive statistics, one-way ANOVA, two-way contingency table analysis, Pearson’s correlation, and stepwise multiple regression analysis were used in this study. The main results were that only 32 participants (6%) had already undergone genetic testing; moreover, their attitude towards genetic testing was more positive than those who did not have the experience. Compared with people who never underwent genetic tests, those who had gone for genetic testing had higher self-efficacy, greater intention to pursue genetic testing, had academic majors in health-related fields, had chronic and genetic diseases, possessed Catastrophic Illness Cards, and all of them had heard about genetic testing. The variables that best predicted people’s intention to pursue genetic testing were cues to action, self-efficacy, and perceived benefits (the three variables all correlated with one another positively at high magnitudes). To sum up, the HBM could be effective in designing and identifying the needs and priorities of the target population to pursue genetic testing.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20testing" title="Genetic testing">Genetic testing</a>, <a href="https://publications.waset.org/search?q=intention%20to%20pursue%20genetic%20testing" title=" intention to pursue genetic testing"> intention to pursue genetic testing</a>, <a href="https://publications.waset.org/search?q=Taiwan" title=" Taiwan"> Taiwan</a>, <a href="https://publications.waset.org/search?q=health%20belief%20model." title=" health belief model. "> health belief model. </a> </p> <a href="https://publications.waset.org/10009662/factors-determining-intention-to-pursue-genetic-testing-for-people-in-taiwan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10009662/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10009662/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10009662/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10009662/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10009662/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10009662/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10009662/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10009662/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10009662/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10009662/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10009662.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">701</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1026</span> A New Heuristic for Improving the Performance of Genetic Algorithm </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Warattapop%20Chainate">Warattapop Chainate</a>, <a href="https://publications.waset.org/search?q=Peeraya%20Thapatsuwan"> Peeraya Thapatsuwan</a>, <a href="https://publications.waset.org/search?q=Pupong%20Pongcharoen">Pupong Pongcharoen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The hybridisation of genetic algorithm with heuristics has been shown to be one of an effective way to improve its performance. In this work, genetic algorithm hybridised with four heuristics including a new heuristic called neighbourhood improvement were investigated through the classical travelling salesman problem. The experimental results showed that the proposed heuristic outperformed other heuristics both in terms of quality of the results obtained and the computational time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20Algorithm" title="Genetic Algorithm">Genetic Algorithm</a>, <a href="https://publications.waset.org/search?q=Hybridisation" title=" Hybridisation"> Hybridisation</a>, <a href="https://publications.waset.org/search?q=Metaheuristics" title=" Metaheuristics"> Metaheuristics</a>, <a href="https://publications.waset.org/search?q=Travelling%20Salesman%20Problem." title="Travelling Salesman Problem.">Travelling Salesman Problem.</a> </p> <a href="https://publications.waset.org/14842/a-new-heuristic-for-improving-the-performance-of-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14842/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14842/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14842/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14842/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14842/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14842/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14842/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14842/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14842/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14842/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14842.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1849</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1025</span> Development of Heterogeneous Parallel Genetic Simulated Annealing Using Multi-Niche Crowding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Z.%20G.%20Wang">Z. G. Wang</a>, <a href="https://publications.waset.org/search?q=M.%20Rahman"> M. Rahman</a>, <a href="https://publications.waset.org/search?q=Y.%20S.%20Wong"> Y. S. Wong</a>, <a href="https://publications.waset.org/search?q=K.%20S.%20Neo"> K. S. Neo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from local optima. The concept of hierarchical parallel GA is employed to parallelize GSA for the optimization of multimodal functions. In addition, multi-niche crowding is used to maintain the diversity in the population of the parallel GSA (PGSA). The performance of the proposed algorithms is evaluated against a standard set of multimodal benchmark functions. The multi-niche crowding PGSA and normal PGSA show some remarkable improvement in comparison with the conventional parallel genetic algorithm and the breeder genetic algorithm (BGA). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Crowding" title="Crowding">Crowding</a>, <a href="https://publications.waset.org/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/search?q=parallel%20geneticalgorithm" title=" parallel geneticalgorithm"> parallel geneticalgorithm</a>, <a href="https://publications.waset.org/search?q=simulated%20annealing." title=" simulated annealing."> simulated annealing.</a> </p> <a href="https://publications.waset.org/5118/development-of-heterogeneous-parallel-genetic-simulated-annealing-using-multi-niche-crowding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5118/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5118/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5118/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5118/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5118/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5118/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5118/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5118/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5118/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5118/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5118.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1587</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1024</span> Spread Spectrum Code Estimation by Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=V.%20R.%20Asghari">V. R. Asghari</a>, <a href="https://publications.waset.org/search?q=M.%20Ardebilipour"> M. Ardebilipour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the context of spectrum surveillance, a method to recover the code of spread spectrum signal is presented, whereas the receiver has no knowledge of the transmitter-s spreading sequence. The approach is based on a genetic algorithm (GA), which is forced to model the received signal. Genetic algorithms (GAs) are well known for their robustness in solving complex optimization problems. Experimental results show that the method provides a good estimation, even when the signal power is below the noise power. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Code%20estimation" title="Code estimation">Code estimation</a>, <a href="https://publications.waset.org/search?q=genetic%20algorithms" title=" genetic algorithms"> genetic algorithms</a>, <a href="https://publications.waset.org/search?q=spread%0Aspectrum." title=" spread spectrum."> spread spectrum.</a> </p> <a href="https://publications.waset.org/15117/spread-spectrum-code-estimation-by-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15117/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15117/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15117/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15117/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15117/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15117/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15117/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15117/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15117/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15117/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15117.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1571</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1023</span> Genetic-Fuzzy Inverse Controller for a Robot Arm Suitable for On Line Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abduladheem%20A.%20Ali">Abduladheem A. Ali</a>, <a href="https://publications.waset.org/search?q=Easa%20A.%20Abd"> Easa A. Abd</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The robot is a repeated task plant. The control of such a plant under parameter variations and load disturbances is one of the important problems. The aim of this work is to design Geno-Fuzzy controller suitable for online applications to control single link rigid robot arm plant. The genetic-fuzzy online controller (indirect controller) has two genetic-fuzzy blocks, the first as controller, the second as identifier. The identification method is based on inverse identification technique. The proposed controller it tested in normal and load disturbance conditions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fuzzy%20network" title="Fuzzy network">Fuzzy network</a>, <a href="https://publications.waset.org/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/search?q=robot%20control" title=" robot control"> robot control</a>, <a href="https://publications.waset.org/search?q=online%20genetic%20control" title=" online genetic control"> online genetic control</a>, <a href="https://publications.waset.org/search?q=parameter%20identification." title=" parameter identification."> parameter identification.</a> </p> <a href="https://publications.waset.org/9063/genetic-fuzzy-inverse-controller-for-a-robot-arm-suitable-for-on-line-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9063/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9063/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9063/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9063/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9063/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9063/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9063/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9063/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9063/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9063/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9063.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1459</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1022</span> A Dynamic Hybrid Option Pricing Model by Genetic Algorithm and Black- Scholes Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yi-Chang%20Chen">Yi-Chang Chen</a>, <a href="https://publications.waset.org/search?q=Shan-Lin%20Chang"> Shan-Lin Chang</a>, <a href="https://publications.waset.org/search?q=Chia-Chun%20Wu"> Chia-Chun Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Unlike this study focused extensively on trading behavior of option market, those researches were just taken their attention to model-driven option pricing. For example, Black-Scholes (B-S) model is one of the most famous option pricing models. However, the arguments of B-S model are previously mentioned by some pricing models reviewing. This paper following suggests the importance of the dynamic character for option pricing, which is also the reason why using the genetic algorithm (GA). Because of its natural selection and species evolution, this study proposed a hybrid model, the Genetic-BS model which combining GA and B-S to estimate the price more accurate. As for the final experiments, the result shows that the output estimated price with lower MAE value than the calculated price by either B-S model or its enhanced one, Gram-Charlier garch (G-C garch) model. Finally, this work would conclude that the Genetic-BS pricing model is exactly practical. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/search?q=Genetic-BS" title=" Genetic-BS"> Genetic-BS</a>, <a href="https://publications.waset.org/search?q=option%20pricing%20model." title=" option pricing model."> option pricing model.</a> </p> <a href="https://publications.waset.org/1530/a-dynamic-hybrid-option-pricing-model-by-genetic-algorithm-and-black-scholes-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1530/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1530/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1530/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1530/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1530/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1530/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1530/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1530/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1530/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1530/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1530.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2245</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1021</span> Simulation of Robotic Arm using Genetic Algorithm and AHP </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=V.%20K.%20Banga">V. K. Banga</a>, <a href="https://publications.waset.org/search?q=Y.%20Singh"> Y. Singh</a>, <a href="https://publications.waset.org/search?q=R.%20Kumar"> R. Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have proposed a low cost optimized solution for the movement of a three-arm manipulator using Genetic Algorithm (GA) and Analytical Hierarchy Process (AHP). A scheme is given for optimizing the movement of robotic arm with the help of Genetic Algorithm so that the minimum energy consumption criteria can be achieved. As compared to Direct Kinematics, Inverse Kinematics evolved two solutions out of which the best-fit solution is selected with the help of Genetic Algorithm and is kept in search space for future use. The Inverse Kinematics, Fitness Value evaluation and Binary Encoding like tasks are simulated and tested. Although, three factors viz. Movement, Friction and Least Settling Time (or Min. Vibration) are used for finding the Fitness Function / Fitness Values, however some more factors can also be considered. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Inverse%20Kinematics" title="Inverse Kinematics">Inverse Kinematics</a>, <a href="https://publications.waset.org/search?q=Genetic%20Algorithm%20%28GA%29" title=" Genetic Algorithm (GA)"> Genetic Algorithm (GA)</a>, <a href="https://publications.waset.org/search?q=Analytical%20Hierarchy%20Process%20%28AHP%29" title="Analytical Hierarchy Process (AHP)">Analytical Hierarchy Process (AHP)</a>, <a href="https://publications.waset.org/search?q=Fitness%20Value" title=" Fitness Value"> Fitness Value</a>, <a href="https://publications.waset.org/search?q=Fitness%20Function." title=" Fitness Function."> Fitness Function.</a> </p> <a href="https://publications.waset.org/5038/simulation-of-robotic-arm-using-genetic-algorithm-and-ahp" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5038/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5038/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5038/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5038/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5038/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5038/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5038/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5038/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5038/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5038/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5038.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2964</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=34">34</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=35">35</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=genetic%20modification.&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>