جلد 28، شماره 2 - ( 3-1396 )                   جلد 28 شماره 2 صفحات 163-174 | برگشت به فهرست نسخه ها



DOI: 10.22068/ijiepr.28.2.163

XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Hasani A. Two-stage Stochastic Programing Based on the Accelerated Benders Decomposition for Designing Power Network Design under Uncertainty. IJIEPR. 2017; 28 (2) :163-174
URL: http://ijiepr.iust.ac.ir/article-1-768-fa.html
Two-stage Stochastic Programing Based on the Accelerated Benders Decomposition for Designing Power Network Design under Uncertainty. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1396; 28 (2) :163-174

URL: http://ijiepr.iust.ac.ir/article-1-768-fa.html


چکیده:   (330 مشاهده)

In this paper, a comprehensive mathematical model for designing an electric power supply chain network via considering preventive maintenance under risk of network failures is proposed. The risk of capacity disruption of the distribution network is handled via using a two-stage stochastic programming as a framework for modeling the optimization problem. An applied method of planning for the network design and power generation and transmission system via considering failures scenarios, as well as network preventive maintenance schedule, is presented. The aim of the proposed model is to minimize the expected total cost consisting of power plants set-up, power generation and the maintenance activities. The proposed mathematical model is solved by an efficient new accelerated Benders decomposition algorithm. The proposed accelerated Benders decomposition algorithm uses an efficient acceleration mechanism based on the priority method which uses a heuristic algorithm to efficiently cope with computational complexities. A large number of considered scenarios are reduced via using a k-means clustering algorithm to decrease the computational effort for solving the proposed two-stage stochastic programming model. The efficiencies of the proposed model and solution algorithm are examined using data from the Tehran Regional Electric Company. The obtained results indicate that solutions of the stochastic programming are more robust than the obtained solutions provided by a deterministic model.

متن کامل [PDF 1047 kb]   (138 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: زنجیره تامین و لجستیک
دریافت: ۱۳۹۶/۳/۱۷ | پذیرش: ۱۳۹۶/۳/۲۰ | انتشار: ۱۳۹۶/۴/۲۴

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
کد امنیتی را در کادر بنویسید

کلیه حقوق این وب سایت متعلق به نشریه بین المللی مهندسی صنایع و تحقیقات تولید می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb