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.

A New Approach to Reducing Search Space and Increasing Efficiency in Simulation Optimization Problems via the Fuzzy-DEA-BCC

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

Análise de novos modelos matemáticos para o problema de planejamento da expansão de sistemas de transmissão

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

Locating control points in aerial images with a multi-scale approach based on terrestrial image patches

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

Domain reduction using GRASP construction phase for transmission expansion planning problem

This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.

Loss of space and dental arch length after the loss of the lower first primary molar: A longitudinal study

The premature loss of primary teeth may harm the normal occlusal development, although there are debates relating to the necessity of using space maintainer appliances. The aim of the study is to evaluate the changes in the dental arch perimeter and the space reduction after the premature loss of the lower first primary molar in the mixed dentition stage. The sample consists of 4 lower arch plaster models of 31 patients, within the period of pre-extraction, 6, 12 and 18 months after the lower first primary molar extraction. A reduction of space was noted with the cuspid dislocation and the permanent incisors moving toward the space of the extraction site. It was concluded that the lower first molar primary premature loss, during the mixed dentition, implicates an immediate placement of a space maintainer.

Short-term planning of electric power distribution networks using multiobjective genetic algorithim

The high active and reactive power level demanded by the distribution systems, the growth of consuming centers, and the long lines of the distribution systems result in voltage variations in the busses compromising the quality of energy supplied. To ensure the energy quality supplied in the distribution system short-term planning, some devices and actions are used to implement an effective control of voltage, reactive power, and power factor of the network. Among these devices and actions are the voltage regulators (VRs) and capacitor banks (CBs), as well as exchanging the conductors sizes of distribution lines. This paper presents a methodology based on the Non-Dominated Sorting Genetic Algorithm (NSGA-II) for optimized allocation of VRs, CBs, and exchange of conductors in radial distribution systems. The Multiobjective Genetic Algorithm (MGA) is aided by an inference process developed using fuzzy logic, which applies specialized knowledge to achieve the reduction of the search space for the allocation of CBs and VRs.

Discovering promising regions to help global numerical optimization algorithms

We have developed an algorithm using a Design of Experiments technique for reduction of search-space in global optimization problems. Our approach is called Domain Optimization Algorithm. This approach can efficiently eliminate search-space regions with low probability of containing a global optimum. The Domain Optimization Algorithm approach is based on eliminating non-promising search-space regions, which are identifyed using simple models (linear) fitted to the data. Then, we run a global optimization algorithm starting its population inside the promising region. The proposed approach with this heuristic criterion of population initialization has shown relevant results for tests using hard benchmark functions.

Atributos físicos nos tempos de adoção de manejos em Latossolo cultivado com soja

A condução das operações de preparo de forma inadequada ocasiona sérios problemas de conservação do solo, destacando-se a compactação, que acarreta a redução do espaço poroso, principalmente dos macroporos, e altera os atributos físico-hídricos. Este trabalho teve como objetivo verificar a influência dos diferentes sistemas e tempos de adoção de manejos em Latossolo Vermelho de Jaboticabal, Estado de São Paulo, por meio da densidade máxima, e correlacioná-la com a produtividade da soja, a densidade relativa e a umidade crítica de compactação. O delineamento experimental foi o inteiramente casualizado com parcelas subdivididas (cinco sistemas de uso e três camadas), com quatro repetições. Os cinco sistemas de uso foram: plantio direto por cino anos (SPD5), plantio direto por sete anos (SPD7), plantio direto por nove anos (SPD9), preparo convencional (SPC) e uma área adjacente de mata nativa (MN). As camadas do solo avaliadas foram as de 0-0,10, 0,10-0,20 e 0,20-0,30 m, nas quais foram determinados a densidade máxima do solo (Ds máx), a umidade crítica de compactação (Ugc), a densidade relativa do solo (Dsr), a composição granulométrica, a porosidade e o teor de matéria orgânica do solo. Os resultados mostraram que o comportamento das curvas de compactação do solo foi o mesmo em todas as camadas dos diferentes manejos e que os teores de matéria orgânica não justificaram as pequenas alterações da Ds máx. Para o Latossolo Vermelho, as operações mecanizadas nos sistemas de manejo podem ser executadas na faixa de 0,13 a 0,19 kg kg-1 de umidade sem causar degradação física. Verificou-se que a Dsr ótima e a umidade crítica de compactação foram de 0,86 e 0,15 kg kg-1, respectivamente, embora os diferentes sistemas e tempos de adoção de manejo tenham apresentado comportamento semelhante quanto à produtividade da soja.

Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem

