Analysis of heuristic algorithms for the transportation model in static and multistage planning in network expansion systems

The usefulness of the application of heuristic algorithms in the transportation model, first proposed by Garver, is analysed in relation to planning for the expansion of transmission systems. The formulation of the mathematical model and the solution techniques proposed in the specialised literature are analysed in detail. Starting with the constructive heuristic algorithm proposed by Garver, an extension is made to the problem of multistage planning for transmission systems. The quality of the solutions found by heuristic algorithms for the transportation model is analysed, as are applications in problems of planning transmission systems.

Multistage and coordinated planning of the expansion of transmission systems

In this paper, an efficient genetic algorithm (GA) is presented to solve the problem of multistage and coordinated transmission expansion planning. This is a mixed integer nonlinear programming problem, difficult for systems of medium and large size and high complexity. The GA presented has a set of specialized genetic operators and an efficient form of generation of the initial population that finds high quality suboptimal topologies for large size and high complexity systems. In these systems, multistage and coordinated planning present a lower investment than static planning. Tests results are shown in one medium complexity system and one large size high complexity system.

Metaheurística GRASP para o problema de planejamento da expansão de sistemas de transmissão de energia elétrica

Pós-graduação em Engenharia Elétrica - FEIS

Algoritmo genético especializado aplicado ao planejamento da expansão de sistemas de distribuição de energia elétrica

Pós-graduação em Engenharia Elétrica - FEIS

A Strategy to Solve the Multistage Transmission Expansion Planning Problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Evaluation of hybrid models for static and multistage transmission system planning

Neste trabalho é analisada a aplicação de algoritmos heurísticos para o Modelo Híbrido Linear - Hybrid Linear Model (HLM) - no problema de planejamento da expansão de sistemas de transmissão. O HLM é um modelo relaxado que ainda não foi suficientemente explorado. Assim, é realizada uma análise das características do modelo matemático e das técnicas de solução que podem ser usadas para resolver este tipo de modelo. O trabalho analisa em detalhes um algoritmo heurístico construtivo para o HLM e faz uma extensão da modelagem e da técnica de solução para o planejamento multi-estágio da expansão de sistemas de transmissão. Dentro deste contexto, também é realizada uma avaliação da qualidade das soluções encontradas pelo HLM e as possibilidades de aplicação deste modelo em planejamento de sistemas de transmissão. Finalmente, são apresentados testes com sistemas conhecidos na literatura especializada.

Genetic algorithm of chu and beasley for static and multistage transmission expansion planning

In this paper the genetic algorithm of Chu and Beasley (GACB) is applied to solve the static and multistage transmission expansion planning problem. The characteristics of the GACB, and some modifications that were done, to efficiently solve the problem described above are also presented. Results using some known systems show that the GACB is very efficient. To validate the GACB, we compare the results achieved using it with the results using other meta-heuristics like tabu-search, simulated annealing, extended genetic algorithm and hibrid algorithms. © 2006 IEEE.

An enhanced genetic algorithm to solve the static and multistage transmission network expansion planning

An enhanced genetic algorithm (EGA) is applied to solve the long-term transmission expansion planning (LTTEP) problem. The following characteristics of the proposed EGA to solve the static and multistage LTTEP problem are presented, (1) generation of an initial population using fast, efficient heuristic algorithms, (2) better implementation of the local improvement phase and (3) efficient solution of linear programming problems (LPs). Critical comparative analysis is made between the proposed genetic algorithm and traditional genetic algorithms. Results using some known systems show that the proposed EGA presented higher efficiency in solving the static and multistage LTTEP problem, solving a smaller number of linear programming problems to find the optimal solutions and thus finding a better solution to the multistage LTTEP problem. Copyright © 2012 Luis A. Gallego et al.

Strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem

This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used to reduce the number of binary and continuous variables related to the candidate transmission lines and network constraints that are connected with them. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) and additional constraints, obtained from power flow equilibrium in an electric power system are employed for more reduction in search space. The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique. © 1969-2012 IEEE.

Multistage Transmission Expansion Planning Considering Fixed Series Compensation Allocation

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Multiobjective multistage distribution system planning using tabu search

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A metaheuristic to solve the transmission expansion planning

In this letter, a genetic algorithm (GA) is applied to solve - the static and multistage transmission expansion planning (TEP) problem. The characteristics of the proposed GA to solve the TEP problem are presented. Results using some known systems show that the proposed GA solves a smaller number of linear programming problems in order to find the optimal solutions and obtains a better solution for the multistage TEP problem.

Transmission network expansion planning for the Colombian electrical system: Connecting the Ituango hydroelectric power plant

The hydroelectric power plant Hidroltuango represents a major expansion for the Colombian electrical system (with a total capacity of 2400 MW). This paper analyzes the possible interconnections and investments involved in connecting Hidroltuango, in order to strengthen the Colombian national transmission system. A Mixed Binary Linear Programming (MBLP) model was used to solve the Multistage Transmission Network Expansion Planning (MTEP) problem of the Colombian electrical system, taking the N-1 safety criterion into account. The N-1 safety criterion indicates that the transmission system must be expanded so that the system will continue to operate properly if an outage in a system element (within a pre-defined set of contingencies) occurs. The use of a MBLP model guaranteed the convergence with existing classical optimization methods and the optimal solution for the MTEP using commercial solvers. Multiple scenarios for generation and demand were used to consider uncertainties within these parameters. The model was implemented using the algebraic modeling language AMPL and solved using the commercial solver CPLEX. The proposed model was then applied to the Colombian electrical system using the planning horizon of 2018-2025. (C) 2014 Elsevier B.V. All rights reserved.

Quality Of Life Of Coronary Artery Disease Patients After The Implementation Of Planning Strategies For Medication Adherence.

to compare the general and specific health-related quality of life (HRQoL) between the Intervention (IG) and Control (CG) groups of coronary artery disease patients after the implementation of Action Planning and Coping Planning strategies for medication adherence and to verify the relationship between adherence and HRQoL. this was a controlled and randomized study. the sample (n=115) was randomized into two groups, IG (n=59) and CG (n=56). Measures of medication adherence and general and specific HRQoL were obtained in the baseline and after two months of monitoring. the findings showed that the combination of intervention strategies - Action Planning and Coping Planning for medication adherence did not affect the HRQoL of coronary artery disease patients in outpatient monitoring.

Computed tomography and scintigraphy exams for diagnosis and treatment planning of the condylar osteochondroma: a case report

PURPOSE: To report an uncommon case of osteochondroma affecting the mandibular condyle of a young patient and to illustrate the important contributions of different imaging resources to the diagnosis and treatment planning of this lesion. CASE DESCRIPTION: A 24-year-old female patient with the chief complaint of an increasing facial asymmetry and pain in the left pre-auricular region, revealing a reduced mouth opening, mandibular deviation and posterior cross-bite over a period of 18 months. Panoramic radiography revealed an enlargement of the left condyle, whereas computed tomography (CT) sections and three-dimensional CT showed a well-defined bone growth arising from condylar neck. The scintigraphy exam showed an abnormal osteogenic activity in the left temporomandibular joint. The condyle was surgically removed and after 18 months follow-up the panoramic radiography and CT scans showed no signs of recurrence. CONCLUSION: Although osteochondroma is a benign bone tumor that rarely arises in cranial and maxillofacial region, it should be considered in the differential diagnosis of slow-growing masses of the temporomandibular area and the use of different imaging exams significantly contribute to the correct diagnosis and treatment planning of this pathological condition.