Next Article in Journal
Smart Energy Strategy for AC Microgrids to Enhance Economic Performance in Grid-Connected and Standalone Operations: A Gray Wolf Optimizer Approach
Previous Article in Journal
A Novel App-Based Mobile Health Intervention for Improving Prevention Behaviors and Cardiovascular Disease Knowledge
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Mixed-Integer Convex Optimization Framework for Cost-Effective Conductor Selection in Radial Distribution Networks While Considering Load and Renewable Variations

by
Oscar Danilo Montoya
1,*,
Oscar David Florez-Cediel
2,
Luis Fernando Grisales-Noreña
3,
Walter Gil-González
4 and
Diego Armando Giral-Ramírez
5
1
Grupo de Compatibilidad e Interferencia Electromagnética, Facultad de Ingeniería, Universidad Distrital Francisco José de Caldas, Bogotá 110231, Colombia
2
Proyecto Curricular de Ingeniería Electrónica, Facultad de Ingeniería, Universidad Distrital Francisco José de Caldas, Bogotá 110231, Colombia
3
Grupo de Investigación en Alta Tensión-GRALTA, Escuela de Ingeniería Eléctrica y Electrónica, Universidad del Valle, Cali 760015, Colombia
4
Department of Electrical Engineering, Universidad Tecnológica de Pereira, Pereira 660003, Colombia
5
Ingeniería Eléctrica, Facultad Tecnológica, Universidad Distrital Francisco José de Caldas, Bogotá 110231, Colombia
*
Author to whom correspondence should be addressed.
Submission received: 27 March 2025 / Revised: 5 May 2025 / Accepted: 26 May 2025 / Published: 3 June 2025
(This article belongs to the Section Computer Sciences, Mathematics and AI)

Abstract

:
The optimal selection of conductors (OCS) in radial distribution networks is a critical aspect of system planning, directly impacting both investment costs and energy losses. This paper proposed a mixed-integer convex (MI-Convex) optimization framework to solve the OCS problem under balanced operating conditions, integrating the costs of conductor investment and energy losses into a single convex objective. This formulation leveraged second-order conic constraints and was solved using a combination of branch-and-bound and interior-point methods. Numerical validations on standard 27-, 33-, and 85-bus test systems confirmed the effectiveness of the proposal. In the 27-bus grid, the MI-Convex approach achieved a total cost of $550,680.25, outperforming or matching the best results reported by state-of-the-art metaheuristic algorithms, including the vortex search algorithm (VSA), Newton’s metaheuristic algorithm (NMA), the generalized normal distribution optimizer (GNDO), and the tabu search algorithm (TSA). The MI-Convex method demonstrated consistent and repeatable results, in contrast to the variability observed in heuristic techniques. Further analyses considering three-period and daily load profiles led to cost reductions of up to 27.6%, and incorporating distributed renewable generation into the 85-bus system achieved a total cost of $705,197.06—approximately 22.97% lower than under peak-load planning. Moreover, the methodology proved computationally efficient, requiring only 1.84 s for the 27-bus and 12.27 s for the peak scenario of the 85-bus. These results demonstrate the superiority of the MI-Convex approach in achieving globally optimal, reproducible, and computationally tractable solutions for cost-effective conductor selection.

1. Introduction

The optimal design of electrical distribution systems is a key challenge in ensuring an adequate operation that features high energy efficiency and reduced power losses [1]. In this context, the proper selection of conductors for the distribution lines plays a fundamental role, as it has a direct impact on initial investment, power losses, voltage regulation, and load capacity. Hence, in these systems, the selected conductor size must balance costs, voltage regulation, and operational efficiency. To address this problem, optimization models are required which can find efficient and technically and economically feasible solutions [2].
On the other hand, the growing demand for electricity and the integration (optimal placement and sizing) of various systems and devices into distribution networks have intensified the need for optimizing the electrical infrastructure [3]. Among the most commonly integrated systems are distributed generation sources, including wind and photovoltaic generators [4,5,6]. Additionally, energy storage systems have been employed to enhance the operational performance of distribution networks [7]. Devices for reactive power compensation, e.g., distribution static VAR compensators [8], thyristor-controlled series capacitors [9], and other similar technologies [10], are also frequently integrated. The incorporation of these systems underscores the fact that improper conductor sizing can result in excessive power losses, line overloads, and increased operating costs.
Although there are traditional methodologies for conductor selection, many of them rely on heuristic or non-convex optimization approaches, which can lead to suboptimal or computationally inefficient solutions [11]. Various approaches have been proposed in the literature to address this problem. For instance, methods based on mixed-integer linear programming (MILP) have been explored to minimize costs and power losses, although their application is limited by the non-convexity of the problem and its computational complexity. In [11], a MILP model was proposed to solve the conductor size selection and reconductoring problems in radial distribution systems. This model represents the steady-state operation of the system using linear expressions, ensuring optimal convergence through existing optimization solvers. Additionally, a heuristic approach was employed alongside the MILP model to generate a Pareto front while considering two objective functions. The effectiveness of the proposed methodology was demonstrated through simulations on one test system and two real distribution networks, highlighting its accuracy and computational efficiency.
Other works have addressed this problem using heuristic techniques, which, although they can provide acceptable solutions, do not guarantee global optimality. For example, in [12], a sine-cosine optimization algorithm (SCA) was developed for the optimal selection of conductors in radial distribution networks. In addition, the authors of [12] utilized a database of 20 conductor types taken from actual manufacturer data to ensure practical applicability. The proposed approach was tested on a real Egyptian distribution system, demonstrating its effectiveness in minimizing power losses while observing system constraints. The results also validated the method’s ability to handle high annual load growth over a ten-year period.
A hybrid optimization approach was proposed in [13] to solve the optimal conductor size selection (CSS) problem in distribution networks with a high penetration of distributed generation (DG). This study employed an adaptive genetic algorithm (AGA) as the primary optimization strategy to determine the optimal conductor sizes while aiming to minimize the sum of life-cycle costs (LCC) and total energy procurement costs over the expected operation period. Additionally, an alternating current optimal power flow (AC-OPF) analysis was incorporated as a secondary optimization step to refine economic dispatch decisions. The proposed methodology was validated through simulations on modified IEEE 33- and 69-bus distribution systems, demonstrating its effectiveness in addressing CSS under increasing DG capacity.
In [14], a methodology was introduced to minimize power losses in unbalanced distribution systems through phase balancing. The problem was formulated as a mixed-integer nonlinear programming model and addressed using a discretely encoded vortex search algorithm (DVSA). Simulations conducted on IEEE 8-, 25-, and 37-node test systems validated the effectiveness of this approach, exhibiting a superior performance in comparison with the classical Chu & Beasley genetic algorithm (CBGA). Additionally, the proposed DVSA achieved optimal solutions within seconds, demonstrating its efficiency, reliability, and robustness. The computational implementation was carried out in MATLAB®, and all results were verified using the PowerFactory 2021 DIgSILENT© software GmbH Heinrich-Hertz-StraBe 9 72810 Gomaringen (Germany) to ensure the accuracy of the three-phase unbalanced power-flow method.
The authors of [15] tackled the phase-balancing problem in three-phase radial power grids using a master-slave optimization approach. The master stage employed an enhanced version of the CBGA, incorporating a multi-point mutation operator as well as solution generation based on a Gaussian normal distribution, as inspired by the exploration and exploitation mechanisms of the vortex search algorithm (VSA). This stage determined the phase configuration through integer encoding, while the slave stage utilized a three-phase power flow approach based on the successive approximations method to evaluate the daily costs of energy losses.
In [16], another master-slave optimization strategy was proposed to address conductor selection and phase balancing in electrical networks, which integrated the CBGA and the successive approximations methods for power flow analysis. This approach was tested on two distribution systems under different demand scenarios and compared against three metaheuristic algorithms. According to the results, the CBGA outperformed the other methods, achieving lower costs, faster processing times (11.766 s and 94.494 s), and minimal standard deviations (0.161% and 0.199%) for the 8- and 25-node test systems considered. These findings confirmed the efficiency and practicality of the proposed strategy for optimizing electrical distribution networks.
Although several metaheuristic and exact approaches such as MILP, the SCA, the AGA, and others have been proposed to address the optimal conductor selection (OCS) problem in distribution networks, they exhibit notable limitations. Specifically, metaheuristic techniques may achieve high-quality solutions, but they cannot ensure global optimality or reproducibility, and their performance often depends on carefully tuned parameters. These characteristics reduce their reliability and generalizability across different test systems. On the other hand, exact methods like MILP may sacrifice model accuracy by oversimplifying nonlinearities, especially under multi-period or nonlinear load conditions.
In this context, convex formulations emerge as a promising alternative for solving planning problems in distribution systems. They guarantee convergence to a globally optimal solution, ensure result reproducibility across multiple runs, and do not require algorithm-specific parameter tuning. These features make convex approaches highly attractive for practical deployment.
This work develops a novel mixed-integer convex (MI-Convex) optimization model for OCS in balanced radial distribution networks. The proposed formulation leverages quadratic and second-order cone relaxations to preserve the nonlinear characteristics of the system while ensuring convexity. The model integrates operational constraints, such as current carrying limits, voltage regulation margins, and the nodal power balance, and aims to minimize the total cost by simultaneously considering investment and long-term operating expenses. The effectiveness of this proposal was validated through tests on two benchmark networks, where it consistently outperformed state-of-the-art metaheuristic methods in terms of solution quality and computational efficiency.
Table 1 provides a comparative summary of the reviewed optimization techniques, their main limitations, and the advantages offered by the proposed MI-Convex methodology.
The remainder of this paper is organized as follows. Section 2 presents the mathematical formulation of the MI-Convex model for OCS. Furthermore, this section details the convex approximations and the solution method. Section 3 describes the test systems and scenarios considered for validation, and it discusses and analyzes the numerical results obtained. Finally, Section 4 outlines the main conclusions of this research and suggests directions for future work.

