A new simulated annealing-based tabu search algorithm for unitcommitment
We propose a new hybrid algorithm for solving the unit commitment problem (UCP). The algorithm integrates the use of simulated annealing (SA) and tabu search (TS) for solving the UCP. The algorithm includes a step to find an initial control parameter, at which virtually all trial solutions are accep...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | article |
| منشور في: |
1997
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/14476/1/14476_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14476/2/14476_2.doc |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513393798414336 |
|---|---|
| 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 | 1997-10 2020 |
| dc.format.none.fl_str_mv | application/pdf application/msword |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14476/1/14476_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14476/2/14476_2.doc (1997) A new simulated annealing-based tabu search algorithm for unitcommitment. Systems, Man, and Cybernetics, 1997. 'Computational Cybernetics and Simulation'., 1997 IEEE International conference, 3. |
| 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/14476/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | A new simulated annealing-based tabu search algorithm for unitcommitment |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | We propose a new hybrid algorithm for solving the unit commitment problem (UCP). The algorithm integrates the use of simulated annealing (SA) and tabu search (TS) for solving the UCP. The algorithm includes a step to find an initial control parameter, at which virtually all trial solutions are accepted. It uses a polynomial-time cooling schedule that is advocated in the SA literature. Furthermore, the short-term memory procedures of the TS method are embedded in the SA test to prevent cycling of accepted solutions. Numerical examples from the literature are solved. Results showed an improvement in the solutions costs compared to previously obtained results |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_acccd8c053e2e0147d9299786ff3b534 |
| identifier_str_mv | (1997) A new simulated annealing-based tabu search algorithm for unitcommitment. Systems, Man, and Cybernetics, 1997. 'Computational Cybernetics and Simulation'., 1997 IEEE International conference, 3. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::14476 |
| publishDate | 1997 |
| publisher.none.fl_str_mv | IEEE |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A new simulated annealing-based tabu search algorithm for unitcommitmentMantawy, A.H.Abdel-Magid, Y.L.Selim, S.Z.unknownComputerWe propose a new hybrid algorithm for solving the unit commitment problem (UCP). The algorithm integrates the use of simulated annealing (SA) and tabu search (TS) for solving the UCP. The algorithm includes a step to find an initial control parameter, at which virtually all trial solutions are accepted. It uses a polynomial-time cooling schedule that is advocated in the SA literature. Furthermore, the short-term memory procedures of the TS method are embedded in the SA test to prevent cycling of accepted solutions. Numerical examples from the literature are solved. Results showed an improvement in the solutions costs compared to previously obtained resultsIEEE1997-102020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/mswordhttps://eprints.kfupm.edu.sa/id/eprint/14476/1/14476_1.pdfhttps://eprints.kfupm.edu.sa/id/eprint/14476/2/14476_2.doc (1997) A new simulated annealing-based tabu search algorithm for unitcommitment. Systems, Man, and Cybernetics, 1997. 'Computational Cybernetics and Simulation'., 1997 IEEE International conference, 3. enenhttps://eprints.kfupm.edu.sa/id/eprint/14476/info:eu-repo/semantics/openAccessoai::144762019-11-01T14:05:58Z |
| spellingShingle | A new simulated annealing-based tabu search algorithm for unitcommitment Mantawy, A.H. Computer |
| status_str | publishedVersion |
| title | A new simulated annealing-based tabu search algorithm for unitcommitment |
| title_full | A new simulated annealing-based tabu search algorithm for unitcommitment |
| title_fullStr | A new simulated annealing-based tabu search algorithm for unitcommitment |
| title_full_unstemmed | A new simulated annealing-based tabu search algorithm for unitcommitment |
| title_short | A new simulated annealing-based tabu search algorithm for unitcommitment |
| title_sort | A new simulated annealing-based tabu search algorithm for unitcommitment |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/14476/1/14476_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14476/2/14476_2.doc |