Results 91 to 100 of about 40,532 (179)

New Codification Schemas for Scheduling with Genetic Algorithms

open access: closed, 2005
Codification is a very important issue when a Genetic Algorithm is designed to dealing with a combinatorial problem. In this paper we introduce new codification schemas for the Job Shop Scheduling problem which are extensions of two schemas of common use, and are worked out from the concept of underlying probabilistic model.
Ramiro Varela   +2 more
openalex   +2 more sources

Problem-Independent Schema Synthesis for Genetic Algorithms

open access: closed, 2003
As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves the performance of genetic algorithms. In this paper, we propose a static reordering method independent of problem-specific knowledge.
Yong-Hyuk Kim   +2 more
openalex   +2 more sources

Schema theorem of real-coded nonlinear genetic algorithm

open access: closedProceedings. International Conference on Machine Learning and Cybernetics, 2003
Through the mechanism analysis of simple genetic algorithm (SGA), every genetic operator can be considered as a linear function. So some disadvantages of SGA may be solved if the genetic operators are modified to a nonlinear function. According to the above method, a nonlinear genetic algorithm is introduced.
Zhihua Cui, Jianchao Zeng
openalex   +2 more sources

Parallel Genetic Algorithms with Schema Migration

open access: closedProceedings 26th Annual International Computer Software and Applications, 2003
Genetic algorithms (GAs) are efficient non-gradient stochastic search methods. Parallel GAs are proposed to overcome the deficiencies of sequential GAs, such as low speed and aptness to locally converge. However the tremendous communication cost incurred offsets the advantages of parallel GAs.
Guan Yu
  +4 more sources

Home - About - Disclaimer - Privacy