2. Methodology

OCS in radial distribution networks is among the most classical optimization problems in the field of distribution system planning an operation [18]. Its exact formulation corresponds to a mixed-integer nonlinear programming (MINLP) model that combines power flow variables in the continuous domain with integer variables representing the gauge selected for each distribution branch [17]. This research proposed a MI-Convex formulation with a quadratic structure to determine the set of conductors that must be selected for a radial distribution network operating under balanced load conditions. With the purpose of validating the effectiveness of the proposed solution, a classical power flow methodology was used to evaluate all the technical and operational constraints related to the power flow solution.

2.1. The MI-Convex Formulation

To formulate the MI-Convex approximation used to select the subset of conductors in a radial and balanced distribution network, the following assumptions were made:
Assumption 1.
Under normal operating conditions, an electrical distribution network must comply with all system constraints, especially with the voltage regulation bounds, which implies that all the voltages must be contained between V min and V max . In a per-unit representation, all voltage values should be close to 1.0 pu [19]. Considering these typical operating conditions, ideal voltages were assumed for all nodes.
Assumption 2.
Under ideal operating conditions (perfect voltage profiles), the active and reactive power flow is equivalent in magnitude to the real and imaginary parts of the current flowing through a particular distribution branch.
Considering these assumptions, the proposed MI-Convex approach for conductor selection in radial electrical distribution networks under balanced operating conditions is described below.

2.1.1. Objective Function

The main idea of OCS in distribution networks is to minimize the total equivalent investment and operating costs for a planning period, which is typically assumed to be one year [20]. The total investment expenses are associated with the cost per type of conductor, which is a function of the current-carrying capacity and the total length. Meanwhile, the total operating costs are associated with the expected costs of energy losses [21]. The objective function and its two components are defined from (1) to (3).
min z 3 = z 1 + z 2 ,
with
z 1 = 3 C k W h h H i N R l P l t 2 + Q l t 2 F t ,
z 2 = 3 l L c C C c x l c L l .
where z 1 represents the approximate cost of energy losses, calculated using Equation (2); z 2 quantifies the total investment made in conductors, as defined in Equation (3); z 3 defines the total economic objective function value, as shown in Equation (1); C kWh is a constant parameter associated with the average cost of a kilowatt-hour; R l is a semi-definite positive variable related to the resistance assigned to branch l; P l t and Q l t are the active and reactive power flows through branch l in period t, respectively; F t is a parameter associated with the total number of load duration periods in a single year; C c is a constant parameter related to the expected cost per kilometer of a conductor of gauge type c; x l c is a binary variable that defines which gauge is assigned to branch l; and L l is the total length of branch l in kilometers. Note that C , L , and T denote the sets containing all conductor gauges, distribution lines, and periods of analysis, respectively.

2.1.2. Problem Constraints

OCS in distribution networks involves a set of technical constraints which, in the proposed MI-Convex model, correspond to a simplification of the power balance equations by means of a reduced transportation model [22]. This set of constraints is presented below [23].
R l = c C R c x l c L l , l L
P k t g P k t d = β k l L A k l P l t , k N , t T
Q k t g Q k t d = β k l L A k l Q l t , k N , t T
c C x l c = 1 , l L
P l t 2 + Q l t 2 c C x l c I l c m a x 2 , k N , t T
P k t g 2 + Q k t g 2 S k g 2 , k N , t T
where R c corresponds to the resistive value associated with each available conductor gauge; P k t g and P k t d represent the active power generation and demand at bus k in period t, while Q k t g and Q k t d denote the same parameters with regard to reactive power; A k l is a component of the node-to-branch incidence matrix that relates node k to branch l; β k is a constant parameter that emulates a possible voltage drop at each node in the network, caused by its radial structure, assuming that the loads have lagging power factors; I l c max represents the maximum thermal limit associated with gauge type c; and S k g is the nominal power transfer capacity associated with the generator located at bus k. Note that N is the set containing all the nodes in the network, where N is the total number.
Regarding the definition and validation of the β k coefficients used in Equations (5) and (6), it should be clarified that this parameter is introduced to emulate the typical voltage drop behavior observed in radial distribution networks. The values of β k are recursively defined based on the topological structure of the feeder, i.e.,
β 1 = 1 , β m = β k Δ v N 1 , for each branch ( k , m )
where Δ v = 0.20 represents the expected voltage drop per line, expressed as a percentage. This formulation ensures a monotonic decrease in the values of β k along the radial path, thereby approximating voltage decay from the substation to the downstream nodes.
The set of constraints defined in Equations (4)–(9) ensures the physical, operational, and technical feasibility of the conductor selection problem for radial distribution networks. Here, Constraint (4) establishes the equivalent resistance R l of each branch based on the conductor type selected via the binary decision variable x l c , scaled by the branch length L l . This is crucial because the branch resistance directly affects the energy losses; omitting it would lead to incorrect losses estimation and suboptimal cost calculations. Constraints (5) and (6) enforce the active and reactive power balance at each node and time, incorporating the nodal-to-branch incidence relationship and a β k factor to capture the radial network’s behavior with approximate voltage drops. This ensures energy conservation and a realistic network operation; relaxing them would produce infeasible solutions that violate Kirchhoff’s laws. Constraint (7) states that exactly one conductor gauge must be assigned for each branch, a fundamental design rule to avoid ambiguity; omitting it would allow for unrealistic or undefined solutions. Inequality (8) ensures that the current in each branch does not exceed the thermal limit of the selected conductor, preventing overheating and potential network failure; relaxing this would compromise network safety and reliability. Lastly, Constraint (9) limits the apparent power of the generators to their rated capacities, ensuring operational feasibility and preventing equipment damage; its omission would imply unrealistic generator dispatch beyond physical ratings. Altogether, these constraints form a coherent model that captures both the economic and technical realities of radial distribution network planning under mixed-integer convex optimization.

