Ali Bagheri

Ali Bagheri

Auto-generated profile, based on publicly available information

Ali Bagheri

School of Industrial Engineering and Management, Oklahoma State University, Stillwater, OK, USA

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2010 in Future Generation Computer Systems
Verified
Journal Article
Closed access
ABA. Bagheri
A. Bagheri
MZMostafa Zandieh
Mostafa Zandieh
IMIraj Mahdavi
Iraj Mahdavi
MYM. Yazdani
M. Yazdani

1 October 2018 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
ABAli Bagheri
Ali Bagheri
CZChaoyue Zhao
Chaoyue Zhao
FQFeng Qiu
Feng Qiu
JWJianhui Wang
Jianhui Wang
Hardening components in transmission systems is a practice to improve system resilience against possible disturbances caused by natural disasters. In a power system with a very high penetration of renewable energy, the system hardening will be further complicated by the uncertainty and variability of renewable energy. In this paper, we study the transmission line hardening planing problem in the context of probabilistic power flows injected by the high penetration of renewable energy. We assume that the probabilistic information of renewable energy is incomplete and ambiguous and propose a data-driven approach to approximate the renewable uncertainty sets. We then extend the $N-1$ security criteria to multiple simultaneous contingencies and seek to prepare a hardening plan for the worst-case scenarios. A two-stage data-driven stochastic model is formulated by considering the joint worst-case wind output distribution and transmission line contingencies. Then, we apply the Column-and-Constraints generation method to solve the proposed model. To test the effectiveness of the proposed approach, we conduct experiments on 24-bus and 118-bus test systems. We numerically show that the data-driven approach can effectively address the uncertainty ambiguity and the proposed approach can produce effective hardening plans that improve the system resilience.

5 December 2016 in IEEE Transactions on Power Systems
Verified
Journal Article
Open access
ABAli Bagheri
Ali Bagheri
JWJianhui Wang
Jianhui Wang
CZChaoyue Zhao
Chaoyue Zhao
Due to the significant improvements of power generation technologies and the trend of replacing traditional power plants with renewable generation resources, the generation portfolio will experience dramatic changes in the near future. The uncertainty and variability of renewable energy and their sitting call for strategic and economic plans for expanding the transmission capacities. In this study, we develop a data-driven two-stage stochastic transmission expansion planning with uncertainties. In the proposed approach, purely by learning from the historical data, we first construct a confidence set for the unknown distribution of the uncertain parameters. Then, we develop a two-stage data-driven transmission expansion framework, by considering the worst-case distribution within the constructed confidence set, so as to provide a reliable while economic transmission planning decision. Furthermore, to tackle the model complexity, we propose a decomposition framework embedded with Benders' and Column-and-Constraint generation methods. We implement our approach on 6-bus and 118-bus systems to test its effectiveness. Finally, we show as the amount of historical data grows, the conservativeness of the model decreases.

1 January 2011 in Journal of Manufacturing Systems
Verified
Journal Article
Closed access
ABA. Bagheri
A. Bagheri
MZMostafa Zandieh
Mostafa Zandieh

26 August 2009 in International Journal of Production Research
Verified
Journal Article
Closed access
MAMaghsoud Amiri
Maghsoud Amiri
MZMostafa Zandieh
Mostafa Zandieh
MYM. Yazdani
M. Yazdani
ABA. Bagheri
A. Bagheri
The flexible job-shop scheduling problem (FJSP) is a generalisation of the classical job-shop scheduling problem which allows an operation of each job to be executed by any machine out of a set of available machines. FJSP consists of two sub-problems which are assigning each operation to a machine out of a set of capable machines (routing sub-problem) and sequencing the assigned operations on the machines (sequencing sub-problem). This paper proposes a variable neighbourhood search (VNS) algorithm that solves the FJSP to minimise makespan. In the process of the presented algorithm, various neighbourhood structures related to assignment and sequencing problems are used for generating neighbouring solutions. To compare our algorithm with previous ones, an extensive computational study on 181 benchmark problems has been conducted. The results obtained from the presented algorithm are quite comparable to those obtained by the best-known algorithms for FJSP.

19 April 2019 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
ABAli Bagheri
Ali Bagheri
CZChaoyue Zhao
Chaoyue Zhao
Increasing the complexity of power transmission networks has led power systems to be more vulnerable to cascading failures. Thus, hardening and reliability assessment of such complex networks have become a must. In addition, the commonly used $N-1$ security criterion does not guarantee the reliability of the system against possible cascading failures. In this paper, given a hardening plan, we develop two models to evaluate the reliability of the power transmission system under $N-k$ security criterion. In the first model, we quantify the probability of no load-shedding in the system to assess the possibility of load curtailment. Then, to have a better insight of the amount of load-shed in the second model, we use the conditional value-at-risk as a risk measure to evaluate the reliability of the system. To perform reliability assessment, the information of contingency probabilities is required. However, such probability information is usually unknown and cannot be estimated precisely. Therefore, in this paper, we assume the probability of contingencies as unknown and ambiguous. Then, we construct an ambiguity set for the unknown probability distribution of contingencies. Our approaches are robust because they analyze the reliability of the transmission system with respect to the worst-case distribution in the ambiguity set. We formulate both models as bilevel programs and solve them using the Bender’s decomposition technique. Finally, we conduct numerical experiments on 6-bus and IEEE 118-bus test systems to show the effectiveness of the proposed approaches.