Majid Forghani-elahabad

Prof. Dr. Majid Forghani-elahabad

Federal University of ABC (UFABC)
orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
28 January 2014 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
Majid Forghani-elahabadMajid Forghani-elahabad
Majid Forghani-elahabad
NMNezam Mahdavi-Amiri
Nezam Mahdavi-Amiri
There are several exact or approximating approaches that apply d-MinCuts ( d-MCs) to compute multistate two-terminal reliability. Searching for and determining d-MCs in a stochastic-flow network are important for computing system reliability. Here, by investigating the existing methods and using our new results, an efficient algorithm is proposed to find all the d-MCs. The complexity of the new algorithm illustrates its efficiency in comparison with other existing algorithms. Two examples are worked out to show how the algorithm determines all the d-MCs in a network flow with unreliable nodes, and in a network flow of moderate size. Moreover, using the d-MCs found by the algorithm, the system reliability of a sample network is computed by the inclusion-exclusion method. Finally, to illustrate the efficacy of using the new presented techniques, computational results on random test problems are provided in the sense of the performance profile introduced by Dolan and Moré.

4 May 2018 in IISE Transactions
Verified
Journal Article
Closed access
Majid Forghani-elahabadMajid Forghani-elahabad
Majid Forghani-elahabad
NKNelson Kagan
Nelson Kagan
In a stochastic-flow network with budget constraint, the network reliability for level (d, b), i.e., R(d,b), where d is a given demand value and b is a budget limit, is the probability of transmitting at least d units of flow from a source node to a sink node within the budget of b. The problem of evaluating R(d,b) in terms of Minimal Paths (MPs), which is called the (d, b)-MP problem, has been of considerable interest in the recent decades. Here, presenting some new results, an improved algorithm is proposed for this problem. Some numerical comparisons between our MATLAB implementation of the algorithm proposed in this article and a recently proposed one are made. This way, computational comparative results on some benchmarks and thousands of random test problems are provided in the sense of performance profile introduced by Dolan and Moré. Moreover, complexity results are provided. The complexity and numerical results show the efficiency of our algorithm in comparison with the others. Furthermore, we state how to use the output of the algorithm in order to assess the system reliability. Ultimately, based on the main proposed algorithm, a simple algorithm is stated to evaluate the reliability of some smart grid communication networks.

1 November 2019 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
Majid Forghani-elahabadMajid Forghani-elahabad
Majid Forghani-elahabad
NKNelson Kagan
Nelson Kagan
NMNezam Mahdavi-Amiri
Nezam Mahdavi-Amiri

1 February 2016 in Applied Mathematical Modelling
Verified
Journal Article
Closed access
Majid Forghani-elahabadMajid Forghani-elahabad
Majid Forghani-elahabad
NMNezam Mahdavi-Amiri
Nezam Mahdavi-Amiri

12 February 2022 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
Majid Forghani-elahabadMajid Forghani-elahabad
Majid Forghani-elahabad
WYWei-Chang Yeh
Wei-Chang Yeh

1 April 2019 in Journal of Computational Science
Verified
Journal Article
Closed access
Majid Forghani-elahabadMajid Forghani-elahabad
Majid Forghani-elahabad
NKNelson Kagan
Nelson Kagan