2.1.3. Model Characterization

Within the MI-Convex optimization model described from (1) to (8), for each combination of binary variables (i.e., x l c ) the resulting nonlinear programming model belongs to the family of quadratic programming with linear constraints, since the objective function defined in (2) results in a convex squared function. In addition, the entire set of constraints defined from (4) to (7) includes linear equations for each binary variable combination. Finally, the Inequality Constraints (8) and (9) are second-order conic in nature, i.e., convex constraints.
This model has a very large solution space: for d conductor gauges available and b branches, the number of possible binary variable combinations grows exponentially, as defined in Equation (10) [14].
s = d b .
To contextualize the magnitude of the solution space, consider a distribution network with 27 nodes and eight available conductor types. Given its radial structure, the network consists of 26 branches, resulting in approximately 3.0223145 × 10 23 possible binary variable combinations. This demonstrates the large scale and high complexity of the solution space. Furthermore, for each combination, it is necessary to solve a quadratic-conic convex optimization model, further complicating the computational challenge.

2.2. Solution Strategy

Considering that, for each combination of binary variables, the resulting model belongs to the family of convex optimization [24], in this research, the branch-and-bound (B&B) method was implemented in combination with interior-point optimization (IPO) [25]. This was done with the tools available in the Julia software v1.11.5 (14 April 2025) for this type of problem. To assess the feasibility of the final solution provided by the aforementioned combination of methods, the power flow problem was solved for the distribution grids under analysis [26]. This evaluation procedure is depicted in Figure 1.
It is worth noting that the power flow plays an important role in determining the feasibility of OCS. In light of this, the successive approximations power flow method reported by authors of [27] was adopted, as it can be easily implemented in Julia, with the main advantage that convergence is ensured via the Banach fixed-point theorem [28].

3. Results and Discussion

The effectiveness of the proposed MI-Convex formulation to address the problem regarding OCS in radial distribution networks was validated in two test feeders composed of 27 and 33 nodes [17]. The main characteristics of these systems, as well as their numerical analysis and a discussion of the results obtained, are presented in this section.

3.1. Test Feeder Characterization

The validation of the proposed optimization methodology considered two medium-voltage distribution networks composed of 27 and 33 nodes. The electrical configuration of both test feeders is depicted in Figure 2 and Figure 3 [17].
The main characteristics of these test feeders are listed below:
  • The 27-bus grid operates using a line-to-ground voltage of 13 , 800 V at the substation terminals. The total active and reactive power per phase is 4131.5 kW and 2560.0 kvar , respectively.
  • The 33-bus grid operates using a line-to-ground voltage of 12 , 660 V at the substation terminals. The total active and reactive power per phase is 3715.0 kW and 2290.0 kvar , respectively.
  • The regulatory policies applicable to these feeders define a maximum voltage regulation bound of about ± 10 % .
The electrical parameters of these distribution networks are listed in Table 2 and Table 3.
In addition, the set of conductors available for installation in both distribution networks are listed in Table 4.

3.2. Numerical Validations, Analysis, and Discussion

The computational implementation was performed using Julia, version 1.9.2 [29], which was executed on a PC equipped with an AMD Ryzen 7 3700 processor (2.3 GHz) and 16.0 GB of RAM, running a 64-bit version of Microsoft Windows 10 Single Language. The proposed MI-Convex model was formulated and solved via the JuMP optimization framework [30], leveraging the Ipopt solver for nonlinear programming. Additionally, the HiGHS solver was integrated through the Juniper optimizer to efficiently handle the mixed-integer nature of the problem [31]. This computational setup ensured a robust and efficient solution of the optimization model.
In the numerical validations, the following procedures were implemented:
I
A comparative assessment against literature-reported results using metaheuristic optimization algorithms under peak load conditions.
II
An evaluation of various load curves in order to determine the expected load consumption in the selected conductors.

3.2.1. Peak Load Operating Scenarios

The proposed MI-Convex formulation was tested on the aforementioned 27- and 33-bus grids while considering recent literature reports that employed metaheuristic algorithms (the NMA, VSA, GNDO, and TSA) as their solution methodologies [17].
Table 5 presents a comparative analysis for the 27-bus grid that considers four different metaheuristics optimizers.
The numerical results in Table 5 allow stating that:
  • The total costs of all the plans for the grid vary from US$ 550,680.25 to US$ 561,418.40 for all the optimization methodologies, with the TSA and the proposed MI-Convex approach exhibiting the minimum values and the VSA reporting the maximum value. These results confirm the effectiveness of our proposal in obtaining excellent numerical results, which coincide with the minimum values reported in the specialized literature [17], i.e., they are equal to the solution reported by the TSA.
  • The total expected costs of energy losses ( z 1 ) exhibit an inverse relationship with the expected investment in conductors ( z 2 ), as observed in the solutions obtained using the VSA and the NMA. This correlation arises because higher investments in conductors lead to the selection of larger gauges, reducing the resistive effects and consequently lowering power losses. Conversely, lower investments result in smaller gauges, increasing the resistive effects and energy losses, as seen in the solutions provided by the GNDO, the TSA, and the MI-Convex method.
  • An assessment of the best solution approaches, namely the TSA and MI-Convex within the proposed solution methodology (see Figure 1), reveals that the minimum voltage profile in the 27-bus grid occurs at bus 10, with a voltage value of approximately 0.9745 p.u. This indicates a voltage regulation of about 2.5473% for the test feeder.
  • Regarding the expected branch loadability, under peak operating conditions, the distribution line connecting buses 1 and 2 experiences the highest current flow, with a magnitude of approximately 358.164 A. The conductor gauge assigned to this branch is No. 7 (see the first element in the MI-Convex row, the Gauges column), which has a thermal limit of about 600 A. This results in a loadability of approximately 59.6940% for this branch.
Considering this analysis in the 27-bus grid, the proposed MI-Convex and the TSA are the best optimization methods to determine the subset of gauges for all system branches. In both solutions, the costs of energy losses correspond to 41.2376% of the total planning costs, whereas the conductor investment expenses represent 58.7624%.
Table 6 presents a comparative analysis between the proposed MI-Convex approach and the TSA reported by the authors of [17].
These results show that:
  • The proposed MI-Convex approach improves upon the numerical results reported by the TSA in [17], achieving an additional reduction of approximately US$ 316.99 in the total objective function. Although this reduction may seem minimal, it confirms the effectiveness of the MI-Convex approach in solving the OCS problem. The key advantage of MI-Convex is its reliability, as it consistently ensures the same numerical solution in every evaluation—which is something that the TSA cannot guarantee.
  • The only difference between the TSA and MI-Convex lies in the conductor gauge assigned to the line between nodes 3 and 4 (i.e., line 3). The proposed MI-Convex approach selects gauge No. 7, whereas the TSA uses gauge No. 5. This variation results in a higher conductor investment cost for MI-Convex, totaling US$ 225,372.06, compared to the US$ 209,773.46 required by the TSA. However, as observed in the analysis of the 27-bus grid, higher investment costs lead to reduced power losses, effectively compensating for the increased expenditure and favoring the MI-Convex approach in terms of overall cost-effectiveness.
  • The final solution reached with MI-Convex reports its minimum voltage profile at bus 18, with a magnitude of about 0.9629 p.u., which implies that its voltage regulation under peak load conditions is about 3.7093%. This confirms the feasibility of the final solution and an adequate voltage regulation performance.
  • Regarding the loadability of all distribution branches for the 33-bus grid under peak load conditions, the maximum value occurs in the branch that connects nodes 4 and 5 (i.e., line 4), with a value of 70.0597%. This confirms the effectiveness of the proposed MI-Convex approach in providing an adequate and effective solution for the OCS problem.
