Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Gene Level Concurrency in Genetic Algorithms
Date
2007-01-01
Author
Şehitoğlu, Onur Tolga
Üçoluk, Göktürk
Metadata
Show full item record
Item Usage Stats
161
views
0
downloads
Cite This
This study describes an alternative concurrency approach in genetic algorithms. Inspiring from implicit parallelism in a physical chromosome, a vertical concurrency is introduced. Proposed gene process model allows genetic algorithms work in encodings independent from the gene position ordering in a chromosome. This feature is used to implement a gene reordering version of genetic algorithm. Further possible models of flexible gene position encodings are discussed.
Subject Keywords
Genetic algorithm
,
Gene process
,
Gene position
,
Gene vector
,
Genetic operator
URI
https://hdl.handle.net/11511/71377
Relation
Computer and Information Sciences ISCIS 2003 LNCS
Collections
Department of Computer Engineering, Book / Book chapter
Suggestions
OpenMETU
Core
Gene level concurrency in genetic algorithms
Şehitoğlu, Onur Tolga; Üçoluk, Göktürk (2003-01-01)
This study describes an alternative concurrency approach in genetic algorithms. Inspiring from implicit parallelism in a physical chromosome, a vertical concurrency is introduced. Proposed gene process model allows genetic algorithms work in encodings independent from the gene position ordering in a chromosome. This feature is used to implement a gene reordering version of genetic algorithm. Further possible models of flexible gene position encodings are discussed.
Gene reordering and concurrency in genetic algorithms
Şehitoğlu, Onur Tolga; Üçoluk, Göktürk; Department of Computer Engineering (2002)
This study first introduces an order-free chromosome encoding to enhance the performance of genetic algorithms by learning the linkage of building blocks in non-binary encodings. The method introduces a measure called affinity which is based on the statistical properties of gene valuations in the population. It uses the affinity values of the local and global gene pairs to construct a global permutation with tight building block positioning. Method is tested and experimental results are shown for a group of...
Mathematical Modeling and Approximation of Gene Expression Patterns
Yılmaz, Fatih; Öktem, Hüseyin Avni (2004-09-03)
This study concerns modeling, approximation and inference of gene regulatory dynamics on the basis of gene expression patterns. The dynamical behavior of gene expressions is represented by a system of ordinary differential equations. We introduce a gene-interaction matrix with some nonlinear entries, in particular, quadratic polynomials of the expression levels to keep the system solvable. The model parameters are determined by using optimization. Then, we provide the time-discrete approximation of our time...
Solving the Forward Kinematics of the 3RPR Planar Parallel Manipulator using a Hybrid Meta-Heuristic Paradigm
Chandra, Rohitash; Zhang, Mengjie; Rolland, Luc (2009-12-18)
The forward kinematic of the 3-RPR parallel manipulator is solved using a hybrid meta-heuristic technique where the simulated annealing algorithm replaces the mutation operator in a genetic algorithm. The results from the hybrid meta-heuristic approach is compared with the standard simulated annealing and genetic algorithm. The results show that the simulated annealing algorithm outperforms genetic algorithm in terms of computation time and overall accuracy of the solution. The hybrid meta-heuristic search ...
Localization and identification of structural nonlinearities using cascaded optimization and neural networks
Koyuncu, A.; Ciğeroğlu, Ender; Özgüven, Hasan Nevzat (Elsevier BV, 2017-10-01)
In this study, a new approach is proposed for identification of structural nonlinearities by employing cascaded optimization and neural networks. Linear finite element model of the system and frequency response functions measured at arbitrary locations of the system are used in this approach. Using the finite element model, a training data set is created, which appropriately spans the possible nonlinear configurations space of the system. A classification neural network trained on these data sets then local...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. T. Şehitoğlu and G. Üçoluk,
Gene Level Concurrency in Genetic Algorithms
. 2007, p. 983.