This action might not be possible to undo. Are you sure you want to continue?

Welcome to Scribd! Start your free trial and access books, documents and more.Find out more

3, AUGUST 2005

1631

**A Multiyear Dynamic Approach for Transmission Expansion Planning and Long-Term Marginal Costs Computation
**

António Silvestre D. Braga and João Tomé Saraiva, Member, IEEE

Abstract—This paper presents a multicriteria formulation for multiyear dynamic transmission expansion planning problems. This formulation considers three criteria: investment costs, operation costs, and the expected energy not supplied. The solution algorithm adopts an interactive decision-making approach that starts at a nondominated solution of the problem. This solution is identiﬁed transforming two of the three criteria in constraints specifying aspiration levels and using afterwards simulated annealing to deal with the integer nature of investment decisions. After obtaining this ﬁrst solution, the decision maker can alter the aspiration levels and run the application again to obtain a new solution. Once an expansion plan is accepted, the algorithm computes long-term marginal costs, reﬂecting both investment and operation costs. These costs are more stable than short-term ones and inherently address the revenue reconciliation problem well known in short-term approaches. The developed algorithm is tested using a case study based on the Portuguese 400/220/150-kV transmission network. Index Terms—Long-term marginal costs, simulated annealing, tariffs for use of networks, transmission expansion planning.

NOMENCLATURE The notation used throughout the paper is detailed as follows. STMC Short-Term Marginal Cost. LTMC Long-Term Marginal Cost. Short-term marginal price in bus . f Objective function of an optimization problem. Active load and generation in bus . i, p Index of load scenarios and periods in the planning horizon. nsc, np Number of load scenarios and number of periods. Duration of scenario . nbuses Number of buses. MBR Marginal-Based Remuneration. MC Marginal Cost. PNS Power Not Supplied. G Penalization of PNS. Generation variable cost in bus .

Manuscript received September 10, 2004; revised January 10, 2005. Paper no. TPWRS-00484-2004. A. S. D. Braga is with the Instituto Politécnico da Guarda, Escola Superior de Tecnologia e Gestão, 6300-559 Guarda, Portugal (e-mail: asdbraga@ipg.pt). J. T. Saraiva is with the Electrotenique and Computers Department, Faculdade de Engenharia da University do Porto and also with INESC Porto, Campus da FEUP, 4050 Porto, Portugal (e-mail: jsaraiva@fe.up.pt). Digital Object Identiﬁer 10.1109/TPWRS.2005.852121

DC sensitivity coefﬁcient of the active ﬂow in branch regarding the injected power in bus . Bounds on generation in bus . Bounds on the ﬂow in branch . m and n Indices for buses. Active ﬂow in branch . Estimate of active losses in branch . Loss Estimate of active losses in all branches. Conductance of branch . Phase difference across branch . Dual variables of an optimization problem. IC, OC, TC Investment, Operation, and Total Costs. EENS Expected Energy Not Supplied. Variation of the Investment and Operation costs. Variation of the load in bus . Solution of the Simulated Annealing Algorithm. ITC, WSC Iteration counter and worse solution counter. Temperature parameter and cooling rate parameter. K Boltzman constant. EF Evaluation function of the Simulated Annealing. Variation of the Evaluation Function. current Index of the current solution of the Simulated Annealing. new Index of a sampled solution of the Simulated Annealing. opt Index the optimal solution of the Simulated Annealing. rp Random number or probability. YSTMR Yearly Short-Term Marginal Remuneration. YLTMR Yearly Long-Term Marginal Remuneration. YOC, YIC, YTC Yearly Operation, Investment, and Total Costs. TSTMR Total Short-Term Marginal Remuneration. TLTMR Total Long-Term Margianal Remuneration. Return rate. I. INTRODUCTION OR THE LAST 25 years, the electric industry has been experimenting with a liberalization and restructuring process that started in Chile, spread to England and Wales in 1990, and then to other European countries, Australia, New Zealand,

F

0885-8950/$20.00 © 2005 IEEE