The solution obtained with MI-Convex allocates 46.9206% of the total costs to energy losses, while the remaining 53.0794% corresponds to conductor investment costs. This demonstrates that, under peak load conditions, the optimal solution prioritizes investment in conductor gauges to effectively minimize the expected costs of energy losses.

3.2.2. Load Profile Evaluation

This subsection evaluates the effect of defining the subset of gauges to be installed along the distribution grid when analyzing different load profiles instead of the typical peak load operation scenario. Two cases were evaluated. The first case supposed that the expected load consumption could be divided into three main ranges, i.e., 1000, 6760, and 1000 h with power consumptions of 100%, 70%, and 40% of the peak load demand. The second case assumed a typical daily load curve composed of 24 periods in order to evaluate the effect of daily demand consumptions on the distribution network plan. These cases are listed in Table 7.
The numerical simulations in Table 8 enable a comparative analysis of the different expected load profiles in the 27-bus grid.
The results in Table 8 allow noting that:
  • Considering the load behavior has a significant impact on the final distribution system plan, as it directly influences the expected costs of energy losses. In the three-period case, the expected energy losses amount to US$ 183,788.84, representing a reduction of US$ 43,298.33 compared to the peak load scenario. This reduction leads to a decrease of approximately US$ 103,576.50 in conductor investment, as the set of gauges required is adjusted based on the expected energy losses. These variations in both components of the objective function result in a total benefit of US$ 146,874.83 compared to the peak load case.
  • The daily operation case shows a slight increase in investment costs, approximately US$ 6,857.25 higher than in the three-period case. This is because the costs of energy losses in the former amount to US$ 212,715.20, which is US$ 28,926.36 more than in the latter. Consequently, larger conductor gauges are selected to mitigate the impact of the squared current flow on the total energy losses calculations. Notably, the daily operating case achieves a cost reduction of approximately 20.17% compared to the peak load scenario, highlighting its effectiveness in optimizing operating expenses.
Table 9 presents a comparative analysis of the different expected load profiles in the 33-bus grid.
The numerical results in Table 9 indicate that:
  • The expected costs of energy losses in the three-period and daily operating cases are reduced by approximately 32.41% and 28.63%, respectively, in comparison the peak load scenario. As previously mentioned, this reduction can be attributed to variations in current flow across all distribution branches and to the selection of conductor gauges, which are optimized to effectively balance investment and operating costs.
  • The total cost of the distribution system plan is reduced by approximately US$ 117,045.88 and US$ 90,520.84 in the three-period and daily operation scenarios when compared to the peak load case. These reductions confirm that accurate modeling of the expected demand behavior plays a crucial role in determining the investment costs of conductor gauges. When combined with the projected power losses, this directly and significantly impacts the total cost of the distribution system plan.
The results presented in Table 8 and Table 9 highlight the significant impact of accurately modeling the expected daily load behavior on the annual costs of the distribution system plan, particularly with regard to conductor gauge selection. This effect stems from the strong dependence of total energy losses costs on the projected behavior of constant power loads. Consequently, the selection of conductor gauges across the distribution network is determined by the need to balance investment costs while effectively reducing the expected energy losses.
Additionally, it is important to highlight that, while the peak load operating scenario represents unrealistic conditions for a distribution network, it serves as a reference to determine the upper bound for the costs of conductor investment and energy losses. Conversely, the three-period case reports the lowest costs for these factors. However, the most realistic scenario, i.e., the daily operating period, provides an optimal balance between the expected costs of energy losses and the total conductor investment, making it the most efficient approach for determining the appropriate subset of gauges to be installed. This methodology allows distribution companies to strategically allocate budgets based on projected operating costs, ensuring both economic efficiency and reliable network performance.
As for the voltage profiles, in all cases evaluated for the 27- and 33-bus grids, the minimum voltages remain within acceptable operational limits, exceeding 0.90 p.u. even under the three-period and daily load variation scenarios. Although slight reductions in voltage levels are noted when moving from peak load to more realistic load conditions, the final voltage profiles confirm that the selected conductor sets ensure an adequate voltage regulation across the network, guaranteeing the quality and reliability of the service.

3.3. Large-Scale Distribution Network

To validate the effectiveness of the proposed optimization methodology in managing large-scale distribution networks under daily demand fluctuations and renewable energy integration, this subsection presents the numerical results obtained using the balanced version of a 85-bus system. Figure 4 illustrates the single-line diagram of this feeder [32]. It should be highlighted that the PV generator is installed at node 34, providing a nominal generation capacity of approximately 750 kW per phase. Similarly, the wind turbine is located at node 60, offering a total generation capacity of 600 kW.
The line connections, along with their corresponding lengths and the active and reactive power demands per node, are presented in Table 10, while the expected daily renewable generation and demand behaviors are listed in Table 11.
To assess the performance of the proposed MI-Convex optimization approach for OCS in the 85-bus grid, four distinct numerical test cases were considered:
  • Case 1: An analysis of the optimization framework under peak load conditions, maintaining the same simulation parameters as those used for the 27- and 33-bus grids.
  • Case 2: Conductor selection based exclusively on the three-period demand profile.
  • Case 3: Conductor selection considering daily load variations, without accounting for the integration of renewable generation sources.
  • Case 4: Comprehensive evaluation incorporating both daily demand variations and renewable generation profiles.
The numerical evaluation of each of these simulation cases is presented in Table 12.
The numerical results for the 85-bus grid under different operating conditions reveal key insights into the impact of considering realistic load profiles and renewable generation integration on OCS and the total planning cost (see the results in Table 12):
  • Under peak load conditions, the network is large enough to simultaneously withstand the maximum possible demand across all nodes. This results in the highest total cost (US$ 915,592.73), with US$ 590,252.78 allocated to conductor investment and US$ 325,339.96 to energy losses. The network is heavily oversized because it must account for an extreme – though rare – operational situation, leading to overinvestment in conductor sizes and underutilization during most operating hours.
  • When the load profile is segmented into three typical periods (high, medium, and low demand), the total cost is substantially reduced to US$ 739,784.23. Both conductor investment (US$ 434,737.18) and energy losses costs (US$ 305,047.05) decrease compared to the peak load case. This demonstrates that planning based on more realistic demand scenarios prevents unnecessary oversizing, leading to significant cost savings of approximately 19.21%.
  • Considering a detailed daily load variation without renewable integration yields a total cost of US$ 787,221.25. Although slightly higher than case 2, this case captures daily consumption fluctuations more precisely, leading to a balanced investment in conductors (US$ 467,893.31) and operational losses reduction (US$ 319,327.95). This approach better reflects the network’s true usage in spite of demand peaks throughout the day.
  • The most significant impact is observed when renewable generation is incorporated. The total system cost drops to US$ 705,197.06, even lower than case 3, despite an increase in the costs of energy losses (US$ 314,328.96). This decrease is mainly due to the substantial reduction in conductor investment (US$ 390,868.10)—the lowest among all cases. The presence of DG reduces the net power demand during the day, alleviating current flows across the network and enabling the selection of smaller conductors without compromising system reliability. Thus, renewables minimize infrastructure investment, achieving a cost reduction of about 22.97% compared to the traditional peak-load design.
