A modified micro genetic algorithm for undertaking multi-objective optimization problems

In this paper, a Modified micro Genetic Algorithm (MmGA) is proposed for undertaking Multi-objective Optimization Problems (MOPs). An NSGA-II inspired elitism strategy and a population initialization strategy are embedded into the traditional micro Genetic Algorithm (mGA) to form the proposed MmGA. The main aim of the MmGA is to improve its convergence rate towards the pareto optimal solutions. To evaluate the effectiveness of the MmGA, two experiments using the Kursawe test function in MOPs are conducted, and the results are compared with those from other approaches using a multi-objective evolutionary algorithm indicator, i.e. the Generational Distance (GD). The outcomes positively demonstrate that the MmGA is able to provide useful solutions with improved GD measures for tackling MOPs.

Genetic algorithm based PI controller tuning for induction motor drive with ANN flux estimator

This paper presents a Genetic Algorithm (GA) based fast speed response controller for poly-phase induction motor drive. Here the proportional and integral gains of PI controller are optimized by GA to achieve quick speed response. An adaptive Recurrent Neural Network (RNN) with Real Time Recurrent Learning (RTRL) algorithm is proposed to estimate rotor flux. An online tuning scheme to update the weight of RNN is presented to overcome stator resistance variation problem. This tuning scheme requires torque estimator to calculate the torque error. Space vector modulation (SVM) technique is used to produce the motor input voltage. Simulation tests have been performed to study the dynamic performances of the drive system for both the classical PI and the genetic algorithm based PI controllers.

Optimisation of nonlinear motion cueing algorithm based on genetic algorithm

Motion cueing algorithms (MCAs) are playing a significant role in driving simulators, aiming to deliver the most accurate human sensation to the simulator drivers compared with a real vehicle driver, without exceeding the physical limitations of the simulator. This paper provides the optimisation design of an MCA for a vehicle simulator, in order to find the most suitable washout algorithm parameters, while respecting all motion platform physical limitations, and minimising human perception error between real and simulator driver. One of the main limitations of the classical washout filters is that it is attuned by the worst-case scenario tuning method. This is based on trial and error, and is effected by driving and programmers experience, making this the most significant obstacle to full motion platform utilisation. This leads to inflexibility of the structure, production of false cues and makes the resulting simulator fail to suit all circumstances. In addition, the classical method does not take minimisation of human perception error and physical constraints into account. Production of motion cues and the impact of different parameters of classical washout filters on motion cues remain inaccessible for designers for this reason. The aim of this paper is to provide an optimisation method for tuning the MCA parameters, based on nonlinear filtering and genetic algorithms. This is done by taking vestibular sensation error into account between real and simulated cases, as well as main dynamic limitations, tilt coordination and correlation coefficient. Three additional compensatory linear blocks are integrated into the MCA, to be tuned in order to modify the performance of the filters successfully. The proposed optimised MCA is implemented in MATLAB/Simulink software packages. The results generated using the proposed method show increased performance in terms of human sensation, reference shape tracking and exploiting the platform more efficiently without reaching the motion limitations.

Robust optimal motion cueing algorithm based on the linear quadratic regulator method and a genetic algorithm

The aim of this paper is to design and develop an optimal motion cueing algorithm (MCA) based on the genetic algorithm (GA) that can generate high-fidelity motions within the motion simulator's physical limitations. Both, angular velocity and linear acceleration are adopted as the inputs to the MCA for producing the higher order optimal washout filter. The linear quadratic regulator (LQR) method is used to constrain the human perception error between the real and simulated driving tasks. To develop the optimal MCA, the latest mathematical models of the vestibular system and simulator motion are taken into account. A reference frame with the center of rotation at the driver's head to eliminate false motion cues caused by rotation of the simulator to the translational motion of the driver's head as well as to reduce the workspace displacement is employed. To improve the developed LQR-based optimal MCA, a new strategy based on optimal control theory and the GA is devised. The objective is to reproduce a signal that can follow closely the reference signal and avoid false motion cues by adjusting the parameters from the obtained LQR-based optimal washout filter. This is achieved by taking a series of factors into account, which include the vestibular sensation error between the real and simulated cases, the main dynamic limitations, the human threshold limiter in tilt coordination, the cross correlation coefficient, and the human sensation error fluctuation. It is worth pointing out that other related investigations in the literature normally do not consider the effects of these factors. The proposed optimized MCA based on the GA is implemented using the MATLAB/Simulink software. The results show the effectiveness of the proposed GA-based method in enhancing human sensation, maximizing the reference shape tracking, and reducing the workspace usage.

Human perception-based washout filtering using genetic algorithm