given its ability to preserve the discrete nature of the original problem. expansion plans must now be prepared in a decoupled way from generation and distribution. In Europe. Section VII presents the results obtained with the application of this formulation to a case study based on the Portuguese transmission 400/220/150-kV grid. network activities are typically not subjected to competition. the adopted algorithm. Network activities—comprising both transmission and distribution wiring activities. and one can easily identify a number of criteria to meet leading to multicriteria formulations. transient behavior. and Section VI details the transmission expansion planning formulation. The decision maker has the chance to modify the initially used aspiration levels to improve some speciﬁc criteria or allow some other to get degraded in some sort of tradeoff analysis. These values are more stable than short-term ones. VOL. transmission networks will now have to run after new users both at the generation and the demand side. As examples. Sections IV and V address regulatory issues and concepts about marginal costs. expansion plans should display a multiyear dynamic nature. a nondominated solution corresponding to an expansion plan is built using simulated annealing. Regarding distribution. NO. This problem is solved in an interactive way with the decision maker. The paper includes overviews on transmission expansion planning and on simulated annealing in Sections II and III. connection points start to move from distribution to transmission. Security of operation is ensured either by independent system operators (ISOs) or by transmission system operators (TSOs). At a regulatory level. together with the peculiarities of the product to be marketed and the difﬁculties in licensing new transmission lines due to environmental constraints. and a reliability index. Regarding transmission. introducing a new level of uncertainty regarding the location of connection points. represented by the Expected Energy Not Supplied (EENS). The algorithm starts by identifying a ﬁrst nondominated solution of the multicriteria problem. including extra payments to renewables). given that they include a long-term trend based on investment costs. They are discrete problems due to the integer nature of investment decisions. In each run. and they inherently address the revenue reconciliation problem that is usual in short-term applications. Apart from that. creating new challenges to transmission planners. and the computation of long-term marginal costs. Packages such as TRELSS and CREAM developed by EPRI . 20. This ﬁnally introduced competition at the extreme activities of the industry—generation and retailing—while keeping network transmission and distribution areas as natural monopolies. Initially. The increasing number of wind parks together with their increasing installed capacity leads to power surplus in some distribution networks that now start to inject in transmission. there was a strong accent on market mechanisms on the generation sector and on the liberalization of the access to the networks. This solution is built by converting two criteria in constraints specifying aspiration levels. and the United States. II. This means they should neither correspond to a set of yearly plans identiﬁed in a sequential and an independent way for each year in the horizon nor a set of individual investments selected to address particular problems in the network. the July 2003 EU Directive requires decoupling distribution wiring activities from retailing and the creation of independent distribution system operators. 3. The algorithm proceeds with subsequent changes of the aspiration levels until the decision maker is satisﬁed with the current nondominated solution. Coordination activities—including technical and regulatory aspects. AUGUST 2005 Latin American countries. Once this phase ﬁnishes. an investment scheduled for a particular year can have a positive impact in years afterward and can also contribute to solve problems elsewhere in the system. This means that in some way. they aim at characterizing expansion plans from the point of view of reliability. this paper presents a multicriteria formulation for the transmission expansion planning problem considering investment costs. As the installed capacity increases. Electricity markets implemented in several countries suffered from a short-term drawback in the sense that they failed in transmitting long-term signals to induce investments in new generation and transmission capacity. operation costs. given the interconnected nature of transmission networks. As this movement developed. In fact. Most of these formulations correspond to software packages developed by utilities or in research centers closely related with them. Transactions—the commercial relationship between generation and demand is performed by centralized pool markets or by bilateral contracts as well as by a number of ﬁnancial mechanisms aiming at reducing the risk inherent to short-term activities. and the supply of ancillary services. These facts. This unbundling process lead to a new organizational paradigm in which one can identify a number of activities with new actors and remuneration mechanisms: Generation activities—including generation under normal competitive regime. thus requiring regulatory mechanisms designed and supervised by regulatory agencies. there was a new challenge in decoupling distribution network operation from retailing. or stability. OVERVIEW OF TRANSMISSION EXPANSION PLANNING The literature on this topic includes a large number of publications that can be gathered in two large groups: — formulations to analyze preprepared expansion plans. transmission providers are usually merged with system operators leading to transmission system operators. lead to several well-known and discussed problems just illustrating the difﬁculties in combining short-term approaches with long-term requirements. generation under any special tariff regime (namely.1632 IEEE TRANSACTIONS ON POWER SYSTEMS. one can compute long-term nodal marginal costs reﬂecting both operation and investment costs. In view of the referred complexities and of the existing models and algorithms. and Section VIII draws the most relevant conclusions. This new environment still has to accommodate some characteristics typical of transmission expansion problems.

several emergent techniques. Different publications describe different models as well as solution algorithms. In this case. [1]–[4] describe linear and nonlinear approaches to this problem.BRAGA AND SARAIVA: MULTIYEAR DYNAMIC APPROACH 1633 and several others implemented by CEPEL in Brazil. those plans will be remunerated by tariffs for the use of transmission networks. it is important to mention that there is not a common transmission expansion formulation accepted by all researchers. the temperature is lowered in a slow pace so that the system can evolve to a low-energy state in a clear analogy with thermodynamic cooling problems. The simulated annealing algorithm is summarized below. as included in the present paper. it can still be accepted. After that. and [14] uses grasp. This also means that all these approaches combine in a single function two criteria related with investment costs and reliability requiring some prior knowledge of the maximum price that the consumers are willing to pay for electricity. if End if a stopping rule is reached. All these models have in common the fact that each solution is evaluated by a cost function reﬂecting investment costs plus a penalty on unserved energy. Metaheuristic search procedures move away from one solution by sampling another one that is accepted if it improves the selected performance index. computing the evaluation function 2) Evaluate . and game theory. to impose rules on activities still conducted on a monopoly basis. [19] is a metaheuristic optimization procedure that. Technical security or supply indices determine investments to be remunerated by tariffs. to and to The index 3) Assign opt denotes the best solution identiﬁed so far. to induce improvements on technical and economic behaviors. c) else . Some others select investments according to a Merit Index or to a tradeoff relation between investment cost and the resulting beneﬁt [7]–[9]. the expansion formulations included continuous variables to represent the capacity of new branches. then assign to and b) if to . The acceptance probability is progressively reduced to avoid oscillation and to make sure that the search is more chaotic in the beginning and concentrated in a promising area as the algorithm proceeds. thus requiring approximations to obtain a ﬁnal technically feasible solution. 4) Sample a new solution in the neighborhood of the at iteration ITC. such as simulated annealing. and EDF in France are examples of these approaches. In several countries. but it is not usually possible to guarantee global optimality. REGULATORY ASPECTS Regulation became a crucial activity in the electricity industry as a way to set targets. 1) Select an initial solution in the solution space X and set the iteration counter ITC at 0. which is inferior but usually close to 1. It comes clear that if this penalty is high. If it is worse. . and go back to step 4). together with genetic algorithms and tabu search.0. If approved. they require being regulated from a technical and an economic point of view. the plan tends to have larger investment costs displaying a tradeoff between investments and unserved energy. current solution 5) Testing then assign to . Finally. SIMULATED ANNEALING—AN OVERVIEW Simulated annealing [18]. as in Portugal. III. References [10] and [12] describe the application of genetic algorithms to the transmission expansion problem. Traditionally. started to be applied to this problem [10]–[17]. let Along the algorithm. [17] corresponds to an initial report on the current paper but not yet considering the full multicriteria approach nor the complete application to the Portuguese transmission system. genetic algorithms. depending on a small acceptance probability. a) if . meaning that each one is used during a ﬁxed number of iterations. Usually. This is an important advantage when compared with traditional gradient-based algorithms. the temperature is lowered by a coefﬁcient . and therefore. the temperature evolves by levels. ENEL in Italy. These approaches usually provide good solutions in the sense that they improve a performance index. is specially designed to address combinatorial problems. otherwise. References [15] and [16] detail the use of tabu search. Such other papers as [5] and [6] adopt Branch and Bound and Benders Decomposition-based methods in a way to preserve the discrete nature of investments. assign to . This ensures the adequate levels of quality of service while inducing expansion and reinforcement investments. More recently. Transmission activities are most widely provided in a monopoly basis. TSOs are then usually obliged to prepare and submit expansion plans to the regulatory agency to guarantee those indices. 6) IV. — optimization models aiming at building expansion plans according to some criteria. For instance. tabu search. and to defend consumers. [11] adopts simulated annealing. the transmission system provider must provide its service according to a number of indices speciﬁed by the regulatory agency for several security criteria. — The link between technical issues and economic aspects becomes clear. This mechanism shows some interesting aspects. — get a random number rp in — compute the probability of accepting worse soluby (1) where is tions at iteration ITC the Boltzman constant ITC d) (1) . This is used to escape from local optima and to make a wider search on the solution space until a more promising area is located.

VOL. In this expression. short term or long term.1634 IEEE TRANSACTIONS ON POWER SYSTEMS. NODAL MARGINAL COSTS A. and it is updated every two years to progressively accommodate more reﬁned forecasts for several parameters affected by uncertainties. STMC can be obtained as subproducts of dispatch problems by adequately using dual variables in linearized problems [21]. to defend consumers. — branch ﬂow constraints (8) established with the dc sensitivity coefﬁcients (4) Electricity marginal costs display a geographical nature and can either be short or long term. Computation of STMCs For a given topology and set of loads. In this case. If available and ensuring the same technical results. of new demand from distribution systems. — Given the impact of investments in tariffs. adopted in England and Wales and detailed in [24]. in (3). 3. is the load in node and PNS represents Power — Not Supplied penalized by G. V. STMCs can be obtained solving the problem in (4)–(8). . a less costly investment plan will have to be selected. The model includes the following: — a global balance generation/load (5). This amount comes from the geographic dispersion of these costs and leads to a surplus coming from expression (3). on the conﬁguration in operation. As an example. STMC or LTMC can then be used to set STMP or LTMP to be used in tariffs for use of networks. and is the cor— responding variable cost. and are the minimum and maximum — generation levels in node . This means that they should be computed in the scope of transmission expansion planning problems. This plan is submitted to the regulatory agency. they are easily computed. and on component outages. active losses can be estimated by is the branch conductance. depending on whether they reﬂect only short-term operation costs or they include both longterm operation and investment costs. it becomes clear that expansion plans have to be built carefully. there are not numerous examples of their use in real tariff systems. and are the minimum and maximum active — ﬂow levels in branch . [26] (percentages varying from 10%–20% are reported for different systems) leading to the already referred revenue reconciliation problem. Once this problem is run. the TSO has to prepare a transmission expansion plan with a six-year horizon based on forecasts of new generation stations. we assumed that MCs. [22]. NO. on generation costs. Deﬁnitions The marginal cost of electricity [20] can be deﬁned as the impact on the objective function of an optimization problem due to a change in the demand (2) (2) — at the nodal cost at the bus to which they are connected. and on the speciﬁed security indices. we speciﬁed that each generator or load is paid or pays the electricity (5) (6) (7) (8) In this formulation: is the generation level in bus . and (9). but they are very volatile since they depend on the load level [23]. were computed for a load scenario or system topology having duration and is the number of load scenarios along a year MBR MBR (3) MBR based on STMC is usually reduced when compared with the regulated amount [25]. and they are able to transmit economic signals to induce more efﬁcient uses of the network. it represents a commitment of the regulatory agency to an evolution of those tariffs along the planning horizon. Given the complexity of their computation. namely. LTMCs reﬂect operation and investment costs along a multiyear horizon. When STMC or LTMC are available. LTMCs are more stable than STMC since they include a long-term trend. In this case. — is the dc model sensitivity coefﬁcient relating the active ﬂow in branch with the injected power in node . — generation (6) and PNS (7) limit constraints. This volatility leads to the concept of spot prices as time-dependent STMC. we can compute the marginal-based remuneration to assign to the transmission provider as a part of its regulated remuneration. on transmission limits. MBR based on LTMC inherently addresses this problem since LTMCs also reﬂect investment costs. is the phase difference along branch (9) The results of the problem in (4)–(8) can now be adjusted to include an estimate of active losses using the algorithm that follows. 20. On the contrary. on indications about distributed generation either directly connected to transmission or to distribution. B. turning their calculation more complex. One of the rare examples is the ICRP. In Portugal. AUGUST 2005 Once an expansion is approved.

the decision maker could conduct a tradeoff analysis to get more insight about the set of nondominated solutions and ﬁnally select one of them. are short-term operation variables (generation. and the identiﬁed nondominated solution is then presented to the decision maker. computed for each period using a pseudochronological simulation described in [27]. — These two time scales are interrelated in the sense that operation costs can be reduced by new investments. etc. the STMC in node is computed using (10). This prevents using several methods to deal with multicriteria problems. — One should keep in mind that load will change along the horizon and that. have a positive impact in other years and in other locations given the meshed nature of transmission networks. in fact. we adopted an interactive approach that does not require the knowledge of the nondominated frontier and that is able to address a generic problem as (12)–(16).BRAGA AND SARAIVA: MULTIYEAR DYNAMIC APPROACH 1635 1) Solve problem (4)–(8) and set iteration counter itr at 1. 6) Check convergence by comparing voltage phases in two consecutive iterations.). This turns the problem into a multicriteria discrete one. is the vector of criteria. (13) are operation constraints for every year of the horizon. (15) represent operation and technical limit constraints. and alonger one where one has to deal with investment decisions. we used the EENS. in most cases. The total operation cost will be the addition of the yearly costs adjusted in a similar way to (11). and Loss represents active losses in all system branches Loss (10) For each period in the horizon. A shorter one within which available components are ﬁxed and one wants to evaluate operation costs. represents the discrete list of reinforcements or expansions. related with congestion and active losses. The investment cost of a plan IC is the sum of investment . that is. In this formulation. In our case. If convergence was not yet reached. TRANSMISSION EXPANSION PLANNING ALGORITHM A. adequately adcosts justed using a return rate (11) IC (11) Using the results obtained in the last iteration of this algorithm. a plan is characterized by the OC. 3) Estimate branch losses using (9) and add half of the losses in branch m-n to the loads in nodes m and n. variable of the PNS constraint in node . they have to accommodate two time scales. operation costs are determined by solving the short-term dispatch problem in (4)–(8). namely. 2) Build the nodal injection vector and compute voltage phases using the inverse of the dc model bus admittance matrix. — Investment decision variables are discrete. 4) Solve problem (4)–(8) considering the new load vector and increase itr by 1. and the algorithm will eventually select it as whole. If he is not satisﬁed. the optimal one. Finally. General Aspects Transmission expansion planning problems have some peculiarities that should be stressed. is the dual variable of is the active ﬂow in branch m-n. is the constraint (5). In the developed formulation. he can change the aspiration levels. in general. and EENS. is the dual dual variable of an active branch limit constraint. In this case. along the np periods in the horizon. Apart from this. and (16) enumerate the available transmission capacities related with possible investment decisions OC IC EENS (12) (13) (14) (15) (16) VI. the decision maker speciﬁes aspiration levels for the investment cost and for EENS. This leads to an integer single objective problem. Dealing With the Multicriteria Problem The problem under analysis is very complex due to its integer nature and its size. limits on The interactive approach starts by building a ﬁrst nondominated solution using the -constrained method detailed in [28]. the discrete nature of this problem is preserved since the user speciﬁes a list of possible components to reinforce or build. would not be. — In the ﬁrst place. imposing an improvement of some criteria or . In our case. In our implementation. The developed formulation also considers a reliability index since investments can also be driven by the degradation of reliability. namely. leading to a multicriteria problem. once rounded to the closest integer. In this expression. is the STMC at node k. As a result. leading to a discrete optimization problem. Each possible reinforcement or new component is characterized by its investment cost. This has the drawback of leading to a technically infeasible solution that. ones that build the nondominated frontier to be presented to the decision maker. and (14) represents limits on the number of reinforcements or expansions per period or limits related with the available amount of money to invest per year. 5) Build the nodal injection vector and compute voltage phases using the inverse of the dc model bus admittance matrix. admitting that the elements in the plan under analysis are available in the selected commissioning years and in subsequent periods. IC. not as in continuous problems in which one can obtain a value between 0 and 1 for a decision variable. investments should be seen in a global way since a new component especially selected to address some local problem on a speciﬁc year can. there are several and most usually contradictory criteria. B. This method requires converting all objectives but one in constraints using aspiration levels. This means solving as many short-term dispatch problems as the number np of periods. return to 3). branch ﬂows.