The numerical results obtained for the 85-bus grid show that dimensioning electrical distribution networks based solely on peak load conditions leads to oversized infrastructures and economically inefficient designs. By contrast, incorporating time-dependent load profiles, such as three-period or daily variations, enables a more accurate matching between conductor sizes and the expected current flows, significantly reducing planning costs. Moreover, the integration of renewable energy sources provides dual benefits: it alleviates demand stress on the system and further lowers infrastructure investments, despite a slight increase in energy losses. Overall, case 4 underscores the economic and operational advantages of distributed energy resources, demonstrating that modern distribution networks should integrate renewables, not only to achieve sustainability goals but also to achieve greater cost efficiency.
Regarding the voltage profiles of the 85-bus system, the minimum voltages across all simulated cases remain above 0.90 p.u., even under varying operating conditions and in the face of renewables integration. Although slight voltage drops are noted when moving from peak load (0.9414 p.u.) to more realistic load and generation scenarios (lowest at 0.9008 p.u. for bus 54), the final profiles remain within acceptable operational standards for distribution networks. This confirms that the proposed conductor selection methodology not only provides cost-effective solutions but also maintains satisfactory voltage regulation across large-scale systems.

3.4. Computational Performance Characteristics

To demonstrate the effectiveness and robustness of the proposed MI-Convex optimization approach to solve the OCS problem in balanced distribution networks, Table 13 presents the average processing times, the number of integer variables (i.e., binary variables), and the total number of variables employed.
The numerical results in Table 13 show that:
  • The MI-Convex model shows an expected increase in processing times and the number of total variables as the network size grows (from 27 to 85 buses). Despite the significant rise in variables, especially for the daily operation cases, the solver remains capable of handling large problem instances within reasonable times, particularly for small- and medium-sized grids.
  • As the complexity of the scenario increases (from peak load to three-period to daily operation), both the total number of variables and the processing times grow substantially. For example, in the 85-bus grid, the daily operation case requires over 765 s, compared to just 12 s for the peak load scenario, highlighting the computational impact of multi-period modeling.
  • The inclusion of DGs in the daily operation case of the 85-bus grid results in a slight reduction in processing times (724.6 s vs. 765.3 s), despite using the same number of variables. This suggests that DG integration can potentially introduce structural changes in the optimization model that favor faster convergence under certain conditions.

4. Conclusions

This paper proposed a MI-Convex optimization approach for solving the OCS problem in radial distribution networks operating under balanced conditions. Comparative analyses with state-of-the-art metaheuristic techniques, such as the VSA, the NMA, the GNDO, and the TSA, demonstrated the superiority of our proposal in terms of solution quality, reproducibility, and computational efficiency. Numerical validations showed that MI-Convex consistently achieved cost-effective solutions, matching or outperforming the best solutions reported in the literature while ensuring global optimality and systematic convergence.
A sensitivity analysis considering different load profiles revealed that OCS is highly dependent on the modeling of the expected demand. In particular, considering realistic load variations (e.g., three-period or daily profiles) led to significant cost reductions compared to traditional peak-load planning. For the 27-bus grid, the daily operation profile achieved a total cost reduction of approximately 20.17%, while the 33-bus grid reported a decrease of 27.61%. These results highlight the critical importance of realistic load modeling to avoid network oversizing, reduce unnecessary investments, and improve operational efficiency.
Furthermore, a case study on a 85-bus grid underscored the advantages of integrating renewable energy sources (PV and wind generation). Incorporating distributed generation not only reduced the infrastructure investment required but also mitigated demand stress on the network, resulting in a total cost reduction of nearly 22.97% compared to peak-load designs. Across all cases, the MI-Convex method ensured that voltage profiles remained within acceptable operational limits, guaranteeing technical feasibility alongside economic benefits.
In summary, the proposed MI-Convex methodology offers a robust, globally optimal, and computationally efficient tool for planning electrical grids, providing distribution companies with a strategic means to optimize conductor sizing, minimize total costs, and enhance network reliability under dynamic operating conditions.
Future research will aim to further enhance the proposed MI-Convex optimization framework by addressing several key aspects. First, the incorporation of uncertainty modeling for renewable energy generation, demand-side variations, and component failures will be explored to improve the robustness and resilience of the network planning process. Second, the integration of dynamic reconfiguration strategies will be investigated, allowing the system to adapt to real-time operating conditions and load fluctuations. Third, the methodology will be extended to more complex network configurations, including three-phase unbalanced and meshed distribution systems, in order to broaden its applicability to practical urban and semi-urban environments. Additionally, the inclusion of multi-source supply schemes and the analysis of dynamic operational constraints such as switching operations are envisioned to further increase the practical relevance and scalability of the approach. Collectively, these advancements aim to develop more flexible, sustainable, and cost-effective distribution networks aligned with the evolving demands of modern power systems.

Author Contributions

Conceptualization, methodology, software, and writing (review and editing): O.D.M., O.D.F.-C., L.F.G.-N., W.G.-G. and D.A.G.-R. All authors have read and agreed to the published version of the manuscript.

Funding

The authors acknowledge the support provided by the Thematic Network 723RT0150 “Red para la integración a gran escala de energías renovables en sistemas eléctricos (RIBIERSE-CYTED)” financed by the call for Thematic Networks of the CYTED (Ibero-American Program of Science and Technology for Development) for 2022.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

