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.

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

Defects location in power systems components through a dedicated genetic algorithm

In this work the problem of defects location in power systems is formulated through a binary linear programming (BLP) model based on alarms historical database of control and protection devices from the system control center, sets theory of minimal coverage (AI) and protection philosophy adopted by the electric utility. In this model, circuit breaker operations are compared to their expected states in a strictly mathematical manner. For solving this BLP problem, which presents a great number of decision variables, a dedicated Genetic Algorithm (GA), is proposed. Control parameters of the GA, such as crossing over and mutation rates, population size, iterations number and population diversification, are calibrated in order to obtain efficiency and robustness. Results for a test system found in literature, are presented and discussed. © 2004 IEEE.

Reconfiguration of distribution systems by a modified genetic algorithm

In this paper a genetic algorithm based reconfiguration method is proposed to minimize the real power losses of distribution systems. The main innovation of this research work is that new types of crossover and mutation operators are proposed, such that the best possible results are obtained, with an acceptable computational effort. The crossover and mutation operators were developed so as to take advantage of the particular characteristics of distribution systems (as the radial topology). Simulation results indicate that the proposed method is very efficient, being able to find excellent configurations, with low computational effort, especially for larger systems. ©2007 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.

Controlling traffic jams on urban roads modeled in Coloured Petri net using Genetic Algorithm

This paper presents an application to traffic lights control in congested urban traffic, in real time, taking as input the position and route of the vehicles in the involved areas. This data is obtained from the communication between vehicles and infrastructure (V2I). Due to the great complexity of the possible combination of traffic lights and the short time to get a response, Genetic Algorithm was used to optimize this control. According to test results, the application can reduce the number of vehicles in congested areas, even with the entry of vehicles that previously were not being considered in these roads, such as parked vehicles. © 2012 IEEE.

A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging

The present paper proposes a new hybrid multi-population genetic algorithm (HMPGA) as an approach to solve the multi-level capacitated lot sizing problem with backlogging. This method combines a multi-population based metaheuristic using fix-and-optimize heuristic and mathematical programming techniques. A total of four test sets from the MULTILSB (Multi-Item Lot-Sizing with Backlogging) library are solved and the results are compared with those reached by two other methods recently published. The results have shown that HMPGA had a better performance for most of the test sets solved, specially when longer computing time is given. © 2012 Elsevier Ltd.

Genetic algorithm, MIP and improvement heuristic applied to the MLCLP with backlogging

The present paper solves the multi-level capacitated lot sizing problem with backlogging (MLCLSPB) combining a genetic algorithm with the solution of mixed-integer programming models and the improvement heuristic fix and optimize. This approach is evaluated over sets of benchmark instances and compared to methods from literature. Computational results indicate competitive results applying the proposed method when compared with other literature approaches. © 2013 IEEE.

A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem

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

Avaliação de operadores de algoritmos genéticos em otimização multidimensional

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

Refinamento geométrico de contornos e cumeeiras de telhados de edifícios extraídos de dados laser com uso de imagem aérea

In this paper, a method is proposed to refine the LASER 3D roofs geometrically by using a high-resolution aerial image and Markov Random Field (MRF) models. In order to do so, a MRF description for grouping straight lines is developed, assuming that each projected side contour and ridge is topologically correct and that it is only necessary to improve its accuracy. Although the combination of laser data with data from image is most justified for refining roof contour, the structure of ridges can give greater robustness in the topological description of the roof structure. The MRF model is formulated based on relationships (length, proximity, and orientation) between the straight lines extracted from the image and projected polygon and also on retangularity and corner injunctions. The energy function associated with MRF is minimized by the genetic algorithm optimization method, resulting in the grouping of straight lines for each roof object. Finally, each grouping of straight lines is topologically reconstructed based on the topology of the corresponding LASER scanning polygon projected onto the image-space. The results obtained were satisfactory. This method was able to provide polygons roof refined buildings in which most of its contour sides and ridges were geometrically improved.

A cost optimization-based design of precast concrete floors using genetic algorithms

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

Applying a genetic neuro-model reference adaptive controller in drilling optimization

Motivated by rising drilling operation costs, the oil industry has shown a trend toward real-time measurements and control. In this scenario, drilling control becomes a challenging problem for the industry, especially due to the difficulty associated with parameters modeling. One of the drillbit performance evaluators, the Rate Of Penetration (ROP), has been used as a drilling control parameter. However, relationships between operational variables affecting the ROP are complex and not easily modeled. This work presents a neuro-genetic adaptive controller to treat this problem. It is based on an auto-regressive with extra input signals, or ARX model and on a Genetic Algorithm (GA) to control the ROP. © [2006] IEEE.

Application of an iterative method and an evolutionary algorithm in fuzzy optimization

This work develops two approaches based on the fuzzy set theory to solve a class of fuzzy mathematical optimization problems with uncertainties in the objective function and in the set of constraints. The first approach is an adaptation of an iterative method that obtains cut levels and later maximizes the membership function of fuzzy decision making using the bound search method. The second one is a metaheuristic approach that adapts a standard genetic algorithm to use fuzzy numbers. Both approaches use a decision criterion called satisfaction level that reaches the best solution in the uncertain environment. Selected examples from the literature are presented to compare and to validate the efficiency of the methods addressed, emphasizing the fuzzy optimization problem in some import-export companies in the south of Spain. © 2012 Brazilian Operations Research Society.

Multi-objective evolutionary particle swarm optimization in the assessment of the impact of distributed generation

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