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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
1997
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14476/1/14476_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14476/2/14476_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|