Processo de revalorização na cidade de Santos-SP: o Alegra Centro e espaços de resistência

Pós-graduação em Geografia - IGCE

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 Strategy to Solve the Multistage Transmission Expansion Planning Problem

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

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.

RESTRUCTURING of SYSTEMS and LOGISTICS of MOVEMENT and ITS IMPACT on URBAN and REGIONAL PLANNING PAULISTA

Report some of the changes in production and consumption occurring in the state of São Paulo. through the restructuring in motion systems, logistics and standards and taxation, as well as the impacts on urban spaces through new economic dynamics, imposed by the demands of corporate, is the purpose of this article. The decentralization of production and consumption towards the interior was made possible by the combination of hierarchical and ordered some basic elements such as technological innovations (ways and means of transport) and organizational (logistics, standards and taxation) which optimized the flow territorial state São Paulo. It is noteworthy, therefore: 1) the improvement of logistics as a strategy, planning and management of transport, storage and communications (including the granting of public services to private), 2) the technological improvement and expansion of motion systems (infrastructure, means of transport) and 3) the systems of rules and regulations through taxation and deregulation affect the circulatory system of a given space. Thus, both systems aims to disentangle the economic flows (goods, services, information, capital and people) and provide a more fluid territorial. The impacts on the State of São Paulo, mainly through its economic dynamics, revert positively and negatively, by changing the way one thinks and performs planning.

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.

Heuristic algorithm to solve the short term transmission network expansion planning

In this paper, a method for solving the short term transmission network expansion planning problem is presented. This is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In order to And a solution of excellent quality for this problem, a constructive heuristic algorithm is presented in this paper. In each step of the algorithm, a sensitivity index is used to add a circuit (transmission line or transformer) or a capacitor bank (fixed or variable) to the system. This sensitivity index is obtained solving the problem considering the numbers of circuits and capacitors banks to be added (relaxed problem), as continuous variables. The relaxed problem is a large and complex nonlinear programming and was solved through a higher order interior point method. The paper shows results of several tests that were performed using three well-known electric energy systems in order to show the possibility and the advantages of using the AC model. ©2007 IEEE.

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.

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.

The triple near-Earth asteroid (153591) 2001 SN263: an ultra-blue, primitive target for the Aster space mission

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

Posterior partially edentulous jaws, planning a rehabilitation with dental implants

To discuss important characteristics of the use of dental implants in posterior quadrants and the rehabilitation planning. An electronic search of English articles was conducted on MEDLINE (PubMed) from 1990 up to the period of March 2014. The key terms were dental implants and posterior jaws, dental implants/treatment planning and posterior maxilla, and dental implants/treatment planning and posterior mandible. No exclusion criteria were used for the initial search. Clinical trials, randomized and non randomized studies, classical and comparative studies, multicenter studies, in vitro and in vivo studies, case reports, longitudinal studies and reviews of the literature were included in this review. One hundred and fifty-two articles met the inclusion criteria of treatment planning of dental implants in posterior jaw and were read in their entirety. The selected articles were categorized with respect to their context on space for restoration, anatomic considerations (bone quantity and density), radiographic techniques, implant selection (number, position, diameter and surface), tilted and pterygoid implants, short implants, occlusal considerations, and success rates of implants placed in the posterior region. The results derived from the review process were described under several different topic headings to give readers a clear overview of the literature. In general, it was observed that the use of dental implants in posterior region requires a careful treatment plan. It is important that the practitioner has knowledge about the theme to evaluate the treatment parameters. The use of implants to restore the posterior arch presents many challenges and requires a detailed treatment planning.