142 resultados para Complex combinatorial problem
Resumo:
Real-time viscosity measurement remains a necessity for highly automated industry. To resolve this problem, many studies have been carried out using an ultrasonic shear wave reflectance method. This method is based on the determination of the complex reflection coefficient`s magnitude and phase at the solid-liquid interface. Although magnitude is a stable quantity and its measurement is relatively simple and precise, phase measurement is a difficult task because of strong temperature dependence. A simplified method that uses only the magnitude of the reflection coefficient and that is valid under the Newtonian regimen has been proposed by some authors, but the obtained viscosity values do not match conventional viscometry measurements. In this work, a mode conversion measurement cell was used to measure glycerin viscosity as a function of temperature (15 to 25 degrees C) and corn syrup-water mixtures as a function of concentration (70 to 100 wt% of corn syrup). Tests were carried out at 1 MHz. A novel signal processing technique that calculates the reflection coefficient magnitude in a frequency band, instead of a single frequency, was studied. The effects of the bandwidth on magnitude and viscosity were analyzed and the results were compared with the values predicted by the Newtonian liquid model. The frequency band technique improved the magnitude results. The obtained viscosity values came close to those measured by the rotational viscometer with percentage errors up to 14%, whereas errors up to 96% were found for the single frequency method.
Resumo:
This work presents the implementation of the ultrasonic shear reflectance method for viscosity measurement of Newtonian liquids using wave mode conversion from longitudinal to shear waves and vice versa. The method is based on the measurement of the complex reflection coefficient (magnitude and phase) at a solid-liquid interface. The implemented measurement cell is composed of an ultrasonic transducer, a water buffer, an aluminum prism, a PMMA buffer rod, and a sample chamber. Viscosity measurements were made in the range from 1 to 3.5 MHz for olive oil and for automotive oils (SAE 40, 90, and 250) at 15 and 22.5 degrees C, respectively. Moreover, olive oil and corn oil measurements were conducted in the range from 15 to 30 degrees C at 3.5 and 2.25 MHz, respectively. The ultrasonic measurements, in the case of the less viscous liquids, agree with the results provided by a rotational viscometer, showing Newtonian behavior. In the case of the more viscous liquids, a significant difference was obtained, showing a clear non-Newtonian behavior that cannot be described by the Kelvin-Voigt model.
Resumo:
Systems of distributed artificial intelligence can be powerful tools in a wide variety of practical applications. Its most surprising characteristic, the emergent behavior, is also the most answerable for the difficulty in. projecting these systems. This work proposes a tool capable to beget individual strategies for the elements of a multi-agent system and thereof providing to the group means on obtaining wanted results, working in a coordinated and cooperative manner as well. As an application example, a problem was taken as a basis where a predators` group must catch a prey in a three-dimensional continuous ambient. A synthesis of system strategies was implemented of which internal mechanism involves the integration between simulators by Particle Swarm Optimization algorithm (PSO), a Swarm Intelligence technique. The system had been tested in several simulation settings and it was capable to synthesize automatically successful hunting strategies, substantiating that the developed tool can provide, as long as it works with well-elaborated patterns, satisfactory solutions for problems of complex nature, of difficult resolution starting from analytical approaches. (c) 2007 Elsevier Ltd. All rights reserved.
Resumo:
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs only at the beginning of periodic intervals. A customized approximate dynamic programming method is introduced for this problem. The authors also present numerical experiments that assess the reliability of the new approach and show that it performs better than a myopic policy.
Resumo:
In this paper, we consider a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries that occurs in a major Brazilian retail group. A single depot attends 519 stores of the group distributed in 11 Brazilian states. To find good solutions to this problem, we propose heuristics as initial solutions and a scatter search (SS) approach. Next, the produced solutions are compared with the routes actually covered by the company. Our results show that the total distribution cost can be reduced significantly when such methods are used. Experimental testing with benchmark instances is used to assess the merit of our proposed procedure. (C) 2008 Published by Elsevier B.V.
Resumo:
In this paper, we devise a separation principle for the finite horizon quadratic optimal control problem of continuous-time Markovian jump linear systems driven by a Wiener process and with partial observations. We assume that the output variable and the jump parameters are available to the controller. It is desired to design a dynamic Markovian jump controller such that the closed loop system minimizes the quadratic functional cost of the system over a finite horizon period of time. As in the case with no jumps, we show that an optimal controller can be obtained from two coupled Riccati differential equations, one associated to the optimal control problem when the state variable is available, and the other one associated to the optimal filtering problem. This is a separation principle for the finite horizon quadratic optimal control problem for continuous-time Markovian jump linear systems. For the case in which the matrices are all time-invariant we analyze the asymptotic behavior of the solution of the derived interconnected Riccati differential equations to the solution of the associated set of coupled algebraic Riccati equations as well as the mean square stabilizing property of this limiting solution. When there is only one mode of operation our results coincide with the traditional ones for the LQG control of continuous-time linear systems.
Resumo:
We consider in this paper the optimal stationary dynamic linear filtering problem for continuous-time linear systems subject to Markovian jumps in the parameters (LSMJP) and additive noise (Wiener process). It is assumed that only an output of the system is available and therefore the values of the jump parameter are not accessible. It is a well known fact that in this setting the optimal nonlinear filter is infinite dimensional, which makes the linear filtering a natural numerically, treatable choice. The goal is to design a dynamic linear filter such that the closed loop system is mean square stable and minimizes the stationary expected value of the mean square estimation error. It is shown that an explicit analytical solution to this optimal filtering problem is obtained from the stationary solution associated to a certain Riccati equation. It is also shown that the problem can be formulated using a linear matrix inequalities (LMI) approach, which can be extended to consider convex polytopic uncertainties on the parameters of the possible modes of operation of the system and on the transition rate matrix of the Markov process. As far as the authors are aware of this is the first time that this stationary filtering problem (exact and robust versions) for LSMJP with no knowledge of the Markov jump parameters is considered in the literature. Finally, we illustrate the results with an example.
Resumo:
This work considers the open-loop control problem of steering a two-level quantum system from any initial to any final condition. The model of this system evolves on the state space X = SU(2), having two inputs that correspond to the complex amplitude of a resonant laser field. A symmetry preserving flat output is constructed using a fully geometric construction and quaternion computations. Simulation results of this flatness-based open-loop control are provided.
Resumo:
Hub-and-spoke networks are widely studied in the area of location theory. They arise in several contexts, including passenger airlines, postal and parcel delivery, and computer and telecommunication networks. Hub location problems usually involve three simultaneous decisions to be made: the optimal number of hub nodes, their locations and the allocation of the non-hub nodes to the hubs. In the uncapacitated single allocation hub location problem (USAHLP) hub nodes have no capacity constraints and non-hub nodes must be assigned to only one hub. In this paper, we propose three variants of a simple and efficient multi-start tabu search heuristic as well as a two-stage integrated tabu search heuristic to solve this problem. With multi-start heuristics, several different initial solutions are constructed and then improved by tabu search, while in the two-stage integrated heuristic tabu search is applied to improve both the locational and allocational part of the problem. Computational experiments using typical benchmark problems (Civil Aeronautics Board (CAB) and Australian Post (AP) data sets) as well as new and modified instances show that our approaches consistently return the optimal or best-known results in very short CPU times, thus allowing the possibility of efficiently solving larger instances of the USAHLP than those found in the literature. We also report the integer optimal solutions for all 80 CAB data set instances and the 12 AP instances up to 100 nodes, as well as for the corresponding new generated AP instances with reduced fixed costs. Published by Elsevier Ltd.
Model for facilities or vendors location in a global scale considering several echelons in the Chain
Resumo:
The facilities location problem for companies with global operations is very complex and not well explored in the literature. This work proposes a MILP model that solves the problem through minimization of the total logistic cost. Main contributions of the model are the pioneer carrying cost calculation, the treatment given to the take-or-pay costs and to the international tax benefits such as drawback and added value taxes in Brazil. The model was successfully applied to a real case of a chemical industry with industrial plants and sales all over the world. The model application recommended a totally new sourcing model for the company.
Resumo:
We report here the observation, for the first time, of the enhancement of Europium-Tetracycline complex emission in cholesterol solutions. This enhancement was initially observed with the addition of the enzyme cholesterol oxidase, which produces H2O2, the agent driver of the Europium tetracycline complex, to the solution. However, it was found that the enzyme is not needed to enhance the luminescence. A calibration curve was determined, resulting in a simple method to measure the cholesterol quantity in a solution. This method shows that the complex can be used as a sensor to determine cholesterol in biological systems.
Resumo:
This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.
Resumo:
The present study was carried out on six different ore types from the Salitre Alkaline Complex aiming to determine their mineralogical composition and the major features that are relevant in the mineral processing. The P(2)O(5) grades vary from 9 to 25%. The slime content (-0, 020 mm) varies between 20 and 34% (w/w) and carries 17-22% of the P(2)O(5) content. The samples essentially consist of apatite, iron oxi-hydroxides, ilmenite, clay minerals, carbonate, quartz, pyroxene, perovskite, secondary phosphates and other minor accessory minerals. Below 0.21 mm, apatite essentially occurs in free particles showing a clean surface or a weak coating of it-on oxi-hydroxides; the highly covered apatite (not recoverable by flotation) varies from 6 to 9%. In the deslimed fraction (above 0.020 mm) more than 97% of the total phosphor content occurs as apatite; the estimated P 2 0 5 potential recovery in flotation concentration is over 90% (71-76% overall recovery).
Resumo:
The propolis has potential to be a natural food additive However its application is limited because It is alcohol-soluble and has strong flavour Microencapsulation may be an alternative for reducing these problems The aim of this study was to encapsulate propolis extract by complex coacervation using isolated soy protein and pectin as encapsulant agents The coacervation was studied as a function of pH (5 0 4 5 4 0 and 3 5) and the concentration of encapsulants and core (2 5 and 5 0 g/100 mL) Samples obtained at pH 4 0 in both concentrations were lyophilized and analyzed for hygroscopicity encapsulation efficiency particle size morphology thermal behavior stability of phenolic and flavonoids during storage as well as antioxidant and antimicrobial activities It was possible to encapsulate propolis extract by complex coacervation and to obtain it in the form of powder alcohol-free stable with antioxidant property antimicrobial activity against Staphylococcus aureus and with the possibility of controlled release in foods (C) 2010 Elsevier Ltd All rights reserved
Resumo:
P>The Arabidopsis thylakoid FtsH protease complex is composed of FtsH1/FtsH5 (type A) and FtsH2/FtsH8 (type B) subunits. Type A and type B subunits display a high degree of sequence identity throughout their mature domains, but no similarity in their amino-terminal targeting peptide regions. In chloroplast import assays, FtsH2 and FtsH5 were imported and subsequently integrated into thylakoids by a two-step processing mechanism that resulted in an amino-proximal lumenal domain, a single transmembrane anchor, and a carboxyl proximal stromal domain. FtsH2 integration into washed thylakoids was entirely dependent on the proton gradient, whereas FtsH5 integration was dependent on NTPs, suggesting their integration by Tat and Sec pathways, respectively. This finding was corroborated by in organello competition and by antibody inhibition experiments. A series of constructs were made in order to understand the molecular basis for different integration pathways. The amino proximal domains through the transmembrane anchors were sufficient for proper integration as demonstrated with carboxyl-truncated versions of FtsH2 and FtsH5. The mature FtsH2 protein was found to be incompatible with the Sec machinery as determined with targeting peptide-swapping experiments. Incompatibility does not appear to be determined by any specific element in the FtsH2 domain as no single domain was incompatible with Sec transport. This suggests an incompatible structure that requires the intact FtsH2. That the highly homologous type A and type B subunits of the same multimeric complex use different integration pathways is a striking example of the notion that membrane insertion pathways have evolved to accommodate structural features of their respective substrates.