Optimal replacement scheduling of obsolete substation equipment by branch & bound method

In this paper, the authors propose an algorithm using branch and bound method to search an optimal replacement scheduling of obsolete equipment in aged primary substations. The developed tool can efficiently find an optimal solution from huge combinations of replacement schedules. The objective func...

Full description

Saved in:
Bibliographic Details
Published inIEEE PES General Meeting pp. 1 - 6
Main Authors Tanaka, H, Magori, H, Niimura, T, Yokoyama, R
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2010
Subjects
Branch-and-Bound method
Circuit breakers
Combinatorial optimization
Enumerative method
Integrated circuit reliability
Maintenance engineering
Obsolete circuit breakers
Primary substation
Reliability
Search problems
Substations
Upper bound
Online AccessGet full text

Cover

More Information
Summary:In this paper, the authors propose an algorithm using branch and bound method to search an optimal replacement scheduling of obsolete equipment in aged primary substations. The developed tool can efficiently find an optimal solution from huge combinations of replacement schedules. The objective function to be minimized is the net present value of the sum of operation and maintenance cost, replacement cost, and the reliability cost in case of CB failure for each substation during the specified time frame. To solve this problem under the constraints such as annual budget ceiling, number of replacement targets per annum, and replacement time frame for each substation, we apply the branch and bound method, which is well known as an efficient combinatorial optimization technique. The proposed algorithm is demonstrated using a small scale model (2 substations, 4-year time frame) to verify its effectiveness.
ISBN:1424465494
9781424465491
ISSN:1932-5517
DOI:10.1109/PES.2010.5589584