A Tabu Search Heuristic for the Location of Multi-Type Protection Devices on Electrical Supply Tree Networks
J.C. James and
S. Salhi
Additional contact information
J.C. James: University of Birmingham
S. Salhi: University of Birmingham
Journal of Combinatorial Optimization, 2002, vol. 6, issue 1, No 6, 98 pages
Abstract:
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.
Keywords: location; electrical trees; tabu search (search for similar items in EconPapers)
Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1023/A:1013322309009 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:6:y:2002:i:1:d:10.1023_a:1013322309009
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1023/A:1013322309009
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().