A new installation will then be available in subsequent periods. Set the worse solution counter (WSC) at 0. Get a random number Compute the probability of accepting worse soluby (17) tions (17) c) d) 7) 8) . the algorithm organizes elements of the list of expansions and reinforcements in a structured multiyear dynamic plan as detailed below. it gives the planner a more intervening role in appreciating a plan and eventually changing aspiration levels to build a new solution more in accordance with his requirements. among the ones in the list of possible additions. OC and IC. then do the following. The approach adopted in this paper does not require this a priori value. Decrease the current temperature level T by a rate . In these cases. Computation of LTMCs Given the integer nature of investments. 1) 2) a) b) c) Consider the current transmission/generation system as the initial topology and denote it as . two criteria—investment costs and unserved energy—were combined in a single objective function requiring a priori the speciﬁcation of the penalty on load curtailment. in the neighborhood of the Identify a new plan current one—sample one of the periods in the planning horizon. or if the global investment limit is exceeded. Else. then do the following. regarding the initial solution. Assign Set the iteration counter (ITC) to 1. 6) a) b) If . Solve problem (4)–(8) to evaluate the short-term OC for the current topology. End. to and to . This algorithm uses a list of expansions and reinforcements from which it samples components to build and the corresponding year. Therefore. Set the ITC to 1. This solution approach is conceptually different from the one described in several references. If . increase the ITC by 1. Increase the WSC by 1. Assign Set the WSC at 0. If C. go back to 3). in the ones referred to in the last paragraph of Section II. if the limit for yearly investments is exceeded. . in case they are out of the ranges speciﬁed by the decision maker. .1636 IEEE TRANSACTIONS ON POWER SYSTEMS. Analyze the current solution: Compute the IC and the EENS. and that is. then go to 9). or to decommission. NO. to evaluate (18) d) e) f) g) 3) VII. then assign to and to . 20. for instance. AUGUST 2005 admitting a degradation of another one. and then sample a new installation to build. and the expansion-planning algorithm is run to identify the most adequate plan and to evaluate the impacts on operation and investment costs. then go to 9). To preserve this characteristic and to ensure that the solutions to be obtained are technically feasible and implementable. to and to . discard this solution and return to 3). using the ideas in [29]. 3. we compute an approximation of LTMC using (18). VOL. If WSC is larger than a speciﬁed maximum number of iterations without improvements. This is iterated until the decision maker is satisﬁed with the solution. it is not correct to use a differential-based expression like (2) to compute LTMC. then do the following. For node . we adopted simulated annealing. among the existing ones. If the ITC is larger than the maximum number of iterations per temperature level. Instead. If the new temperature level is smaller then the minimum allowed temperature. Assign to and to . Identiﬁcation of Nondominated Solutions The single objective problem resulting from the application of the -constrained method still has an integer nature. According to the ideas in Section III. load is increased by . and and obtain Compute . a) b) c) 9) D. as the sum of OC Build the evaluation function and penalizations for IC and EENS. . C 4) a) b) 5) a) b) c) . Analyze the new plan: Check if the limit for the number of installations to build per period is exceeded. If it does. Assign to and to . the new value for the evaluation function.

