Abstract
The problem of determining the number of multi-type protection devices and their locations on electrical supply tree networks with subtree dependency is investigated. The aim is to reduce the amount of inconvenience caused to customers that are affected by any given fault on the networks. An appropriate implementation of tabu search is proposed. We exploit a variable neighborhood and a soft aspiration level, and we embed a data structure and reduction tests into the search to speed up the process. Computational tests are performed on randomly generated electrical tree networks varying in size and branch complexity with encouraging results.
| Original language | English |
|---|---|
| Pages (from-to) | 81-98 |
| Number of pages | 18 |
| Journal | J. Combinatorial Optimization |
| Volume | 6 |
| Issue number | (1) |
| DOIs | |
| Publication status | Published - 1 Jan 2002 |
Fingerprint
Dive into the research topics of 'A tabu search heuristic for the location of multi type protection devices on electrical tree networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver