Yearly Maintenance Scheduling of Transmission Lines Within a Market Environment

Pandžić, Hrvoje; Conejo, Antonio J.; Kuzle, Igor; Caro, Eduardo

doi:10.1109/tpwrs.2011.2159743

Cited by 62 publications

(38 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…is a vector containing all the continuous decision variables for the base case and contingency cases which are added to the original master problem, such as the unit power generation, line power flows; is the cost vector; represents (6)- (12) in compact form; and represents (4) and (5).…”

Section: B Relaxation Induced Algorithm For the Master Problem 1) Fomentioning

confidence: 99%

“…where is a vector containing all the relaxed binary decision variables associated with these generating units and transmission lines; and represent (6) to (12) in compact form. The difference between and is that the binary variables is slacked to in .…”

Section: B Relaxation Induced Algorithm For the Master Problem 1) Fomentioning

confidence: 99%

“…Marwali and Shahidehpour [10] proposed a short-term transmission MS model that minimizes the maintenance costs and the loss of revenue and used Benders' method to decompose the original problem into a master problem and a series of sub-problems. Li and Korczynski [11] presented a reliability-based method for transmission MS. Pandzic and Conejo [12] proposed a bi-level model for yearly transmission MS that makes possible a tradeoff between maximizing the system capacity margin and minimizing the market impact. This model can also be converted into a mixed-integer linear programming problem based on the KKT condition.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Approach for Integrated Generation and Transmission Maintenance Scheduling Considering N-1 Contingencies

Wang¹,

Zhong²,

Xia³

et al. 2016

IEEE Trans. Power Syst.

View full text Add to dashboard Cite

This paper presents an approach for integrated generation and transmission maintenance scheduling model (IMS) that takes into consideration N-1 contingencies. The objective is to maximize the maintenance preference of facility owners while satisfying N-1 security and other constraints. To achieve this goal, Benders decomposition is employed to decompose the problem into a master problem and several sub-problems. A Relaxation Induced (RI) algorithm is proposed to efficiently solve the large mixed integer programming (MIP) master problem. This algorithm is based on the solution of the linear relaxed problem. It is demonstrated that the proposed algorithm can efficiently reach a near-optimal solution that is usually satisfactory. If this near-optimal solution is not acceptable, it is used as the initial solution to fast start the solution of the original IMS problem. The performance of the proposed method is demonstrated using a modified version of the IEEE 30-bus system and a model of the power system of a Chinese province. Case studies show that the proposed algorithm can improve the computational efficiency by more than an order of magnitude.

show abstract

Section: B Relaxation Induced Algorithm For the Master Problem 1) Fomentioning

confidence: 99%

Section: B Relaxation Induced Algorithm For the Master Problem 1) Fomentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Approach for Integrated Generation and Transmission Maintenance Scheduling Considering N-1 Contingencies

Wang¹,

Zhong²,

Xia³

et al. 2016

IEEE Trans. Power Syst.

View full text Add to dashboard Cite

show abstract

“…We want to emphasize that the season can be defined to be a week, a month, or any other desired time period. It should be mentioned that periodic switching of transmission lines has been used for maintenance ( [16], [17]), and also for making trade-offs between protecting against potential contingencies in winter versus avoiding potential overloads in summer [1]. Our seasonal TS focuses on the economics of switching for cost reductions.…”

Section: Introductionmentioning

confidence: 99%

A Decomposition Approach for Solving Seasonal Transmission Switching

Jabarnejad

Wang

Valenzuela

2015

IEEE Trans. Power Syst.

View full text Add to dashboard Cite

Economic transmission switching has been proposed as a new control paradigm to improve the economics of electric power systems. In practice, the transmission switching operation itself is a disruptive action to the system. Frequently switching lines into or out of service can create undesirable effects on the security and reliability of power systems and may require new investments in the automation and control systems. In this paper, we formulate an economic seasonal transmission switching model where transmission switching occurs once at the beginning of a time period (season) and then the transmission topology remains unchanged during that period. The proposed seasonal transmission switching model is a large-scale mixed integer programming problem. The objective of the optimization model is to minimize the total energy generation cost over the season subject to loads and N-1 reliability requirements. We develop a novel decomposition method that decomposes the seasonal problem into one-hour problems which are then solved efficiently. We demonstrate our model and the decomposition approach on the 14-bus, 39-bus, and 118-bus power systems and show potential cost savings in each case.Index Terms-Decomposition, mixed integer programming, power generation dispatch and economics, seasonal transmission switching (STS).

show abstract

“…The MOP could be transformed into a singleobjective optimization problem (SOP) using a weighted sum method (Deb, 2001;Heo et al, 2011) or converting an objective into a constraint (Marwali and Shahidehpour, 1999;Wu L et al, 2008;Pandzic et al, 2012). The SOP transformed is then solved by a single-objective optimization method.…”

Section: Introductionmentioning

confidence: 99%

Generation maintenance scheduling based on multiple objectives and their relationship analysis

Zhan

Guo

Zhang

et al. 2014

J. Zhejiang Univ. - Sci. C

View full text Add to dashboard Cite

In a market environment of power systems, each producer pursues its maximal profit while the independent system operator is in charge of the system reliability and the minimization of the total generation cost when generating the generation maintenance scheduling (GMS). Thus, the GMS is inherently a multi-objective optimization problem as its objectives usually conflict with each other. This paper proposes a multi-objective GMS model in a market environment which includes three types of objectives, i.e., each producer's profit, the system reliability, and the total generation cost. The GMS model has been solved by the group search optimizer with multiple producers (GSOMP) on two test systems. The simulation results show that the model is well solved by the GSOMP with a set of evenly distributed Pareto-optimal solutions obtained. The simulation results also illustrate that one producer's profit conflicts with another one's, that the total generation cost does not conflict with the profit of the producer possessing the cheapest units while the total generation cost conflicts with the other producers' profits, and that the reliability objective conflicts with the other objectives.

show abstract

Yearly Maintenance Scheduling of Transmission Lines Within a Market Environment

Cited by 62 publications

References 21 publications

An Approach for Integrated Generation and Transmission Maintenance Scheduling Considering N-1 Contingencies

An Approach for Integrated Generation and Transmission Maintenance Scheduling Considering N-1 Contingencies

A Decomposition Approach for Solving Seasonal Transmission Switching

Generation maintenance scheduling based on multiple objectives and their relationship analysis

Contact Info

Product

Resources

About