The Motion Cueing Algorithm (MCA) transforms longitudinal and rotational motions into simulator movement, aiming to regenerate high fidelity motion within the simulators physical limitations. Classical washout filters are widely used in commercial simulators because of their relative simplicity and reasonable performance. The main drawback of classical washout filters is the inappropriate empirical parameter tuning method that is based on trial-and-error, and is effected by programmers’ experience. This is the most important obstacle to exploiting the platform efficiently. Consequently, the conservative motion produces false cue motions. Lack of consideration for human perception error is another deficiency of classical washout filters and also there is difficulty in understanding the effect of classical washout filter parameters on generated motion cues. The aim of this study is to present an effortless optimization method for adjusting the classical MCA parameters, based on the Genetic Algorithm (GA) for a vehicle simulator in order to minimize human sensation error between the real and simulator driver while exploiting the platform within its physical limitations. The vestibular sensation error between the real and simulator driver as well as motion limitations have been taken into account during optimization. The proposed optimized MCA based on GA is implemented in MATLAB/Simulink. The results show the superiority of the proposed MCA as it improved the human sensation, maximized reference signal shape following and exploited the platform more efficiently within the motion constraints.

Optimal feature subset selection for neuron spike sorting using the genetic algorithm

It is crucial for a neuron spike sorting algorithm to cluster data from different neurons efficiently. In this study, the search capability of the Genetic Algorithm (GA) is exploited for identifying the optimal feature subset for neuron spike sorting with a clustering algorithm. Two important objectives of the optimization process are considered: to reduce the number of features and increase the clustering performance. Specifically, we employ a binary GA with the silhouette evaluation criterion as the fitness function for neuron spike sorting using the Super-Paramagnetic Clustering (SPC) algorithm. The clustering results of SPC with and without the GA-based feature selector are evaluated using benchmark synthetic neuron spike data sets. The outcome indicates the usefulness of the GA in identifying a smaller feature set with improved clustering performance.

Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design

This paper describes the formulation of a Multi-objective Pipe Smoothing Genetic Algorithm (MOPSGA) and its application to the least cost water distribution network design problem. Evolutionary Algorithms have been widely utilised for the optimisation of both theoretical and real-world non-linear optimisation problems, including water system design and maintenance problems. In this work we present a pipe smoothing based approach to the creation and mutation of chromosomes which utilises engineering expertise with the view to increasing the performance of the algorithm whilst promoting engineering feasibility within the population of solutions. MOPSGA is based upon the standard Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and incorporates a modified population initialiser and mutation operator which directly targets elements of a network with the aim to increase network smoothness (in terms of progression from one diameter to the next) using network element awareness and an elementary heuristic. The pipe smoothing heuristic used in this algorithm is based upon a fundamental principle employed by water system engineers when designing water distribution pipe networks where the diameter of any pipe is never greater than the sum of the diameters of the pipes directly upstream resulting in the transition from large to small diameters from source to the extremities of the network. MOPSGA is assessed on a number of water distribution network benchmarks from the literature including some real-world based, large scale systems. The performance of MOPSGA is directly compared to that of NSGA-II with regard to solution quality, engineering feasibility (network smoothness) and computational efficiency. MOPSGA is shown to promote both engineering and hydraulic feasibility whilst attaining good infrastructure costs compared to NSGA-II.

Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem

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

Economic-statistical design of the (X)over-bar chart used to control a wandering process mean using genetic algorithm

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

Transmission system expansion planning by an extended genetic algorithm

The paper presents an extended genetic algorithm for solving the optimal transmission network expansion planning problem. Two main improvements have been introduced in the genetic algorithm: (a) initial population obtained by conventional optimisation based methods; (b) mutation approach inspired in the simulated annealing technique, the proposed method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Excellent performance is reported in the test results section of the paper for a difficult large-scale real-life problem: a substantial reduction in investment costs has been obtained with regard to previous solutions obtained via conventional optimisation methods and simulated annealing algorithms; statistical comparison procedures have been employed in benchmarking different versions of the genetic algorithm and simulated annealing methods.

Using genetic algorithm to design protein sequence

In this work, genetic algorithms concepts along with a rotamer library for proteins side chains are used to optimize the tertiary structure of the hydrophobic core of Cytochrome b(562) starting from the known PDB structure of its backbone which is kept fixed while the side chains of the hydrophobic core are allowed to adopt the conformations present in the rotamer library. The atoms of the side chains forming the core interact via van der Waals energy. Besides the prediction of the native core structure, it is also suggested a set of different amino acid sequences for this core. Comparison between these new cores and the native are made in terms of their volumes, van der Waals energies values and the numbers of contacts made by the side chains forming the cores. This paper proves that genetic algorithms area efficient to design new sequence for the protein core. (C) 2007 Elsevier B.V. All rights reserved.

Location and contract pricing of distributed generation using a genetic algorithm

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

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.