The first author would like to express gratitude to Oficina de Investigaciones at Universidad Distrital Francisco José de Caldas for supporting the internal research project with code 33787724, titled “Desarrollo de una metodología de gestión eficiente de potencia reactiva en sistemas de distribución de media tensión empleando modelos de programación no lineal”.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Byles, D.; Mohagheghi, S. Sustainable power grid expansion: Life cycle assessment, modeling approaches, challenges, and opportunities. Sustainability 2023, 15, 8788. [Google Scholar] [CrossRef]
  2. Al-Dhaifallah, M.; Refaat, M.M.; Alaas, Z.; Aleem, S.H.A.; El-kholy, E.E.; Ali, Z.M. Multi-objectives transmission expansion planning considering energy storage systems and high penetration of renewables and electric vehicles under uncertain conditions. Energy Rep. 2024, 11, 4143–4164. [Google Scholar] [CrossRef]
  3. Meinecke, S.; Stock, D.S.; Braun, M. New distributed optimization method for tso–dso coordinated grid operation preserving power system operator sovereignty. Energies 2023, 16, 4753. [Google Scholar] [CrossRef]
  4. Khattab, H.A.; Aljumah, A.S.; Shaheen, A.M.; Omar, H.A. Improved Manta Ray Foraging Algorithm for Optimal Allocation Strategies to Power Delivery Capabilities in Active Distribution Networks. IEEE Access 2024, 12, 157699–157715. [Google Scholar] [CrossRef]
  5. Abdelwahab, S.A.M.; El-Rifaie, A.M.; Hegazy, H.Y.; Tolba, M.A.; Mohamed, W.I.; Mohamed, M. Optimal control and optimization of grid-connected PV and wind turbine hybrid systems using electric eel foraging optimization algorithms. Sensors 2024, 24, 2354. [Google Scholar] [CrossRef]
  6. Gafar, M.; Sarhan, S.; Ginidi, A.R.; Shaheen, A.M. An Improved Bio-Inspired Material Generation Algorithm for Engineering Optimization Problems Including PV Source Penetration in Distribution Systems. Appl. Sci. 2025, 15, 603. [Google Scholar] [CrossRef]
  7. Obukhov, S.; Ibrahim, A.; Tolba, M.A.; El-Rifaie, A.M. Power balance management of an autonomous hybrid energy system based on the dual-energy storage. Energies 2019, 12, 4690. [Google Scholar] [CrossRef]
  8. Aljumah, A.S.; Alqahtani, M.H.; Shaheen, A.M.; Ginidi, A.R. Adaptive operational allocation of D-SVCs in distribution feeders using modified artificial rabbits algorithm. Electr. Power Syst. Res. 2025, 245, 111588. [Google Scholar] [CrossRef]
  9. Alnami, H.; El-Rifaie, A.M.; Moustafa, G.; Hakmi, S.H.; Shaheen, A.M.; Tolba, M.A. Optimal allocation of TCSC devices in transmission power systems by a novel adaptive dwarf mongoose optimization. IEEE Access 2023, 12, 6063–6087. [Google Scholar] [CrossRef]
  10. Elsayed, A.M.; El-Rifaie, A.M.; Areed, M.F.; Shaheen, A.M.; Atallah, M.O. Allocation and control of multi-devices voltage regulation in distribution systems via rough set theory and grasshopper algorithm: A practical study. Results Eng. 2025, 25, 103860. [Google Scholar] [CrossRef]
  11. Franco, J.F.; Rider, M.J.; Lavorato, M.; Romero, R. Optimal conductor size selection and reconductoring in radial distribution systems using a mixed-integer LP approach. IEEE Trans. Power Syst. 2012, 28, 10–20. [Google Scholar] [CrossRef]
  12. Ismael, S.M.; Aleem, S.H.E.A.; Abdelaziz, A.Y. Optimal selection of conductors in Egyptian radial distribution systems using sine-cosine optimization algorithm. In Proceedings of the 2017 Nineteenth International Middle East Power Systems Conference (MEPCON), Cairo, Egypt, 19–21 December 2017; pp. 103–107. [Google Scholar] [CrossRef]
  13. Zhao, Z.; Mutale, J. Optimal conductor size selection in distribution networks with high penetration of distributed generation using adaptive genetic algorithm. Energies 2019, 12, 2065. [Google Scholar] [CrossRef]
  14. Cortés-Caicedo, B.; Avellaneda-Gómez, L.S.; Montoya, O.D.; Alvarado-Barrios, L.; Chamorro, H.R. Application of the vortex search algorithm to the phase-balancing problem in distribution systems. Energies 2021, 14, 1282. [Google Scholar] [CrossRef]
  15. Montoya, O.D.; Molina-Cabrera, A.; Grisales-Noreña, L.F.; Hincapié, R.A.; Granada, M. Improved genetic algorithm for phase-balancing in three-phase distribution networks: A master-slave optimization approach. Computation 2021, 9, 67. [Google Scholar] [CrossRef]
  16. Guzmán-Henao, J.A.; Cortés-Caicedo, B.; Bolaños, R.I.; Grisales-Noreña, L.F.; Montoya, O.D. Optimal conductor selection and phase balancing in three-phase distribution systems: An integrative approach. Results Eng. 2024, 24, 103416. [Google Scholar] [CrossRef]
  17. Vélez-Marín, V.M.; Montoya, O.D.; Hernández, J.C. A DIgSILENT Programming-Based Approach for Selecting Conductors in Distribution Networks via the Tabu Search Algorithm. In Proceedings of the 2024 IEEE Colombian Conference on Applications of Computational Intelligence (ColCACI), Pamplona, Colombia, 17–19 July 2024; IEEE: Piscataway, NJ, USA, 2024; pp. 1–6. [Google Scholar]
  18. Gallego Pareja, L.A.; López-Lezama, J.M.; Gómez Carmona, O. A MILP model for optimal conductor selection and capacitor banks placement in primary distribution systems. Energies 2023, 16, 4340. [Google Scholar] [CrossRef]
  19. Garces, A. Mathematical Programming for Power Systems Operation: From Theory to Applications in Python; John Wiley & Sons: Hoboken, NJ, USA, 2021. [Google Scholar]
  20. Ponce, D.; Aguila Téllez, A.; Krishnan, N. Optimal Selection of Conductors in Distribution System Designs Using Multi-Criteria Decision. Energies 2023, 16, 7167. [Google Scholar] [CrossRef]
  21. Thenepalle, M. A comparative study on optimal conductor selection for radial distribution network using conventional and genetic algorithm approach. Int. J. Comput. Appl. 2011, 17, 6–13. [Google Scholar] [CrossRef]
  22. Bohórquez-Álvarez, D.P.; Niño-Perdomo, K.D.; Montoya, O.D. Optimal Load Redistribution in Distribution Systems Using a Mixed-Integer Convex Model Based on Electrical Momentum. Information 2023, 14, 229. [Google Scholar] [CrossRef]
  23. Gadelha, V.; Bullich-Massagué, E.; Sumper, A. Optimal power flow in electrical grids based on power routers. Electr. Power Syst. Res. 2024, 234, 110581. [Google Scholar] [CrossRef]
  24. de Jesus Delgado, M.A.; Pourakbari-Kasmaei, M.; Rider, M.J. A Branch and Bound algorithm to solve nonconvex MINLP problems via novel division strategy: An electric power system case study. In Proceedings of the 2017 IEEE International Conference on Environment and Electrical Engineering and 2017 IEEE Industrial and Commercial Power Systems Europe (EEEIC/I&CPS Europe), Milan, Italy, 6–9 June 2017; IEEE: Piscataway, NJ, USA, 2017; pp. 1–6. [Google Scholar]
  25. Androulakis, I.P. MINLP: Branch and bound global optimization algorithm. In Encyclopedia of Optimization; Springer: Berlin/Heidelberg, Germany, 2024; pp. 1–7. [Google Scholar]
  26. Liu, C.; Ma, Y.; Zhang, D.; Li, J. A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems. Front. Chem. Eng. 2022, 4, 983162. [Google Scholar] [CrossRef]
  27. Montoya, O.D.; Gil-González, W. On the numerical analysis based on successive approximations for power flow problems in AC distribution systems. Electr. Power Syst. Res. 2020, 187, 106454. [Google Scholar] [CrossRef]
  28. Shen, T.; Li, Y.; Xiang, J. A graph-based power flow method for balanced distribution systems. Energies 2018, 11, 511. [Google Scholar] [CrossRef]
  29. Hoyos Vallejo, J.C.; Quintero Restrepo, J. Comparative Analysis of the Julia and AMPL Computational Tools Used in the Radial Distribution Network Optimization Problem. Ingeniería 2024, 29. [Google Scholar] [CrossRef]
  30. Dunning, I.; Huchette, J.; Lubin, M. JuMP: A modeling language for mathematical optimization. SIAM Rev. 2017, 59, 295–320. [Google Scholar] [CrossRef]
  31. Lubin, M.; Dowson, O.; Garcia, J.D.; Huchette, J.; Legat, B.; Vielma, J.P. JuMP 1.0: Recent improvements to a modeling language for mathematical optimization. Math. Program. Comput. 2023, 15, 581–589. [Google Scholar] [CrossRef]
  32. Pradilla-Rozo, J.D.; Vega-Forero, J.A.; Montoya, O.D. Application of the Gradient-Based Metaheuristic Optimizerto Solve the Optimal Conductor Selection Problemin Three-Phase Asymmetric Distribution Networks. Energies 2023, 16, 888. [Google Scholar] [CrossRef]
