Calculating Matrix Reliability for Networks Using D-Spectrum
محل انتشار: شانزدهمین کنفرانس بین المللی مهندسی صنایع
سال انتشار: 1398
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 536
فایل این مقاله در 12 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
IIEC16_160
تاریخ نمایه سازی: 12 مرداد 1399
چکیده مقاله:
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.
کلیدواژه ها:
نویسندگان
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;