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

Hideaki Tanaka, H. Magori, T. Niimura, R. Yokoyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationIEEE PES General Meeting, PES 2010
DOIs
Publication statusPublished - 2010
EventIEEE PES General Meeting, PES 2010 - Minneapolis, MN
Duration: 2010 Jul 252010 Jul 29

Other

OtherIEEE PES General Meeting, PES 2010
CityMinneapolis, MN
Period10/7/2510/7/29

Fingerprint

Branch and bound method
Scheduling
Costs
Combinatorial optimization
Ceilings

Keywords

  • Branch-and-bound method
  • Combinatorial optimization
  • Enumerative method
  • Obsolete circuit breakers
  • Primary substation
  • Reliability

ASJC Scopus subject areas

  • Energy Engineering and Power Technology

Cite this

Tanaka, H., Magori, H., Niimura, T., & Yokoyama, R. (2010). Optimal replacement scheduling of obsolete substation equipment by branch & bound method. In IEEE PES General Meeting, PES 2010 [5589584] https://doi.org/10.1109/PES.2010.5589584

Optimal replacement scheduling of obsolete substation equipment by branch & bound method. / Tanaka, Hideaki; Magori, H.; Niimura, T.; Yokoyama, R.

IEEE PES General Meeting, PES 2010. 2010. 5589584.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tanaka, H, Magori, H, Niimura, T & Yokoyama, R 2010, Optimal replacement scheduling of obsolete substation equipment by branch & bound method. in IEEE PES General Meeting, PES 2010., 5589584, IEEE PES General Meeting, PES 2010, Minneapolis, MN, 10/7/25. https://doi.org/10.1109/PES.2010.5589584
Tanaka H, Magori H, Niimura T, Yokoyama R. Optimal replacement scheduling of obsolete substation equipment by branch & bound method. In IEEE PES General Meeting, PES 2010. 2010. 5589584 https://doi.org/10.1109/PES.2010.5589584
Tanaka, Hideaki ; Magori, H. ; Niimura, T. ; Yokoyama, R. / Optimal replacement scheduling of obsolete substation equipment by branch & bound method. IEEE PES General Meeting, PES 2010. 2010.
@inproceedings{78477e518cd642219dac4d82b5866808,
title = "Optimal replacement scheduling of obsolete substation equipment by branch & bound method",
abstract = "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.",
keywords = "Branch-and-bound method, Combinatorial optimization, Enumerative method, Obsolete circuit breakers, Primary substation, Reliability",
author = "Hideaki Tanaka and H. Magori and T. Niimura and R. Yokoyama",
year = "2010",
doi = "10.1109/PES.2010.5589584",
language = "English",
isbn = "9781424483570",
booktitle = "IEEE PES General Meeting, PES 2010",

}

TY - GEN

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

AU - Tanaka, Hideaki

AU - Magori, H.

AU - Niimura, T.

AU - Yokoyama, R.

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Branch-and-bound method

KW - Combinatorial optimization

KW - Enumerative method

KW - Obsolete circuit breakers

KW - Primary substation

KW - Reliability

UR - http://www.scopus.com/inward/record.url?scp=78649554563&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78649554563&partnerID=8YFLogxK

U2 - 10.1109/PES.2010.5589584

DO - 10.1109/PES.2010.5589584

M3 - Conference contribution

AN - SCOPUS:78649554563

SN - 9781424483570

BT - IEEE PES General Meeting, PES 2010

ER -