A linear optimization approach to the combined production planning model

Two fundamental processes usually arise in the production planning of many industries. The first one consists of deciding how many final products of each type have to be produced in each period of a planning horizon, the well-known lot sizing problem. The other process consists of cutting raw materials in stock in order to produce smaller parts used in the assembly of final products, the well-studied cutting stock problem. In this paper the decision variables of these two problems are dependent of each other in order to obtain a global optimum solution. Setups that are typically present in lot sizing problems are relaxed together with integer frequencies of cutting patterns in the cutting problem. Therefore, a large scale linear optimizations problem arises, which is exactly solved by a column generated technique. It is worth noting that this new combined problem still takes the trade-off between storage costs (for final products and the parts) and trim losses (in the cutting process). We present some sets of computational tests, analyzed over three different scenarios. These results show that, by combining the problems and using an exact method, it is possible to obtain significant gains when compared to the usual industrial practice, which solve them in sequence. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Analytical optimization of spread and change of exponential decay of generalized Wannier functions in one dimension

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Combining genetic algorithm and simulated annealing: A molecular geometry optimization study

We introduce a new hybrid approach to determine the ground state geometry of molecular systems. Firstly, we compared the ability of genetic algorithm (GA) and simulated annealing (SA) to find the lowest energy geometry of silicon clusters with six and 10 atoms. This comparison showed that GA exhibits fast initial convergence, but its performance deteriorates as it approaches the desired global extreme. Interestingly, SA showed a complementary convergence pattern, in addition to high accuracy. Our new procedure combines selected features from GA and SA to achieve weak dependence on initial parameters, parallel search strategy, fast convergence and high accuracy. This hybrid algorithm outperforms GA and SA by one order of magnitude for small silicon clusters (Si6 and Si10). Next, we applied the hybrid method to study the geometry of a 20-atom silicon cluster. It was able to find an original geometry, apparently lower in energy than those previously described in literature. In principle, our procedure can be applied successfully to any molecular system. © 1998 Elsevier Science B.V.

Global analysis of aerodynamics deflectors efficiency in the grinding process

The conventional, grinding methods in some cases are not very efficient because the arising of thermal damages in the pieces is very common. Optimization methods of cutting fluid application in the grinding zone are essential to prevent thermal problems from interaction of the wheel grains with the workpiece. surface. The optimization can happen through the correct selection of the cut parameters and development of devices that eliminate air layer effects generated around the grinding wheel. This article will collaborate with the development of an experimentation methodology which allows evaluating, comparatively, the performance of the deflectors in the cutting region to minimize the air layer effect of the high speed of the grinding wheel. The air layers make the cutting fluid jet to dissipate in the machine. An optimized nozzle was used in order to compare the results with the conventional method (without baffles or deflectors) of cutting fluid application. The results showed the high eficciency of the deflectors or baffles in the finish results. Copyright © 2006 by ABCM.

A new implementation of Population Based Incremental Learning method for optimization studies in electromagnetics

To enhance the global search ability of Population Based Incremental Learning (PBIL) methods, It Is proposed that multiple probability vectors are to be Included on available PBIL algorithms. As a result, the strategy for updating those probability vectors and the negative learning and mutation operators are redefined as reported. Numerical examples are reported to demonstrate the pros and cons of the newly Implemented algorithm. ©2006 IEEE.

A note on KKT-invexity in nonsmooth continuous-time optimization

We introduce the notion of KKT-inverity for nonsmooth continuous-time nonlinear optimization problems and prove that this notion is a necessary and sufficient condition for every KKT solution to be a global optimal solution.

Optimization of satellite constellations in the moon

Nowadays, we return to live a period of lunar exploration. China, Japan and India heavily invest in missions to the moon, and then try to implement manned bases on this satellite. These bases must be installed in polar regions due to the apparent existence of water. Therefore, the study of the feasibility of satellite constellations for navigation, control and communication recovers importance. The Moon's gravitational potential and resonant movements due to the proximity to Earth as the Kozai-Lidov resonance, must be considered in addition to other perturbations of lesser magnitude. The usual satellite constellations provide, as a basic feature, continuous and global coverage of the Earth. With this goal, they are designed for the smallest number of objects possible to perform a specific task and this amount is directly related to the altitude of the orbits and visual abilities of the members of the constellation. However the problem is different when the area to be covered is reduced to a given zone. The required number of space objects can be reduced. Furthermore, depending on the mission requirements it may be not necessary to provide continuous coverage. Taking into account the possibility of setting up a constellation that covers a specific region of the Moon on a non-continuous base, in this study we seek a criterion of optimization related to the time between visits. The propagation of the orbits of objects in the constellation in conjunction with the coverage constraints, provide information on the periods of time in which points of the surface are covered by a satellite, and time intervals in which they are not. So we minimize the time between visits considering several sets of possible constellations and using genetic algorithms.

Keratinase production by new strain of Bacillus Amyloliquefaciens: Application of statistical experimental design for optimization of keratinase production

Feathers are rich in amino acids and can be employed as a dietary protein supplement for animal feed. Microbial degradation is an alternative technology for improving the nutritional value of feathers. Other potential applications of keratinase include use in the leather industry, detergents and medicine as well as the pharmaceutical for the treatment of acne, psoriasis and calluses. A new keratinolytic enzyme production bacterium was isolated from a poultry processing plant. To improve keratinase yield, statistically based experimental designs were applied to optimize three significant variables: temperature, substrate concentration (feathers) and agitation speed. Response surface methodology demonstrated an increase in keratinolytic activity at temperature, agitation speed and substrate concentration of 26.6°C, 150 rpm and 2%, respectively. Liquid chromatography revealed the release of amino acids in the Bacillus amyloliquefaciens culture broth, thereby demonstrating the potential of feather meal in the animal feed industry. © Global Science Publications.

Um método previsor-corretor primal-dual de pontos interiores barreira logarítmica modificada, com estratégias de convergência global e de ajuste cúbico, para problemas de programação não-linear e não-convexa

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Interior-exterior point method with global convergence strategy for solving the reactive optimal power flow problem

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A self-learning simulated annealing algorithm for global optimizations of electromagnetic devices

A self-learning simulated annealing algorithm is developed by combining the characteristics of simulated annealing and domain elimination methods. The algorithm is validated by using a standard mathematical function and by optimizing the end region of a practical power transformer. The numerical results show that the CPU time required by the proposed method is about one third of that using conventional simulated annealing algorithm.

Programação por metas e análise envoltória de dados na avaliação de unidades de produção global: uma aplicação em uma empresa do segmento químico

Considering the high competitivity in the market, the application of quantitative methods can assist in analyzing the efficiency of production facilities of areas of export and import processes of the chemical industry sector. In this sense, this work aims to apply the model GPDEA-BCC optimization in order to develop an analysis of the production units of this chemical industry. So, were chosen variables relevant to the process and elaborated a final comparison between the results obtained by the optimization tool and performance indexes provided by the company. These results indicated that some production units should be monitored more carefully because some of them had a low efficiency when analyzed with multi criteria