126 resultados para genetic algorithm (GA)


Relevância:

80.00% 80.00%

Publicador:

Resumo:

This work aimed to compare the predictive capacity of empirical models, based on the uniform design utilization combined to artificial neural networks with respect to classical factorial designs in bioprocess, using as example the rabies virus replication in BHK-21 cells. The viral infection process parameters under study were temperature (34°C, 37°C), multiplicity of infection (0.04, 0.07, 0.1), times of infection, and harvest (24, 48, 72 hours) and the monitored output parameter was viral production. A multilevel factorial experimental design was performed for the study of this system. Fractions of this experimental approach (18, 24, 30, 36 and 42 runs), defined according uniform designs, were used as alternative for modelling through artificial neural network and thereafter an output variable optimization was carried out by means of genetic algorithm methodology. Model prediction capacities for all uniform design approaches under study were better than that found for classical factorial design approach. It was demonstrated that uniform design in combination with artificial neural network could be an efficient experimental approach for modelling complex bioprocess like viral production. For the present study case, 67% of experimental resources were saved when compared to a classical factorial design approach. In the near future, this strategy could replace the established factorial designs used in the bioprocess development activities performed within biopharmaceutical organizations because of the improvements gained in the economics of experimentation that do not sacrifice the quality of decisions.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this paper, a method is proposed to refine the LASER 3D roofs geometrically by using a high-resolution aerial image and Markov Random Field (MRF) models. In order to do so, a MRF description for grouping straight lines is developed, assuming that each projected side contour and ridge is topologically correct and that it is only necessary to improve its accuracy. Although the combination of laser data with data from image is most justified for refining roof contour, the structure of ridges can give greater robustness in the topological description of the roof structure. The MRF model is formulated based on relationships (length, proximity, and orientation) between the straight lines extracted from the image and projected polygon and also on retangularity and corner injunctions. The energy function associated with MRF is minimized by the genetic algorithm optimization method, resulting in the grouping of straight lines for each roof object. Finally, each grouping of straight lines is topologically reconstructed based on the topology of the corresponding LASER scanning polygon projected onto the image-space. The results obtained were satisfactory. This method was able to provide polygons roof refined buildings in which most of its contour sides and ridges were geometrically improved.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Pós-graduação em Engenharia Mecânica - FEG

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Pós-graduação em Engenharia Elétrica - FEB

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This paper presents a mathematical model adapted from literature for the crop rotation problem with demand constraints (CRP-D). The main aim of the present work is to study metaheuristics and their performance in a real context. The proposed algorithms for solution of the CRP-D are a genetic algorithm, a simulated annealing and hybrid approaches: a genetic algorithm with simulated annealing and a genetic algorithm with local search algorithm. A new constructive heuristic was also developed to provide initial solutions for the metaheuristics. Computational experiments were performed using a real planting area and semi-randomly generated instances created by varying the number, positions and dimensions of the lots. The computational results showed that these algorithms determined good feasible solutions in a short computing time as compared with the time spent to get optimal solutions, thus proving their efficacy for dealing with this practical application of the CRP-D.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Pós-graduação em Ciência da Computação - IBILCE