Transporte público coletivo em Presidente Prudente: planejamento, mobilidade e acessibilidade no consumo do espaço urbano

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Branch and bound algorithm for transmission system expansion planning using a transportation model

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.

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.

GIS-based analytical tools for transport planning: spatial regression models for transportation demand forecast

Considering the importance of spatial issues in transport planning, the main objective of this study was to analyze the results obtained from different approaches of spatial regression models. In the case of spatial autocorrelation, spatial dependence patterns should be incorporated in the models, since that dependence may affect the predictive power of these models. The results obtained with the spatial regression models were also compared with the results of a multiple linear regression model that is typically used in trips generation estimations. The findings support the hypothesis that the inclusion of spatial effects in regression models is important, since the best results were obtained with alternative models (spatial regression models or the ones with spatial variables included). This was observed in a case study carried out in the city of Porto Alegre, in the state of Rio Grande do Sul, Brazil, in the stages of specification and calibration of the models, with two distinct datasets.

Constructive heuristic algorithm for the DC model in network transmission expansion planning

A novel constructive heuristic algorithm to the network expansion planning problem is presented the basic idea comes from Garver's work applied to the transportation model, nevertheless the proposed algorithm is for the DC model. Tests results with most known systems in the literature are carried out to show the efficiency of the method.

Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning

A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.

Specialised branch-and-bound algorithm for transmission network expansion planning

An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.

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 branch-and-bound algorithm for the multi-stage transmission expansion planning

This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models or to more complex ones such as the DC model. Tests with a realistic power system were carried out in order to show the performance of the algorithm for the expansion plan executed for different time frames. © 2005 IEEE.

Urban sprawl and energy use for transportation in the largest Brazilian cities

A study of the relationships between the amount of energy consumed for transportation purposes and a few selected variables related to urban form and socioeconomic characteristics of some of the largest Brazilian cities is conducted in this work. The studied cities include all 27 state capitals regardless of their size and population and 184 urban areas each with more than 20,000 inhabitants located in the state of São Paulo. Two different techniques were applied for data analyses: a more traditional regression analysis approach and artificial neural networks. In general, the results found in the analyses conducted here support the assumption that urban sprawl increases the energy use for transportation. In the case of the 27 state capitals, the analysis indicated that two spatial variables have a strong impact on the energy consumed for urban transportation: urban density and the ratio between the longest distances in the east-west and north-south directions. In the case of the 184 urbanized areas we also reached a similar conclusion. In that case, however, income and employment level apparently have a stronger influence on the amount of energy consumed. The results of the present study stress the importance of physical planning in developing country cities in order to reduce energy use for transportation. © 2007 International Energy Initiative, Inc.

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.

Sprawling and Urban transportation system: Impacts in the city of Londrina, Parana, Brazil

After nearly 80 years since the construction of its core, represented today by the city's central area, Londrina, located in the state of Parana, has the appearance of a new city but its features and trends of planning policies depict the bad examples of Brazilian cities. With a booming urban growth, from north to south of the county, the urban interstices represented by big voids in the middle of the city created speculation and the concept of an ideal city slowly disappeared. With a metropolitan appearance and, at the same time, with small town aspects, Londrina stands out as an automobile-oriented city, a fact that has impacted the livelihood of the population, generating environmental impacts for all social classes. This paper discusses how the form of occupation in Londrina, characterized by the sprawl phenomenon and its relation to car preference as a mode of transportation has generated urban environmental impacts. It was concluded that the choice of using cars in Londrina, as well in other medium-sized Brazilian cities studied by the comparative method, has increased and has generated bottlenecks in traffic. As a consequence, there is a constant expropriation of properties for widening roads and at the same time, the presence of various densities and urban voids that form an uneven urban space and an obstacle to efficient urban planning. © 2012 WIT Press.

A Fuzzy Goal Programming model for solving aggregate production-planning problems under uncertainty: A case study in a Brazilian sugar mill

This paper proposes a Fuzzy Goal Programming model (FGP) for a real aggregate production-planning problem. To do so, an application was made in a Brazilian Sugar and Ethanol Milling Company. The FGP Model depicts the comprehensive production process of sugar, ethanol, molasses and derivatives, and considers the uncertainties involved in ethanol and sugar production. Decision-makings, related to the agricultural and logistics phases, were considered on a weekly-basis planning horizon to include the whole harvesting season and the periods between harvests. The research has provided interesting results about decisions in the agricultural stages of cutting, loading and transportation to sugarcane suppliers and, especially, in milling decisions, whose choice of production process includes storage and logistics distribution. (C)2014 Elsevier B.V. All rights reserved.