Results 191 to 200 of about 12,025 (251)
Some of the next articles are maybe not open access.
hGRGA: A scalable genetic algorithm using homologous gene schema replacement
Swarm and Evolutionary Computation, 2017Abstract In this article, we propose a new evolutionary algorithm, referred as h omologous G ene R eplacement G enetic A lgorithm (hGRGA) that includes a novel and generic operator called h omologous G ene R eplacement (hGR). The hGR operator improves the chromosomes in gene level to promote their overall functionality.
Tamjidul Hoque, Sumaiya Iqbal
openaire +2 more sources
The Performance Analysis of Genetic Algorithm Based on Schema
2012In this paper, for a new genetic algorithm (GA) based on schema (BS-GA), we mainly analyze the performance of BS-GA through simulation. Through two examples, we verify the effectiveness of our algorithm. All the results indicate that, BS-GA is better than standard genetic algorithm (SGA) obviously in computation efficiency and convergence performance.
Jie Yang, Chenxia Jin, Fachao Li
openaire +2 more sources
New Codification Schemas for Scheduling with Genetic Algorithms
2005Codification 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.
David Serrano +2 more
openaire +1 more source
A modified genetic algorithm based on the best schema and its application for function optimization
Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393), 2002 The genetic algorithm (GA) is a wildly employed evolutional algorithm in the field of combinatorial optimization. Criticism of this approach includes slow speed and premature result during the convergence procedure. Through introducing new crossover and mutation operators based on the best scheme, the paper proposes a more efficient method to improve ...
Zi Gang, Peng Chu-wu, Zou Mingzhu
openalex +3 more sources
Mathematical analysis of schema survival for genetic algorithms having dual mutation
Soft Computing, 2017Genetic algorithms are widely used in the field of optimization. Schema theory forms the foundational basis for the success of genetic algorithms. Traditional genetic algorithms involve only a single mutation phase per iteration of the algorithm. In this paper, a novel concept of genetic algorithms involving two mutation steps per iteration is proposed.
Apoorva Mishra, Anupam Shukla
openaire +2 more sources
BSP‐GA: A new Genetic Algorithm for System Optimization and Excellent Schema Selection
Systems Research and Behavioral Science, 2014The significance of Internet‐of‐Things to Supply Chain Management has been dramatically increasing. The performance of supply chain based on Internet‐of‐Things is largely dependent on its optimization. Genetic algorithms (GAs) are important intelligent methods for complex system optimization problems, but they have some internal drawbacks such as ...
Marzana Wilamowska-Korsak +5 more
openaire +2 more sources
The circular schema theorem for genetic algorithms and two-point crossover
Second International Conference on Genetic Algorithms in Engineering Systems, 1997The schema theorem is the classical formulation of the search strategy performed by genetic algorithms (adaptation procedures mimicking biological evolution and molecular genetics). The original schema theorem has been derived for single-point crossover assuming that the individual chromosomes are arranged as strings.
openaire +2 more sources
Genetic algorithm with modified reproduction strategy based on self-organizing map and usable schema
International Congress Series, 2006Abstract In this paper, we propose a new updating method considering usability of each element of inputs and apply it to the reproduction of the GA to achieve more effective search than the traditional reproduction. In the proposed updating method, the order of updating elements is decided by averaging the corresponding elements multiplied by fitness
Ryosuke Kubota +2 more
openaire +2 more sources
An exact schema theorem for adaptive genetic algorithm and its application to machine cell formation
Expert Systems with Applications, 2011This paper proposes an exact schema theorem that is able to predict the expected number of copies of schemas in the next GA generation. It focuses on two-point crossover, which is widely used in many GA applications. As two important GA control parameters, crossover probability (p"c) and mutation probability (p"m) affect the performance of GAs ...
Xiao Feng Yin, Li Pheng Khoo
openaire +2 more sources
International Journal of Mobile Human Computer Interaction, 2014
The recent advances in the mobile environment, such as multi-touch gestures paradigm, introduce new challenges for the interaction designers in producing the best-suited final prototype. Moreover, the short delivery-time pressure of the current mobile market makes it harder to perform the detailed evaluations for selecting the best prototype amongst ...
Ragaad AlTarawneh, Shah Rukh Humayoun
openaire +2 more sources
The recent advances in the mobile environment, such as multi-touch gestures paradigm, introduce new challenges for the interaction designers in producing the best-suited final prototype. Moreover, the short delivery-time pressure of the current mobile market makes it harder to perform the detailed evaluations for selecting the best prototype amongst ...
Ragaad AlTarawneh, Shah Rukh Humayoun
openaire +2 more sources