The Capacitated Centered Clustering Problem (CCCP) consists of defining a set of p groups with minimum dissimilarity on a network with n points. Demand values are associated with each point and each group has a demand capacity. The problem is well known to be NP-hard and has many practical applications. In this paper, the hybrid method Clustering Search (CS) is implemented to solve the CCCP. This method identifies promising regions of the search space by generating solutions with a metaheuristic, such as Genetic Algorithm, and clustering them into clusters that are then explored further with local search heuristics. Computational results considering instances available in the literature are presented to demonstrate the efficacy of CS. (C) 2010 Elsevier Ltd. All rights reserved.

A Strategy to Solve the Multistage Transmission Expansion Planning Problem

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

A influência da redução do espaço nasofaringeano na morfologia facial de pré-adolescentes

A redução do espaço nasofaringeano devido à hipertrofia adenoideana leva a adaptações posturais da cabeça, mandíbula, língua e lábios, podendo causar alterações no padrão esquelético facial. Foram coletadas 98 teleradiografias em norma lateral de pré-adolescentes na faixa etária de 7 a 10 anos na Clínica de Ortodontia da F.O. Araraquara, as quais foram selecionadas levando-se em consideração a dimensão da imagem do espaço nasofaringeano (ENF) (correspondente à menor distância do dorso do palato mole à parede faringeana posterior). As radiografias foram divididas em 3 grupos: Grupo I (estreito), ENF entre 1,7 e 5,1mm; Grupo II (médio), ENF entre 5,2 e 7,6mm; Grupo III (amplo), ENF entre 7,7 e 12,9mm. Utilizamos duas medidas angulares e seis medidas lineares para caracterizar a morfologia facial. As médias e o desvio padrão de cada medida efetuada foram obtidas, e por meio de teste de análise de variância (ANOVA), verificou-se diferença não significativa entre os grupos para as variáveis: ANperp, p=0,07; PgNperp, p=0,058, comprimento mandibular, p=0,15, comprimento maxilar, p=0,06, diferença maxilomandibular, p=0,98, eixo facial, p=0,96, altura facial inferior, p=0,84 e significativa na variável plano mandibular (p<0,01). Portanto, a redução do espaço nasofaringeano está associada a alterações no plano mandibular, que apresentou valores maiores com a diminuição do espaço nasofaringeano.

Avaliação cefalométrica do espaço aéreo posterior em pacientes com oclusão Classe II submetidos à cirurgia ortognática

OBJETIVO: o avanço maxilomandibular é um método cirúrgico comumente usado no tratamento de pacientes acometidos pela Síndrome da Apnéia Obstrutiva do Sono (SAOS) e portadores de anormalidades anatômicas identificáveis neste complexo, que estreitam e/ou obstruem o espaço aéreo. O intuito deste estudo foi analisar variações cefalométricas do espaço aéreo faríngeo em indivíduos Classe II de Angle, após a cirurgia ortognática. METODOLOGIA: a amostra consistiu de telerradiografias laterais equivalentes aos períodos pré e pós-operatório de 30 indivíduos, divididos no grupo com avanço cirúrgico mandibular (n=15) e no grupo com avanço maxilomandibular (n=15). Os parâmetros cefalométricos usados permitiram avaliar o espaço aéreo posterior em 3 níveis: a hipofaringe (PFI-V), a orofaringe (PFM-PM, PFM-PO, PFM-U, PFM-Up) e a nasofaringe (PFM-PN, pm-PFS). A análise esquelética foi na base do crânio (N-S-Ba) e na mandíbula (Ar-Go-Me). A média das diferenças entre os valores pré e pós-operatórios das mensurações lineares (mm) e angulares (graus) foi avaliada pelo teste t pareado. RESULTADOS E CONCLUSÕES: estatisticamente, não houve redução do espaço aéreo faríngeo pós-avanço cirúrgico. O que se observou foi que apenas PFM-PO e PFS-pM se mantiveram constantes e na maioria restante os valores aumentaram.

Transmission-expansion planning using the DC model and nonlinear-programming technique

The paper presents a constructive heuristic algorithm (CHA) for solving directly the long-term transmission-network-expansion-planning (LTTNEP) problem using the DC model. The LTTNEP is a very complex mixed-integer nonlinear-programming problem and presents a combinatorial growth in the search space. The CHA is used to find a solution for the LTTNEP problem of good quality. A sensitivity index is used in each step of the CHA to add circuits to the system. This sensitivity index is obtained by solving the relaxed problem of LTTNEP, i.e. considering the number of circuits to be added as a continuous variable. The relaxed problem is a large and complex nonlinear-programming problem and was solved through the interior-point method (IPM). Tests were performed using Garver's system, the modified IEEE 24-Bus system and the Southern Brazilian reduced system. The results presented show the good performance of IPM inside the CHA.

A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.