

This paper presents an approach for determining the best multi-period reliability improvement plan in urban distribution networks by cable replacement and rejuvenation considering network expansions/changes in the planning period. It determines the number and locations of cables in the network that need to be replaced or rejuvenated in each year of the considered planning period to fulfill a decision-maker's goal. The goal considered in this paper is to achieve the desired balance between the improvement of reliability indices (SAIFI, SAIDI, ASIDI) and the costs of replacement and rejuvenation, considering budgetary limitations. This goal is achieved by applying the proposed multi-criteria mixed-integer linear programming (MILP) model, which determines a set of noninferior solutions (replacement and rejuvenation plans) in each of the considered periods. These plans are then used within the proposed multi-criteria dynamic programming (MCDP) algorithm to generate a set of multi-period plans and determine the best multi-period cable replacement and rejuvenation plan. The comparison (ranking) of plans within the proposed MCDP is performed using a multiple-criteria decision making technique for order preference by similarity to ideal solution (TOPSIS). This technique enables the consideration of different preferences of the decision maker regarding the levels of improvement of the reliability indices in the network. © 2023 Elsevier Ltd
| Engineering controlled terms: | Budget controlDynamic programmingEndocrinologyGeographical distributionInteger programmingReliabilityUnderground cables |
|---|---|
| Engineering uncontrolled terms | Integer Linear ProgrammingMixed integer linearMixed integer linear programmingMulti-criteriaMulti-CriterionMulti-periodRejuvenationReliability improvementReplacementUrban distribution networks |
| Engineering main heading: | Decision making |
Kovački, N.V.; University of Novi Sad, Faculty of Technical Science, Trg Dositeja Obradovica 6, Novi Sad, Serbia;
© Copyright 2023 Elsevier B.V., All rights reserved.