![](/images/graphics-bg.png)
An Improved Lagrangian Relaxation Algorithm for the Robust Generation Self-Scheduling Problem
المؤلفون المشاركون
Gong, Hua
Tang, Zhenhao
Che, Ping
Zhao, Xiaoli
المصدر
Mathematical Problems in Engineering
العدد
المجلد 2018، العدد 2018 (31 ديسمبر/كانون الأول 2018)، ص ص. 1-12، 12ص.
الناشر
Hindawi Publishing Corporation
تاريخ النشر
2018-07-22
دولة النشر
مصر
عدد الصفحات
12
التخصصات الرئيسية
الملخص EN
The robust generation self-scheduling problem under electricity price uncertainty is usually solved by the commercial solver, which is limited in computation time and memory requirement.
This paper proposes an improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem where the quadratic fuel cost and the time-dependent exponential startup cost are considered.
By using the optimal duality theory, the robust generation self-scheduling problem, which has a max-min structure, is reformulated as a minimization mixed integer nonlinear programming (MINLP) problem.
Upon the reformulation, the Lagrangian relaxation algorithm is developed.
To obtain a solvable relaxed problem, the variable splitting technique is introduced before the relaxation.
The obtained relaxed problem is decomposed into a linear programming-type subproblem and multiple single-unit subproblems.
Each single-unit subproblem is solved optimally by a two-stage backward dynamic programming procedure.
The special cases of the problem are discussed and a two-stage algorithm is proposed.
The proposed algorithms are tested on test cases of different sizes and the numerical results show that the algorithms can find near-optimal solutions in a reasonable time.
نمط استشهاد جمعية علماء النفس الأمريكية (APA)
Che, Ping& Tang, Zhenhao& Gong, Hua& Zhao, Xiaoli. 2018. An Improved Lagrangian Relaxation Algorithm for the Robust Generation Self-Scheduling Problem. Mathematical Problems in Engineering،Vol. 2018, no. 2018, pp.1-12.
https://search.emarefa.net/detail/BIM-1208327
نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)
Che, Ping…[et al.]. An Improved Lagrangian Relaxation Algorithm for the Robust Generation Self-Scheduling Problem. Mathematical Problems in Engineering No. 2018 (2018), pp.1-12.
https://search.emarefa.net/detail/BIM-1208327
نمط استشهاد الجمعية الطبية الأمريكية (AMA)
Che, Ping& Tang, Zhenhao& Gong, Hua& Zhao, Xiaoli. An Improved Lagrangian Relaxation Algorithm for the Robust Generation Self-Scheduling Problem. Mathematical Problems in Engineering. 2018. Vol. 2018, no. 2018, pp.1-12.
https://search.emarefa.net/detail/BIM-1208327
نوع البيانات
مقالات
لغة النص
الإنجليزية
الملاحظات
Includes bibliographical references
رقم السجل
BIM-1208327
قاعدة معامل التأثير والاستشهادات المرجعية العربي "ارسيف Arcif"
أضخم قاعدة بيانات عربية للاستشهادات المرجعية للمجلات العلمية المحكمة الصادرة في العالم العربي
![](/images/ebook-kashef.png)
تقوم هذه الخدمة بالتحقق من التشابه أو الانتحال في الأبحاث والمقالات العلمية والأطروحات الجامعية والكتب والأبحاث باللغة العربية، وتحديد درجة التشابه أو أصالة الأعمال البحثية وحماية ملكيتها الفكرية. تعرف اكثر
![](/images/kashef-image.png)