For this problem we describe a simple but effective extension of a genetic algorithm (GA) based on chromosome permutation and a splitting procedure. For large instances it is obvious to use the original GA as benchmark. These approaches are applied on test instances for the considered problem ...
Association of Computer Communication Education for National Triumph (ACCENT)International Journal of Advanced Computer ResearchPal, B.B., Chakraborti, D., Biswas, P.: A Genetic Algorithm Based Goal Programming Approach to Interval-Valued Multilevel Programming Problems. In: 2nd International Conference...
genetic algorithmThis paper presents a genetic algorithm based procedure for automatic identification of crack profiles. In the procedure geometric modeling technique is applied to incorporate crack(s) into the structure under evaluation and a geometric model is generated. The geometric model is then ...
In order to deal with the poor prediction precision problem of material parameter identification for rockfill materials,a procedure based on genetic algorithm is proposed.Duncan-Chang nonlinear constitutive model is adopted to characterize the behavior of the modeled rockfill materials.An analytical solution...
Genetic algorithm is a global search technique, modeled after the process of natural selection, which can be used to find near optimal solutions to highly non-linear optimization problems. It has become one of the most widely used techniques for solving a number of hydrology and water resources ...
Evolutionary techniques [5] avoid the area overhead of predesigned spares and can repair the circuit at the granularity of individual logic blocks, yet lack a guarantee that a recovery would be obtained within a bounded time period. They may require hundreds of genetic algorithm (GA) iterations ...
aA genetic algorithm is an iterative procedure which borrows the ideas of natural selection and survival of the fittest from natural evolution 一种基因算法是从自然演变借用自然选择和适者生存想法的一个重申做法[translate]
Secondly, the Dubins paths have been integrated in the algorithm, allowing to simplify the previous 3-step process presented in [9] into a single-step process, thus, making the generation of the approach procedure more robust. More details regarding the several algorithms have also been added, ...
a set of allocation options, i.e. chromosomes, constitutes a generation, of which generally the best ones are selected for reproduction to form a new generation of chromosomes. The new generation is formed from the selected chromosomes using a genetic algorithm, via selection, crossbreeding and/or...
6. Procedure as defined in claim 1, characterised in that the chromosomes to be altered are selected on the basis of their fitness function values. 7. Procedure as defined in claim 1, characterised in that the chromosomes are altered by means of a genetic algorithm via selection, hybridisation...