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 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | 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 |
|---|