Abstract
This paper describes the application of the Opt-aiNet algorithm to the reconfiguration problem of distribution systems considering variable demand levels. The Opt-aiNet algorithm is an optimization technique inspired in the immunologic bio system and it aims at reproducing the main properties and functions of this system. The reconfiguration problem of distribution networks with variable demands is a complex problem that aims at identifying the most adequate radial topology of the network that complies with all technical constraints in every demand level while minimizing the cost of power losses along an extended operation period. This work includes results of the application of the Opt-aiNet algorithm to distribution systems with 33, 84, 136 and 417 buses. These results demonstrate the robustness and efficiency of the proposed approach.

Abstract
Transmission Expansion Planning (TEP) is an optimization problem that has a non-convex and combinatorial search space so that several solution algorithms may converge to local optima. Therefore, many works have been proposed to solve the TEP problem considering its relaxation or reducing its search space. In any case, relaxation and reduction approaches should not compromise the quality of the final solution. This paper aims at analyzing the performance of a search space technique using a Constructive Heuristic Algorithm (CHA) admitting that the TEP problem is then solved using a Discreet Evolutionary Particle Swarm Optimization (DEPSO). On one hand the reduction quality is performed by analyzing whether the optimal expansion routes are included in the CHA constrained set and, on the other hand, the relaxation quality of the DC model is analyzed by checking if the optimal solution obtained with it violates any constraint using the AC model. The simulations were performed using three different test systems. The results suggest that the proposed CHA provides very good results in reducing the TEP search space and that the adoption of the DC model originates several violations if the full AC model is used to model the operation of the power system.

Abstract
Multiyear Transmission Expansion Planning (TEP) aims to determine how and when a transmission network capacity should be expanded taking into account an extended horizon. This is an optimization problem very difficult to solve and that has unique characteristics that increase its complexity such as its non-convex search space and its integer and nonlinear nature. This paper describes a hybrid tool to solve the TEP problem, including a first phase to select a list of equipment candidates conducted by a Constructive Heuristic Algorithm (CHA), and a second phase that uses Discrete Evolutionary Particle Swarm Optimization (DEPSO) for the final planning. Both phases use the AC power flow model as a way to improve the realism of the developed tool. The paper includes a case study based on the IEEE 24-Bus Reliability Test System and the results show that tools based on swarm intelligence applied to reduced search spaces are able to find good quality solutions with low computational effort.

Abstract
This paper aims to describe a new tool to solve the Transmission Expansion Planning problem (TEP). The Non-Dominative CHA-Climbing Genetic Algorithm uses the standard blocks of Genetic Algorithms (GA) associated with an improvement of the population building block using Constructive Heuristic Algorithms (CHA) and Hill Climbing Method. TEP is a hard optimization problem because it has a non convex search space and integer and nonlinear nature, besides, the difficulty degree can be further increased if it includes more than one objective. In this work, a multi-objective TEP approach is detailed using an AC Optimal Power Flow to generate the set of Pareto solutions using the investment cost and the level of CO2 emissions, i.e. two conflicting objectives.

Abstract
This paper presents two new approaches to solve the reconfiguration problem of electrical distribution systems (EDSs) with variable demands, using the CLONALG and the SGACB algorithms. The CLONALG is a combinatorial optimization technique inspired by biological immune systems, which aims at reproducing the main properties and functions of the system. The SGACB is an optimization algorithm inspired by natural selection and the evolution of species. The reconfiguration problem with variable demands is a complex combinatorial problem that aims at identifying the best radial topology for an EDS, while satisfying all technical constraints at every demand level and minimizing the cost of energy losses in a given operation period. Both algorithms were implemented in C++ and test systems with 33, 84, and 136 nodes, as well as a real system with 417 nodes, in order to validate the proposed methods. The obtained results were compared with results available in the literature in order to verify the efficiency of the proposed approaches.

Abstract
One of the major concerns in Power Systems is surely related with their reliability. Long-term expansion planning studies traditionally use the well-known deterministic "N-1" contingency criterion. However, this criterion is applied based on worst-case analyses and the obtained plan may originate over-investments. Differently, probabilistic reliability approaches can incorporate different type of uncertainties that affect power systems. In this work, a long term multi-criteria AC Transmission Expansion Planning model was developed considering two objectives - the probabilistic reliability index Expected Energy Not Supplied (EENS) and the investment cost. The Pareto-Front associated with these two objectives was obtained using Genetic Algorithms and the final solution was selected using a fuzzy decision making function. This approach was applied to the IEEE 24 Bus Test System and the results ensure its robustness and efficiency.