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