Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

Parallel simulated annealing applied to long term transmission network expansion planning

The simulated annealing optimization technique has been successfully applied to a number of electrical engineering problems, including transmission system expansion planning. The method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Moreover, it has the ability to provide solutions arbitrarily close to an optimum (i.e. it is asymptotically convergent) as the cooling process slows down. The drawback of the approach is the computational burden: finding optimal solutions may be extremely expensive in some cases. This paper presents a Parallel Simulated Annealing, PSA, algorithm for solving the long term transmission network expansion planning problem. A strategy that does not affect the basic convergence properties of the Sequential Simulated Annealing algorithm have been implementeded and tested. The paper investigates the conditions under which the parallel algorithm is most efficient. The parallel implementations have been tested on three example networks: a small 6-bus network, and two complex real-life networks. Excellent results are reported in the test section of the paper: in addition to reductions in computing times, the Parallel Simulated Annealing algorithm proposed in the paper has shown significant improvements in solution quality for the largest of the test networks.

Diagnosis and environmental planning for Paranagud - PR - Brazil

The main goal of this study was to identify and analyse environmental problems related to human occupation at the south part of the city of Paranagua PR, Brazil, aiming the diagnosis and conceptual evaluation of landscape use. For landscape use assessments and degradation diagnosis purposes, the environment was classified considering mainly geological and geomorphologic characteristics, such as declivity and sediment origin. The identification of potential environmental impacts was made by aerial photographs, Landsat-TM images, photographic records, surface sediment samples, water-column samples, and mainly observation visits to each classified unit. Surface sediment samples were taken with a Petit-Ponar sampler, in 13 station located in Paranagua Bay. In order to characterize the contamination level on sediments, the concentration of the following elements were analysed: arsenic (As), copper (Cu), cadmium (Cd), nickel (Ni), lead (Ph) e zinc (Zn). For the extraction of these elements, samples were treated with HCl 0.1N for 12 hours. This method has the advantage of determining contaminants which are weakly bind to the sediment, thus more available to the system. Analysis were performed by atomic absorption spectroscopy. According to the adopted criteria, sectors were classified as hills, mangroves, continental sediments and beach ridges urban and port industrial. Water quality and concentrations of metallic elements were determined at three sectors one control and two with the influence of urban and port/industrial activities, respectively the major upland impacts found were: deforestation due to disordered occupation, and solid waste emission through domestic and industrial sewage. The diagnosis of the actual situation was used as a basis for a management plan, once it allows the identification of impacts, and consequent environmental irregularities. Based on this considerations, suggestions for land use and management were presented, which offers a better approach for recuperation and protection of the studied ecosystem.

The application of preprocessing and cutting plane techniques for a class of production planning problems

This paper investigates properties of integer programming models for a class of production planning problems. The models are developed within a decision support system to advise a sales team of the products on which to focus their efforts in gaining new orders in the short term. The products generally require processing on several manufacturing cells and involve precedence relationships. The cells are already (partially) committed with products for stock and to satisfy existing orders and therefore only the residual capacities of each cell in each time period of the planning horizon are considered. The determination of production recommendations to the sales team that make use of residual capacities is a nontrivial optimization problem. Solving such models is computationally demanding and techniques for speeding up solution times are highly desirable. An integer programming model is developed and various preprocessing techniques are investigated and evaluated. In addition, a number of cutting plane approaches have been applied. The performance of these approaches which are both general and application specific is examined.

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.

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.

Test systems and mathematical models for transmission network expansion planning

The data of four networks that can be used in carrying out comparative studies with methods for transmission network expansion planning are given. These networks are of various types and different levels of complexity. The main mathematical formulations used in transmission expansion studies-transportation models, hybrid models, DC power flow models, and disjunctive models are also summarised and compared. The main algorithm families are reviewed-both analytical, combinatorial and heuristic approaches. Optimal solutions are not yet known for some of the four networks when more accurate models (e.g. The DC model) are used to represent the power flow equations-the state of the art with regard to this is also summarised. This should serve as a challenge to authors searching for new, more efficient methods.

A linear optimization approach to the combined production planning model

Two fundamental processes usually arise in the production planning of many industries. The first one consists of deciding how many final products of each type have to be produced in each period of a planning horizon, the well-known lot sizing problem. The other process consists of cutting raw materials in stock in order to produce smaller parts used in the assembly of final products, the well-studied cutting stock problem. In this paper the decision variables of these two problems are dependent of each other in order to obtain a global optimum solution. Setups that are typically present in lot sizing problems are relaxed together with integer frequencies of cutting patterns in the cutting problem. Therefore, a large scale linear optimizations problem arises, which is exactly solved by a column generated technique. It is worth noting that this new combined problem still takes the trade-off between storage costs (for final products and the parts) and trim losses (in the cutting process). We present some sets of computational tests, analyzed over three different scenarios. These results show that, by combining the problems and using an exact method, it is possible to obtain significant gains when compared to the usual industrial practice, which solve them in sequence. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Transmission system expansion planning by a branch-and-bound algorithm

A branch and bound (B& B) algorithm using the DC model, to solve the power system transmission expansion planning by incorporating the electrical losses in network modelling problem is presented. This is a mixed integer nonlinear programming (MINLP) problem, and in this approach, the so-called fathoming tests in the B&B algorithm were redefined and a nonlinear programming (NLP) problem is solved in each node of the B& B tree, using an interior-point method. Pseudocosts were used to manage the development of the B&B tree and to decrease its size and the processing time. There is no guarantee of convergence towards global optimisation for the MINLP problem. However, preliminary tests show that the algorithm easily converges towards the best-known solutions or to the optimal solutions for all the tested systems neglecting the electrical losses. When the electrical losses are taken into account, the solution obtained using the Garver system is better than the best one known in the literature.

Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem

This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.

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.

ENERGY GENERATION EXPANSION PLANNING MODEL CONSIDERING EMISSIONS CONSTRAINTS

The generation expansion planning (GEP) problem consists in determining the type of technology, size, location and time at which new generation units must be integrated to the system, over a given planning horizon, to satisfy the forecasted energy demand. Over the past few years, due to an increasing awareness of environmental issues, different approaches to solve the GEP problem have included some sort of environmental policy, typically based on emission constraints. This paper presents a linear model in a dynamic version to solve the GEP problem. The main difference between the proposed model and most of the works presented in the specialized literature is the way the environmental policy is envisaged. Such policy includes: i) the taxation of CO(2) emissions, ii) an annual Emissions Reduction Rate (ERR) in the overall system, and iii) the gradual retirement of old inefficient generation plants. The proposed model is applied in an 11-region to design the most cost-effective and sustainable 10-technology US energy portfolio for the next 20 years.

An implementation of modified scatter search algorithm to transmission expansion planning

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

Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

New approach of induction machine drive using an adaptive digital PID controller with gain planning based on artificial neural networks

The present work introduces a new strategy of induction machines speed adjustment using an adaptive PID (Proportional Integral Derivative) digital controller with gain planning based on the artificial neural networks. This digital controller uses an auxiliary variable to determine the ideal induction machine operating conditions and to establish the closed loop gain of the system. The auxiliary variable value can be estimated from the information stored in a general-purpose artificial neural network based on CMAC (Cerebellar Model Articulation Controller).