Unit commitment by tabu search
An application of the tabu search (TS) method to solve the unit commitment problem (UCP) is presented. The TS seeks to counter the danger of entrapment at a local optimum by incorporating a memory structure that forbids or penalises certain moves that would return to recently visited solutions. New...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | article |
| منشور في: |
1998
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/14580/1/14580_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14580/2/14580_2.doc |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513384159903744 |
|---|---|
| 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-01 2020 |
| dc.format.none.fl_str_mv | application/pdf application/msword |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14580/1/14580_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14580/2/14580_2.doc (1998) Unit commitment by tabu search. Generation, Transmission and Distribution, IEE Proceedings-, 145. |
| 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/14580/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | Unit commitment by tabu search |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | An application of the tabu search (TS) method to solve the unit commitment problem (UCP) is presented. The TS seeks to counter the danger of entrapment at a local optimum by incorporating a memory structure that forbids or penalises certain moves that would return to recently visited solutions. New rules for randomly generating feasible solutions for the UCP are introduced. The problem is divided into two subproblems: a combinatorial optimisation problem and a nonlinear programming problem. The former is solved using the tabu search algorithm (TSA) while the latter problem is solved via a quadratic programming routine. Numerical results show an improvement in the solution cost compared to previously obtained results |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_d7d7b98c1dcf056b497578f1191b70a2 |
| identifier_str_mv | (1998) Unit commitment by tabu search. Generation, Transmission and Distribution, IEE Proceedings-, 145. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::14580 |
| publishDate | 1998 |
| publisher.none.fl_str_mv | IEEE |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Unit commitment by tabu searchMantawy, A.H.Abdel-Magid, Y.L.Selim, S.Z.unknownComputerAn application of the tabu search (TS) method to solve the unit commitment problem (UCP) is presented. The TS seeks to counter the danger of entrapment at a local optimum by incorporating a memory structure that forbids or penalises certain moves that would return to recently visited solutions. New rules for randomly generating feasible solutions for the UCP are introduced. The problem is divided into two subproblems: a combinatorial optimisation problem and a nonlinear programming problem. The former is solved using the tabu search algorithm (TSA) while the latter problem is solved via a quadratic programming routine. Numerical results show an improvement in the solution cost compared to previously obtained resultsIEEE1998-012020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/mswordhttps://eprints.kfupm.edu.sa/id/eprint/14580/1/14580_1.pdfhttps://eprints.kfupm.edu.sa/id/eprint/14580/2/14580_2.doc (1998) Unit commitment by tabu search. Generation, Transmission and Distribution, IEE Proceedings-, 145. enenhttps://eprints.kfupm.edu.sa/id/eprint/14580/info:eu-repo/semantics/openAccessoai::145802019-11-01T14:06:29Z |
| spellingShingle | Unit commitment by tabu search Mantawy, A.H. Computer |
| status_str | publishedVersion |
| title | Unit commitment by tabu search |
| title_full | Unit commitment by tabu search |
| title_fullStr | Unit commitment by tabu search |
| title_full_unstemmed | Unit commitment by tabu search |
| title_short | Unit commitment by tabu search |
| title_sort | Unit commitment by tabu search |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/14580/1/14580_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14580/2/14580_2.doc |