Transmission Expansion Plan for 2002–2007 The most adequate plan identiﬁed by the algorithm described in Section VI includes 100 investments distributed as follows: 36 in 2002. 2004. In 2004. a third 400-kV link with the Spanish grid located in the south was commissioned. 2005. to increase the combinatorial level of the problem. The remaining ones will have a indirect impact either because the demand of some distribution networks seen by the transmission system will be reduced while some other distribution networks will become self-sufﬁcient or the ﬂows will. Some of these wind parks will have a direct impact on the transmission system because they will be directly connected to transmission substations. a maximum number of 36 new additions per year. We also admitted that the generation system was going to evolve as indicated in [30] from 2002 to 2007: a new natural gas station (4 292 MW starting at 2002. lines or transformers can be installed in parallel. TABLE II SELECTED INVESTMENTS AND THEIR TEMPORAL LOCATION TABLE III LTMCS (IN kW. C. It is also important to stress that there are plans to increase the installed capacity in wind parks up to 3500 MW by 2010. B. the expansion planning exercise aimed at building a six-year plan—2002–2007. 14 in 2005. To enlarge the solution space. seven in 2006. Table II shows part of this plan. 220-kV lines in the central and northeast parts of the country. we admitted that each element in this list can be used twice. be reversed toward the transmission grid. 27 in 2004. Table I indicates the extreme buses. There were three 220-kV links in the northeast. the type of investment. TABLE I PART OF THE LIST OF POSSIBLE INVESTMENTS As required by Portuguese regulations. Table III indicates the values of LTMCs (in kilowatthours) along the six-year horizon for several buses of the 400/220/150-kV grid. and four in 2007. The expansion exercise used a list with 180 possible investments that are partially enumerated in Table I. These marginal costs can then be used to set LTMP. and 2006) and new hydro stations (2 118 to start in 2002 and 178 MW to start in 2004). that is. List of Possible Lines and Substations to Build Due to the new generation stations and to the evolution of the distribution system along the six-year horizon. LTMCs As indicated in Section VI-D. it will be necessary to connect 59 new nodes. We used data in [30]. D.5% per year. 150-kV lines in the south and northwest.h) . to simulate ﬁnancial constraints and a 10% return rate. in fact. that is. indicating for each investment the corresponding commissioning year. the transmission capacity. The investments in Table II correspond to the ones in Table I that were incorporated in the ﬁnal plan. and the investment cost. the LTMCs can be computed as soon as an expansion plan is selected by evaluating the impact in operation and investment costs of varying the demand. a demand increase of 3. 12 in 2003. For each of them.BRAGA AND SARAIVA: MULTIYEAR DYNAMIC APPROACH 1637 — — — north–south and west–east 400-kV lines with two 400-kV links with the Spanish grid (in the north and center).

vol. Webb. G. and YTC. Feb. 1996.” IEEE Trans. A. 16. and J. Bohn. 3074–3083.” Science. Gelatt. F. This means this approach inherently addresses the revenue reconciliation problem that is usual when short-term approaches are used. May 2001.” IEEE Trans. R. Avignon. Pereira. G. 1989. Symp. Schweppe. J.. 2000.. no. Power App. no. [18] S. G. These two issues have a close relation because in several countries. Garver. AND REMUNERATIONS systems and to set the corresponding appropriate levels of tariffs for use of networks. C. H. Cost Recovery Analysis Finally. A. 11.K.. L. vol. 1427–1440. and L. Syst. Ortiz.. K. 12. Mori and Y.” in Proc.. G.1638 IEEE TRANSACTIONS ON POWER SYSTEMS. T. 2. vol. using the LTMP. Bologna. Nov. “New transmission planning model. 2. Vecchi. 1990. 16. “Optimization by simulated annealing.. pp. Alves. Palma. France. 1982. R. This table includes the following information: — the yearly EENS and its percentage regarding the demand. vol.” IEEE Trans. H. Oper. 1988. 2000.” in Proc. and C. D. “Interactive transmission network planning using a least-effort criterion. [15] E. Silva.” IEEE Trans. Melo. REFERENCES [1] R. pp. J. Table IV displays the ﬁnal aggregated values. Brazil. Y. and J. no. Villasana. L. vol. A. 1985. YIC. vol. Morozowski. [16] H. Pereira. Conf. “A decomposition approach to automated generation/transmission expansion planning. Lira. Kirkpatrick. 1. P. 1995.04%) and by TLTMR (99. K. P. “Priority evaluation and ranking of transmission system projects—Computer models and results. pp. 2001. “Optimization of transmission line planning including security constraints. [12] E. COSTS. 1. M. Power Syst. 4. Caramanis. no. pp. J. 1974. Gil.. Comput. no. pp. 2003.. and J. Portugal. M. Stockholm Power Tech. [11] R.” IEEE Trans. Pinto. Power Syst. May 1983. and R. Syst.” in Proc. no. Power App. vol. 2001. B. vol. Specialists Elect. 1507–1513. da Silva. Aug. [13] J.” IEEE Trans. Oliveira. — the TC and the TSTMRs and TLTMRs as sums of the yearly amounts. Salon. 1993. — the YOC. 1. 9–18. 15. V. 1989. “Penalty factor calculations for marginal pricing of transmission systems in a hydroelectrical system.” IEEE Trans. C. Syst. “Transmission network expansion planning under a tabu search approach. 4598. D. — the YSTMRs and YLTMRs obtained using (3) with STMP and with LTMP. S.. — the percentage of TC recovered by TSTMR (41. “Transmission network expansion planning under an improved genetic algorithm. 4. Silva. 4. R. M. Romero. J. S. [9] J. 220. G. Aarts and J. 10. no. although it increases as the planning horizon develops. pp. Areiza. “Computation and decomposition of spot prices for transmission pricing. Spot Pricing of Electricity. [14] S. and M.. H. Power Syst. A. E. 62–68. Power Syst. G. and J. Oct. 10. [3] H. Jun. 371–378. A. vol. [22] H. Barros. pp.” IEEE Trans. Pinto. Parker. “Parallel simulated annealing applied to long term transmission network expansion planning. “A parallel tabu search approach to transmission network expansion Planning. The described approach identiﬁes expansion plans in the scope of a multicriteria formulation that builds nondominated solutions using the -constrained method and simulated annealing. Gallego. [4] A. Aug. L. CONCLUSION In this paper. Monticelli. Hnyilicza. and A. no. 20. [10] H. and G.” IEEE Trans. pp. L Hicks. [20] F. pp. C. no. 1434–1440. This kind of approach is useful both for transmission companies and regulatory agencies given the link between plans and tariffs referred to above. 4156–4163. S. M. Bologna Power Tech. Aug. “Optimization of transmission expansion planning and impact in the reliability tariff—Methodology and case study. L. U. All costs and remunerations are referred to the initial year using the referred 10% rate.. Nov. Binato. IEEE Porto Power Tech. Silva. no. C. Expansion Planning. PAS-101. C. L. pp. C.. S... Rudnick.. “Transmission network planning using linear programming. Power Syst.” IEEE Trans. Power Syst. and H.. “Transmission expansion by branch-and-bound integer programming with optimal cost—Capacity curves. [19] E. 15. Conf. 1997. Oliveira. Bennon. Lee. Aug. “A kernel-oriented algorithm for transmission expansion planning. J. Praça. Jun. 11th Power Syst. pp. 1390–1400. Pérez-Arriaga. Korst. 1168–1174. London.. List. L. Cunha. PAS-93. and a cost recovery analysis was conducted. Juves. NO. Power App. [6] A. Sep. M. pp. M.. and E. V. Power App. vol. [2] M. no. no. [17] A. G. Porto. Stockholm. Seifu. 1990. V. “Transmission expansion planning and long term marginal prices calculation using simulated annealing. This means that investments should be adequately selected as they have a direct impact in consumer tariffs. pp. T. pp. R. “Economically adapted transmission systems in open access schemes—Application of genetic algorithms. Rivier and I. E. “A greedy randomized adaptive search procedure for transmission expansion planning. V. A. Youssef and R. [7] A. 704–709. Syst. B. A.” IEEE Trans. Nov. 3. pp. transmission companies are remunerated according to their costs. PAS-104. Simulated Annealing and Boltzman Machines. 5. AUGUST 2005 TABLE IV GLOBAL RESULTS FOR PNS. Feb. Rudnick. V. PAS-104. Italy. 1017–1023. 11. Monticelli. Tabors. 247–253.” IEEE Trans. Sone. [5] S. 4. Power App. PAS-101. Pereira. and S. A. 3. Saraiva. Feb. [21] M. Araújo. Braga and J.45%). pp. R. May 2002. we described an integrated approach to identify adequate transmission expansion plans together with setting the tariffs for use of transmission networks based on LTMCs. [8] M. no. This percentage is quite reduced. Power Syst. Syst. no. Melo. 3919–3925. pp.-Oct. M. Wu. Sep. 1985. Salon. Cunha. VOL. The use of this metaheuristic enabled us to address the integer nature of investment decisions and to build realistic and technically feasible solutions corresponding to sets of equipments to build organized in a multiyear dynamic expansion plan.” IEEE Trans. 671–680. Power Syst. the LTMR was computed.” in Proc. Oliveira. Hackam. P. Sweden. New York: Wiley. 3. vol. it can be very useful as a way to ensure or increase the quality of service in modern power .” IEEE Trans. VIII. In this sense. Contreras and F. 349–355.” in Proc. Palma. The results obtained with this model indicate that LTMPs can almost completely cover the incurred operational and investment costs. 181–188. vol. vol. Binato. 5. Oct. and G. “Optimal long range transmission planning with AC load ﬂow. Brasília.: Kluwer. vol. Feb. Meliopoulos. 3. Power Syst. L. C. no. 1982. Cura. R. vol. and S. and R.

R. da Silva. Saraiva. Norway. Porto. Porto. Rede Electrica Nacional (REN). no. 15. 1995. pp. 73–80.” in Proc. 1979. Power Syst. Washington.. vol. Marin. and R. Aug. [29] E. . de Leão. 2001.. do Porto (FEUP). Lecture Notes in Economics and Mathematical Systems. 13th Power Syst. L.-L. 2000. Portugal. France. Germany: Springer-Verlag. Portugal.” IEEE Trans. J. degrees from Faculdade de Engenharia da Univ. Puerta. Saraiva. Several of these projects were developed under consultancy contracts with the Portuguese Electricity Regulatory Agency. Arceluz. IEEE Porto Power Tech. Feb. quality in power systems.BRAGA AND SARAIVA: MULTIYEAR DYNAMIC APPROACH 1639 [23] J. C.D. and Ph. M. Mello. and J. Electric Utility Planning and Regulation. and Agregado degrees in electrical and computer engineering from the Faculdade de Engenharia da Universidade do Porto (FEUP). C. 1988. Comput. In 1991. Guarda. and M. 265–275. Khan. 546–553.Sc. pp. [30] Characterization of the National Transmission Grid in December 31st 2001. pp.. [25] I. Conf. and 2004. Conf. F. 1999. Portugal. Hwang and A. João Tomé Saraiva (M’00) was born in Porto. Available: http://www. Ph. A. “Evaluation of the impact of load uncertainties in spot prices using fuzzy set models. T. Portugal. H. Sep. pp.D. vol. all in electrical and computer engineering. in 1991. Porto. T. T. in 1987.ren. in 1962. and 2002. 385–391. Billinton.” IEEE Trans. 1993. Avignon..” in Proc. Masud. “Evaluation of the marginal based remuneration—A case study using the portuguese transmission network. Power Syst. In 1985.. and tariffs due for the use of transmission and distribution networks. Computat. 10. [Online]. J. Jul. Silva. M. Trondheim. 1993. [24] M. Feb.. [27] A. respectively. “Charging for use of a transmission system by marginal cost methods. Manso. Berlin. J.. Portugal. Calviou.Sc.pt António Silvestre D. He is currently a Professor with FEUP. and P. Plumptre. P. he joined INESC Porto—a private research institute—where he was Head Researcher and collaborated in several projects related with the development of DMS systems. Rubio. Multiple Objective Decision Making—Methods and Applications—A State of the Art Survey.. He received the licentiate. 1. in 1964. Pérez-Arriaga. S. DC: American Council for an Energy-Efﬁciency Economy. [28] C. P. “Marginal pricing of transmission services: An analysis of cost recovery. 1997. He received the M. Portugal. respectively. 11th Power Syst. 1. Dunnett. L. J.” in Proc. [26] J. no. J. “Pseudochronological simulation for composite reliability analysis with time varying loads. he joined the Polytechnic Institute of Guarda (IPG). Braga was born in Seia.

- ch3
- 06119996_002
- Dispatchable generation abk
- Power Line Carrier
- High Voltage Direct Current Transmission
- High Voltage Direct Current Transmission System HVDC Seminar
- Transmission Userguide
- Siemens Power Engineering Guide 7E 481
- Sectionalizing Study of 13233 Kv Grid Sub Station
- Power Transmission Lines
- Session_5
- Impact of Severe Solar Flares, Nuclear EMP and Intentional EMI on Electric Grids
- Aproximation Algorithm for Facility Location Problem
- 8 Semester
- [1971] - Bibiliography of Relay Literature, 1967-1969
- MCO0
- ABB Placement Paper | Freshers Choice
- AoW 10 Green the Bailout
- Genetic Algorithm Based Optimal Distributed Generation Allocation and Sizing for Voltage Stability Improvement and Loss Minimization
- TV_Chabolle
- Smart Grid Document
- Hybrid Neuro Swarm
- DG Contribution to network security_R2.pdf
- ILSAS Training Schedule 2013
- How to Solve Rubik's Cube.
- 6 Vol 17 No 1
- Wikipedia
- App 11.3 Transmission Unit Cost Study SNC Lavalin
- Power Allocation and Admission Control InMultiuser Relay Networks via Convex Programming Centralized and Distributed Schemes, JWCN 2009
- art%3A10.1007%2Fs00453-013-9784-1.pdf

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd