A simulated annealing algorithm for unit commitment
This paper presents a simulated annealing algorithm (SAA) to solve the unit commitment problem (UCP). New rules for randomly generating feasible solutions are introduced. The problem has two subproblems: a combinatorial optimization problem; and a nonlinear programming problem. The former is solved...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | article |
| منشور في: |
1998
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/14357/1/14357_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14357/2/14357_2.doc |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513393735499776 |
|---|---|
| author | Mantawy, A.H. |
| author2 | Abdel-Magid, Y.L. Selim, S.Z. unknown |
| author2_role | author author author |
| author_facet | Mantawy, A.H. Abdel-Magid, Y.L. Selim, S.Z. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Mantawy, A.H. Abdel-Magid, Y.L. Selim, S.Z. unknown |
| dc.date.none.fl_str_mv | 1998-02 2020 |
| dc.format.none.fl_str_mv | application/pdf application/msword |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14357/1/14357_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14357/2/14357_2.doc (1998) A simulated annealing algorithm for unit commitment. Power Systems, IEEE Transactions on, 13. |
| dc.language.none.fl_str_mv | en en |
| dc.publisher.none.fl_str_mv | IEEE |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14357/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | A simulated annealing algorithm for unit commitment |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | This paper presents a simulated annealing algorithm (SAA) to solve the unit commitment problem (UCP). New rules for randomly generating feasible solutions are introduced. The problem has two subproblems: a combinatorial optimization problem; and a nonlinear programming problem. The former is solved using the SAA while the latter problem is solved via a quadratic programming routine. Numerical results showed an improvement in the solutions costs compared to previously obtained results |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_f5a7e8cafd7236e6b2a265d1237a859e |
| identifier_str_mv | (1998) A simulated annealing algorithm for unit commitment. Power Systems, IEEE Transactions on, 13. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::14357 |
| publishDate | 1998 |
| publisher.none.fl_str_mv | IEEE |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A simulated annealing algorithm for unit commitmentMantawy, A.H.Abdel-Magid, Y.L.Selim, S.Z.unknownComputerThis paper presents a simulated annealing algorithm (SAA) to solve the unit commitment problem (UCP). New rules for randomly generating feasible solutions are introduced. The problem has two subproblems: a combinatorial optimization problem; and a nonlinear programming problem. The former is solved using the SAA while the latter problem is solved via a quadratic programming routine. Numerical results showed an improvement in the solutions costs compared to previously obtained resultsIEEE1998-022020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/mswordhttps://eprints.kfupm.edu.sa/id/eprint/14357/1/14357_1.pdfhttps://eprints.kfupm.edu.sa/id/eprint/14357/2/14357_2.doc (1998) A simulated annealing algorithm for unit commitment. Power Systems, IEEE Transactions on, 13. enenhttps://eprints.kfupm.edu.sa/id/eprint/14357/info:eu-repo/semantics/openAccessoai::143572019-11-01T14:05:28Z |
| spellingShingle | A simulated annealing algorithm for unit commitment Mantawy, A.H. Computer |
| status_str | publishedVersion |
| title | A simulated annealing algorithm for unit commitment |
| title_full | A simulated annealing algorithm for unit commitment |
| title_fullStr | A simulated annealing algorithm for unit commitment |
| title_full_unstemmed | A simulated annealing algorithm for unit commitment |
| title_short | A simulated annealing algorithm for unit commitment |
| title_sort | A simulated annealing algorithm for unit commitment |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/14357/1/14357_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14357/2/14357_2.doc |