نتایج جستجو برای: hybrid genetic algorithm hga

تعداد نتایج: 1462620  

2007
Leyuan Shi Sigurdur Olafsson

We develop a new optimization algorithm that combines the genetic algorithm and a recently proposed global optimization algorithm called the nested partitions method. The resulting hybrid algorithm retains the global perspective of the nested partitions method and the local search capabilities of the genetic algorithm. We also present a detailed application of the new algorithm to a NP-hard pro...

2009
E. Nabil A. Badr I. Farag Emad Nabil Amr Badr Ibrahim Farag

The construction of artificial systems by drawing inspiration from natural systems is not a new idea. The Artificial Neural Network (ANN) and Genetic Algorithms (GAs) are good examples of successful applications of the biological metaphor to the solution of computational problems. The study of artificial immune systems is a relatively new field that tries to exploit the mechanisms of the natura...

In this paper, a new hybrid methodology is introduced to design a cost-sensitive fuzzy rule-based classification system. A novel cost metric is proposed based on the combination of three different concepts: Entropy, Gini index and DKM criterion. In order to calculate the effective cost of patterns, a hybrid of fuzzy c-means clustering and particle swarm optimization algorithm is utilized. This ...

Esmaeil Mehdizadeh Fariborz Jolai Masoud Jenabi Mohammad Aliabadi

Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...

Imperialist competitive algorithm (ICA) is a new socio-politically motivated global search strategy. The ICA is applied to hybrid composite laminates to obtain minimum weight and cost. The approach which is chosen for conducting the multi-objective optimization was the weighted sum method (WSM). The hybrid composite Laminates are made of glass/epoxy and carbon/epoxy to combine the lightness and...

Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

Journal: :The Biochemical journal 2005
Edwin J A Veldhuizen Frédéric H Vaillancourt Cheryl J Whiting Marvin M-Y Hsiao Geneviève Gingras Yufang Xiao Robert M Tanguay John Boukouvalas Lindsay D Eltis

HGO (homogentisate 1,2-dioxygenase; EC 1.13.11.5) catalyses the O2-dependent cleavage of HGA (homogentisate) to maleylacetoacetate in the catabolism of tyrosine. Anaerobic purification of heterologously expressed Fe(II)-containing human HGO yielded an enzyme preparation with a specific activity of 28.3+/- 0.6 micromol x min(-1) x mg(-1) (20 mM Mes, 80 mM NaCl, pH 6.2, 25 degrees C), which is al...

Journal: :journal of optimization in industrial engineering 2012
esmaeil mehdizadeh fariborz afrabandpei

logistic network design is one of the most important strategic decisions in supply chain management that has recently attracted the attention of many researchers. transportation network design is then one of the most important fields of logistic network. this study is concerned with designing a multi-stage and multi-product logistic network. at first, a mixed integer nonlinear programming model...

Journal: :journal of advances in computer research 0

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید