952 resultados para Facsimile transmission
Resumo:
An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.
Resumo:
The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.
Resumo:
An optimisation technique to solve transmission network expansion planning problem, using the AC model, is presented. This is a very complex mixed integer nonlinear programming problem. A constructive heuristic algorithm aimed at obtaining an excellent quality solution for this problem is presented. An interior point method is employed to solve nonlinear programming problems during the solution steps of the algorithm. Results of the tests, carried out with three electrical energy systems, show the capabilities of the method and also the viability of using the AC model to solve the problem.
Resumo:
The influence of temperature upon the effects of crotoxin (CTX)? from Crotalus durissus terrificus venom, and gamma-irradiated (Co-60, 2000 Gy) crotoxin (iCTX) was studied in rat neuromuscular transmission 'in vitro'. Indirect twitches were evoked in the phrenic-diaphragm preparation by supramaximal strength pulses with a duration of 0.5 ms and frequency of 0.5 Hz. The phospholipase A(2) (PLA(2)) enzymatic activity of CTX and iCTX was assayed against phosphadityl choline in Triton X-100. At 27 degrees C, CTX (14 mu g/ml) did not affect the amplitude of indirectly evoked twitches. However, at 37 degrees C, CTX induced a time-dependent blockade of the neuromuscular transmission that started at 90 min and was completed within 240 min, iCTX (14 mu g/ml) was inneffective on the neuromuscular transmission either at 27 or 37 degrees C. The PLA(2) enzymatic activity of CTX at 37 degrees C was 84 and that at 27 degrees C was 27 mu mol fatty acid released/min/mg protein, and that of the iCTX at 37 degrees C was 39 mu mol fatty acid released/min/mg protein. Thus, it was concluded that the mechanism of detoxification of CTX by gamma radiation at the neuromuscular level relies on the loss of its PLA(2) enzymatic activity. 2000 Elsevier B.V. Ireland Ltd. All rights reserved.
Resumo:
This paper presents two mathematical models and one methodology to solve a transmission network expansion planning problem considering uncertainty in demand. The first model analyzed the uncertainty in the system as a whole; then, this model considers the uncertainty in the total demand of the power system. The second one analyzed the uncertainty in each load bus individually. The methodology used to solve the problem, finds the optimal transmission network expansion plan that allows the power system to operate adequately in an environment with uncertainty. The models presented are solved using a specialized genetic algorithm. The results obtained for several known systems from literature show that cheaper plans can be found satisfying the uncertainty in demand.
Resumo:
The objective of this paper is to present a methodology to analyze a transmission line model used in electromagnetic transitory simulators, called equivalent impedance test. Initially the definition of equivalent impedance reference test is shown. Soon after this methodology is applied to a transmission line model, the Quasi-Modes model. The studies were accomplished in a hypothetical non-transposed three-phase transmission fine of 440 kV. The line length is 500 km, and it was modeled through cascades of pi-circuits (with 50 pi's circuits, each with 10 km length).
Resumo:
We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.
Resumo:
The simulated annealing optimization technique has been successfully applied to a number of electrical engineering problems, including transmission system expansion planning. The method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Moreover, it has the ability to provide solutions arbitrarily close to an optimum (i.e. it is asymptotically convergent) as the cooling process slows down. The drawback of the approach is the computational burden: finding optimal solutions may be extremely expensive in some cases. This paper presents a Parallel Simulated Annealing, PSA, algorithm for solving the long term transmission network expansion planning problem. A strategy that does not affect the basic convergence properties of the Sequential Simulated Annealing algorithm have been implementeded and tested. The paper investigates the conditions under which the parallel algorithm is most efficient. The parallel implementations have been tested on three example networks: a small 6-bus network, and two complex real-life networks. Excellent results are reported in the test section of the paper: in addition to reductions in computing times, the Parallel Simulated Annealing algorithm proposed in the paper has shown significant improvements in solution quality for the largest of the test networks.
Resumo:
An analysis of the performance of six major methods of loss allocation for generators and demands was conducted, based on pro-rata (two), on incremental factors (two), on proportional sharing (PS) (one), and on electric circuit theory (one). Using relatively simple examples which can easily be checked, the advantages and disadvantages of each were ascertained and the results confirmed using a larger sample system (IEEE-118). The discussion considers the location and size of generators and demands, as well as the merits of the location of these agents for each configuration based on an analysis of the effect of various network modifications. Furthermore, an application in the South-Southeastern Brazilian Systems is performed. Conclusions and recommendations are presented. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
Initially this paper shows the ground wire reduction process for generic multiphase transmission lines and after, the ground wire reduction process for a specilic 440-kV three-phase overhead transmission line. Following this, the influence of the ground wire reduction process considering two situations is shown: first, considering frequency independence and second, when these parameters are considered as frequency dependent. This paper presents analytical results for generic multiphase transmission lines. For a specific 440-kV three-phase overhead transmission line, analytical and graphic results are shown considering real data for every frequency between 10 Hz and 1 MHz.
Resumo:
The objective of this letter is to propose an alternative modal representation of a nontransposed three-phase transmission line with a vertical symmetry plane by using two transformation matrices. Initially, Clarke's matrix is used to separate the line into components a, 0, and zero. Because a and zero components are not exact modes, they can be considered as being a two-phase line that will be decomposed in its exact modes by using a 2 x 2 modal transformation matrix. This letter will describe the characteristics of the two-phase line before mentioned. This modal representation is applied to decouple a nontransposed three-phase transmission line with a vertical symmetry plane whose nominal voltage is 440 kV.
Resumo:
The paper presents a constructive heuristic algorithm (CHA) for solving directly the long-term transmission-network-expansion-planning (LTTNEP) problem using the DC model. The LTTNEP is a very complex mixed-integer nonlinear-programming problem and presents a combinatorial growth in the search space. The CHA is used to find a solution for the LTTNEP problem of good quality. A sensitivity index is used in each step of the CHA to add circuits to the system. This sensitivity index is obtained by solving the relaxed problem of LTTNEP, i.e. considering the number of circuits to be added as a continuous variable. The relaxed problem is a large and complex nonlinear-programming problem and was solved through the interior-point method (IPM). Tests were performed using Garver's system, the modified IEEE 24-Bus system and the Southern Brazilian reduced system. The results presented show the good performance of IPM inside the CHA.