Calculating Matrix Reliability for Networks Using D-Spectrum
Publish place: 16th Iran International Industrial Engineering Conference
Publish Year: 1398
نوع سند: مقاله کنفرانسی
زبان: English
View: 425
This Paper With 12 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
IIEC16_160
تاریخ نمایه سازی: 12 مرداد 1399
Abstract:
The number of terminal nodes is important in network reliability calculations. Networks are often classified as 2-terminal nodes, k-terminal nodes and all terminal nodes. Different approaches have been advanced in the literature to calculate network reliability, mainly to solve 2-terminal node networks. Such approaches are based on point-wise calculation of network reliability, i.e., a single value is eventually attached to a network to represent its reliability. In this paper, we propose a new approach by which network reliability is represented in matrix form and calculated using D-spectrum method for k-terminal node and all-terminal node networks.
Keywords:
Authors
Mohammad Ali Saniee Monfared
Associate professor, Department of Industrial Engineering, Alzahra University, Tehran, Iran;
Mojdeh Younesi
PhD Candidate in Industrial Engineering, Alzahra University, Tehran, Iran;
Zohreh Shakeri Kebria
PhD Candidate in Industrial Engineering, Alzahra University, Tehran, Iran;