Figure 1. Solution methodology applied to the OCS problem for radial distribution networks.
Figure 1. Solution methodology applied to the OCS problem for radial distribution networks.
Sci 07 00072 g001
Figure 2. Electrical configuration of the 27-bus grid.
Figure 2. Electrical configuration of the 27-bus grid.
Sci 07 00072 g002
Figure 3. Electrical configuration of the 33-bus grid.
Figure 3. Electrical configuration of the 33-bus grid.
Sci 07 00072 g003
Figure 4. Single-line diagram of the 85-bus grid.
Figure 4. Single-line diagram of the 85-bus grid.
Sci 07 00072 g004
Table 1. Comparative analysis of existing optimization approaches and the proposed MI-Convex method.
Table 1. Comparative analysis of existing optimization approaches and the proposed MI-Convex method.
MethodLimitationsAdvantages of the MI-Convex Approach
MILP [11]Simplifies the nonlinear power flow via linear approximations; may compromise accuracy; not scalable for multi-period or nonlinear load conditions.Maintains nonlinear power losses modeling through quadratic and conic approximations; supports realistic multi-period demand profiles.
SCA [12]Heuristic; results are not reproducible; requires parameter tuning; no guarantee of global optimality.Deterministic solution; no parameter tuning; guarantees global optimality due to convex formulation.
AGA [13]Dependent on random initialization; requires calibration of crossover/mutation; high computational cost in large-scale grids.Solves convex subproblems using interior-point methods; scalable to large networks (e.g., the 85-bus feeder).
TSA [17]Requires large number of iterations; sensitive to stopping criteria; lacks consistent convergence.Repeatable results; robust convergence using branch-and-bound and interior-point techniques.
VSA, GNDO, and NMAInconsistent performance across test cases; computational results vary between runs.Consistent across all runs; reliably minimizes total planning costs; reduced processing times for medium-sized networks.
Table 2. Electrical parameters of the 27-bus grid.
Table 2. Electrical parameters of the 27-bus grid.
lkm L l (km) P mt d (kW) Q mt d (kvar)
1120.550.00.0
2231.500.00.0
3340.45297.5184.4
4450.630.00.0
5560.70255.0158.0
6670.550.00.0
7781.00212.5131.7
8891.250.00.0
99101.00266.1164.9
102111.0085.052.7
1111121.23340.0210.7
1212130.75297.5184.4
1313140.56191.3118.5
1414151.00106.365.8
1515161.00255.0158.0
163171.00255.0158.0
1717180.60127.579.0
1818190.90297.5184.4
1919200.95340.0210.7
2020211.0085.052.7
214221.00106.365.8
225231.0055.334.2
236240.4069.743.2
248250.60255.0158.0
258260.6063.839.5
2626270.80170.0105.4
Table 3. Electrical parameters of the 33-bus grid.
Table 3. Electrical parameters of the 33-bus grid.
lkm L l (km) P mt d (kW) Q mt d (kvar)
1120.069910060
2230.37209040
3340.276212080
4450.28766030
5560.76306020
6670.4030200100
7781.4733200100
8890.88506020
99100.89006020
1010110.13084530
1111120.24916035
1212131.31156035
1313140.627212080
1414150.55856010
1515160.64576020
1616171.50506020
1717180.65309040
182190.16039040
1919201.42989040
2020210.44399040
2121220.82319040
223230.37989040
2323240.8035420200
2424250.7985420200
256260.15326025
2626270.21456025
2727280.99636020
2828290.752412070
2929300.3830200600
3030310.968715070
3131320.3362210100
3232330.43566040
Table 4. Conductors available for installation in the 27- and 33-bus grids.
Table 4. Conductors available for installation in the 27- and 33-bus grids.
Gauge c R c ( Ω /km) X c ( Ω /km) I c max (A) C c (US$/km)
10.87630.41331801986
20.69600.41332002790
30.55180.40772303815
40.43870.39832705090
50.34800.38993008067
60.27650.361034012,673
70.09660.120160023,419
80.08530.095072030,070
Table 5. Solutions reported for the 27-bus grid.
Table 5. Solutions reported for the 27-bus grid.
MethodGauges z 1 (US$) z 2 (US$) z 3 (US$)
VSA[7,7,5,4,4,3,3,1,1,4,4,2,3,2,1,4,4,2,2,2,1,1,2,2,1,1]217,066.25344,352.15561,418.40
NMA[7,7,4,4,4,4,3,1,1,4,4,3,3,1,2,4,3,2,1,1,1,1,2,2,1,1]219,343.86337,744.80557,088.66
GNDO[7,7,4,4,4,3,3,1,1,4,4,2,1,1,1,3,2,2,1,1,1,1,1,1,1,1]230,953.18319,768.08550,721.26
TSA[7,7,4,4,4,3,3,1,1,4,4,2,1,1,1,4,2,2,1,1,1,1,1,1,1,1]227,087.17323,593.08550,680.25
MI-Convex[7,7,4,4,4,3,3,1,1,4,4,2,1,1,1,4,2,2,1,1,1,1,1,1,1,1]227,087.17323,593.08550,680.25
Table 6. Solutions reported for the 33-bus grid.
Table 6. Solutions reported for the 33-bus grid.
MethodGauges z 1 (US$) z 2 (US$) z 3 (US$)
TSA[7,7,5,5,5,4,3,2,1,1,1,1,1,1,1,1215,137.5583209,773.4628424,911.0211
1,1,1,1,1,3,2,1,4,4,4,3,3,1,1,1]
MI-Convex[7,7,7,5,5,4,3,2,1,1,1,1,1,1,1,1199,221.9755225,372.0600424,594.0354
1,1,1,1,1,3,2,1,4,4,4,3,3,1,1,1]
Table 7. Expected daily power profile consumption.
Table 7. Expected daily power profile consumption.
Time (t)Power (p.u.)Time (t)Power (p.u.)
10.6845130.8706
20.6441140.8343
30.6131150.8165
40.5997160.8194
50.5889170.8741
60.5980181.0000
70.6268190.9836
80.6517200.9364
90.7060210.8876
100.7870220.8093
110.8390230.7459
120.8527240.7335
Table 8. Variations in the investment and operating costs of the 27-bus grid under different load operating conditions.
Table 8. Variations in the investment and operating costs of the 27-bus grid under different load operating conditions.
Load CaseGauges z 1 (US$) z 2 (US$) z 3 (US$)Min. Voltage (p.u.)
Peak load scenario[7,7,4,4,4,3,3,1,1,4,4,2,1,227,087.17323,593.08550,680.250.9745 (Bus 10)
1,1,4,2,2,1,1,1,1,1,1,1,1]
Three-period case[7,5,4,3,3,2,2,1,1,3,2,1,1,183,788.84220,016.58403,805.420.9622 (Bus 10)
1,1,2,1,1,1,1,1,1,1,1,1,1]
Daily operation case[7,5,4,3,3,2,2,1,1,3,3,1,1,212,715.20226,873.83439,589.030.9622 (Bus 10)
1,1,3,1,1,1,1,1,1,1,1,1,1]
Table 9. Variations in the investment and operating costs of the 33-bus grid under different operating conditions.
Table 9. Variations in the investment and operating costs of the 33-bus grid under different operating conditions.
Load CaseGauges z 1 (US$) z 2 (US$) z 3 (US$)Min. Voltage (pu)
Peak load scenario[7,7,7,5,5,4,3,2,1,1,1,1,1,1,1,1,201,987.52222,494.12424,481.650.9629 (Bus 18)
1,1,1,1,1,3,2,1,4,4,4,3,3,1,1,1]
Three-period case[7,7,5,4,4,2,1,1,1,1,1,1,1,1,1,1,136,498.40170,937.37307,435.770.9554 (Bus 18)
1,1,1,1,1,1,1,1,3,2,2,2,2,1,1,1]
Daily operation case[7,7,5,5,5,3,2,1,1,1,1,1,1,1,1,1,144,208.42189,752.39333,960.810.9588 (Bus 18)
1,1,1,1,1,2,1,1,3,3,3,2,2,1,1,1]
Table 10. Line configuration and lengths for the 85-bus grid.
Table 10. Line configuration and lengths for the 85-bus grid.
lkm L l (km) P mt d (kW) Q mt d (kvar)lkm L l (km) P mt d (kW) Q mt d (kvar)
1120.4680.0000.0004334440.98535.2835.99
2230.4490.0000.0004444450.44135.2835.99
3340.3235657.134545460.22535.2835.99
4450.8700.0000.0004646470.1841414.28
5560.88335.2835.994735480.6980.0000.000
6670.3430.0000.0004848490.8750.0000.000
7780.95335.2835.994949500.76836.2837.01
8890.3090.0000.0005050510.2615657.13
99100.9310.0000.0005148520.9850.0000.000
1010110.1615657.135252530.44835.2835.99
1111120.9520.0000.0005353540.3445657.13
1212130.8780.0000.0005452550.6735657.13
1313140.50735.2835.995549560.5641414.28
1414150.01835.2835.99569570.5455657.13
152160.77835.2835.99757580.5640.0000.000
163170.359112114.265858590.6505657.13
175180.8485657.135958600.2375657.13
1818190.4335657.136060610.6265657.13
1919200.60535.2835.996161620.5305657.13
2020210.37735.2835.996260630.5141414.28
2121220.72135.2835.996363640.7010.0000.000
2219230.3165657.136464650.3730.0000.000
23740.94935.2835.996565660.6145657.13
24850.84935.2835.996664670.3070.0000.000
2525260.7755657.136767680.3220.0000.000
2626270.2990.0000.0006868690.6625657.13
2727280.8725657.136969700.1500.0000.000
2828290.3750.0000.0007070710.38435.2835.99
2929300.79835.2835.997167720.3205657.13
3030310.81635.2835.997268730.2910.0000.000
3131320.9990.0000.0007373740.2135657.13
3232330.0451414.287473750.72135.2835.99
3333340.2360.0000.0007570760.7055657.13
3434350.4300.0000.0007665770.7151414.28
3535360.84735.2835.997710780.3615657.13
3626370.3865657.137867790.54635.2835.99
3727380.1225657.137912800.3575657.13
3829390.9155657.138080810.9400.0000.000
3932400.18235.2835.998181820.4445657.13
4040410.5900.0000.0008281830.11035.2835.99
4141420.81235.2835.998383840.8651414.28
4241430.26135.2835.998413850.30035.2835.99
Table 11. Daily demand and generation variation for the 85-bus grid.
Table 11. Daily demand and generation variation for the 85-bus grid.
Time (h)Demand (pu)Photovoltaic (pu)Wind (pu)
10.68451133549247500.633118295
20.64412269003619700.607259323
30.61306915602972000.605557422
40.59973328253000600.684246423
50.58887407125166700.783719339
60.59801867022290000.790557706
70.62678605448656900.744958950
80.6517431891788910.03912336500.769603567
90.7060392455705850.06558717900.826492212
100.7870070489617070.23687079600.876523598
110.8390169556105930.45501781800.931213527
120.8527338540674410.72644026500.965504834
130.8706420270527720.92448632600.972218577
140.8342541436464090.98204115300.981135531
150.8165364831396460.82940707900.991393173
160.8193941703181560.73306329501
170.8740712516669840.50113384900.987258076
1810.17711751800.929542167
190.98361592684320800.791155379
200.93636883215850600.708839248
210.88759763764526600.712881960
220.80929700895408700.719897641
230.74585635359116000.703007456
240.73347304248428300.687238555
Table 12. Variations in the investment and operating costs of the 85-bus grid under different operating conditions.
Table 12. Variations in the investment and operating costs of the 85-bus grid under different operating conditions.
Load CaseGauges z 1 (US$) z 2 (US$) z 3 (US$)Min. Voltage (pu)
Case 1[7,7,7,7,7,7,7,4,1,1,1,1,1,1,1,1,1,1,1,1,1,325,339.96590,252.78915,592.730.9414 (Bus 54)
1,1,4,4,4,3,3,3,2,2,1,1,1,1,1,1,1,1,1,1,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,3,3,1,2,1,1,1,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]
Case 2[7,7,7,6,5,5,5,4,1,1,1,1,1,1,1,1,1,1,1,1,1,305,047.05434,737.18739,784.230.9036 (Bus 54)
1,1,3,3,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]
Case 3[7,7,7,7,5,5,5,4,1,1,1,1,1,1,1,1,1,1,1,1,1,319,327.95467,893.31787,221.250.9136 (Bus 54)
1,1,3,3,3,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,1,1,1,1,1,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]
Case 4[7,6,5,5,5,5,5,3,1,1,1,1,1,1,1,1,1,1,1,1,1,314,328.96390,868.10705,197.060.9008 (Bus 54)
1,1,3,3,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]
Table 13. Numerical performance of the MI-Convex model implemented in Julia.
Table 13. Numerical performance of the MI-Convex model implemented in Julia.
ScenarioProc. Time (s)Binary VariablesTotal Variables
27-bus grid
Peak scenario1.8389208366
Three-period case2.4659208578
Daily operation case9.69892082804
33-bus grid
Peak scenario2.1530256450
Three-period case4.9890256710
Daily operation case7.18602563440
85-bus grid
Peak scenario12.27306721178
Three-period case19.06006721854
Daily operation case765.29996728952
Daily operation case with DGs724.61806728952
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Montoya, O.D.; Florez-Cediel, O.D.; Grisales-Noreña, L.F.; Gil-González, W.; Giral-Ramírez, D.A. A Mixed-Integer Convex Optimization Framework for Cost-Effective Conductor Selection in Radial Distribution Networks While Considering Load and Renewable Variations. Sci 2025, 7, 72. https://doi.org/10.3390/sci7020072

AMA Style

Montoya OD, Florez-Cediel OD, Grisales-Noreña LF, Gil-González W, Giral-Ramírez DA. A Mixed-Integer Convex Optimization Framework for Cost-Effective Conductor Selection in Radial Distribution Networks While Considering Load and Renewable Variations. Sci. 2025; 7(2):72. https://doi.org/10.3390/sci7020072

Chicago/Turabian Style

Montoya, Oscar Danilo, Oscar David Florez-Cediel, Luis Fernando Grisales-Noreña, Walter Gil-González, and Diego Armando Giral-Ramírez. 2025. "A Mixed-Integer Convex Optimization Framework for Cost-Effective Conductor Selection in Radial Distribution Networks While Considering Load and Renewable Variations" Sci 7, no. 2: 72. https://doi.org/10.3390/sci7020072

APA Style

Montoya, O. D., Florez-Cediel, O. D., Grisales-Noreña, L. F., Gil-González, W., & Giral-Ramírez, D. A. (2025). A Mixed-Integer Convex Optimization Framework for Cost-Effective Conductor Selection in Radial Distribution Networks While Considering Load and Renewable Variations. Sci, 7(2), 72. https://doi.org/10.3390/sci7020072

Article Metrics

Back to TopTop