Abstract: A genetic algorithm (GA) based feature subset
selection algorithm is proposed in which the correlation structure of
the features is exploited. The subset of features is validated according
to the classification performance. Features derived from the
continuous wavelet transform are potentially strongly correlated.
GA-s that do not take the correlation structure of features into
account are inefficient. The proposed algorithm forms clusters of
correlated features and searches for a good candidate set of clusters.
Secondly a search within the clusters is performed. Different
simulations of the algorithm on a real-case data set with strong
correlations between features show the increased classification
performance. Comparison is performed with a standard GA without
use of the correlation structure.
Abstract: This paper presents a new approach using Combined Artificial Neural Network (CANN) module for daily peak load forecasting. Five different computational techniques –Constrained method, Unconstrained method, Evolutionary Programming (EP), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA) – have been used to identify the CANN module for peak load forecasting. In this paper, a set of neural networks has been trained with different architecture and training parameters. The networks are trained and tested for the actual load data of Chennai city (India). A set of better trained conventional ANNs are selected to develop a CANN module using different algorithms instead of using one best conventional ANN. Obtained results using CANN module confirm its validity.
Abstract: Multiprocessor task scheduling is a NP-hard problem and Genetic Algorithm (GA) has been revealed as an excellent technique for finding an optimal solution. In the past, several methods have been considered for the solution of this problem based on GAs. But, all these methods consider single criteria and in the present work, minimization of the bi-criteria multiprocessor task scheduling problem has been considered which includes weighted sum of makespan & total completion time. Efficiency and effectiveness of genetic algorithm can be achieved by optimization of its different parameters such as crossover, mutation, crossover probability, selection function etc. The effects of GA parameters on minimization of bi-criteria fitness function and subsequent setting of parameters have been accomplished by central composite design (CCD) approach of response surface methodology (RSM) of Design of Experiments. The experiments have been performed with different levels of GA parameters and analysis of variance has been performed for significant parameters for minimisation of makespan and total completion time simultaneously.
Abstract: This paper undertakes the problem of optimal
capacitor placement in a distribution system. The problem is how to
optimally determine the locations to install capacitors, the types and
sizes of capacitors to he installed and, during each load level,the
control settings of these capacitors in order that a desired objective
function is minimized while the load constraints,network constraints
and operational constraints (e.g. voltage profile) at different load
levels are satisfied. The problem is formulated as a combinatorial
optimization problem with a nondifferentiable objective function.
Four solution mythologies based on algorithms (GA),tabu search
(TS), and hybrid GA-SA algorithms are presented.The solution
methodologies are preceded by a sensitivity analysis to select the
candidate capacitor installation locations.
Abstract: This article addresses feature selection for breast
cancer diagnosis. The present process contains a wrapper approach
based on Genetic Algorithm (GA) and case-based reasoning (CBR).
GA is used for searching the problem space to find all of the possible
subsets of features and CBR is employed to estimate the evaluation
result of each subset. The results of experiment show that the
proposed model is comparable to the other models on Wisconsin
breast cancer (WDBC) dataset.
Abstract: Combinatorial optimization problems arise in many scientific and practical applications. Therefore many researchers try to find or improve different methods to solve these problems with high quality results and in less time. Genetic Algorithm (GA) and Simulated Annealing (SA) have been used to solve optimization problems. Both GA and SA search a solution space throughout a sequence of iterative states. However, there are also significant differences between them. The GA mechanism is parallel on a set of solutions and exchanges information using the crossover operation. SA works on a single solution at a time. In this work SA and GA are combined using new technique in order to overcome the disadvantages' of both algorithms.
Abstract: This paper presents a method for the optimal
allocation of Distributed generation in distribution systems. In this
paper, our aim would be optimal distributed generation allocation for
voltage profile improvement and loss reduction in distribution
network. Genetic Algorithm (GA) was used as the solving tool,
which referring two determined aim; the problem is defined and
objective function is introduced. Considering to fitness values
sensitivity in genetic algorithm process, there is needed to apply load
flow for decision-making. Load flow algorithm is combined
appropriately with GA, till access to acceptable results of this
operation. We used MATPOWER package for load flow algorithm
and composed it with our Genetic Algorithm. The suggested method
is programmed under MATLAB software and applied ETAP
software for evaluating of results correctness. It was implemented on
part of Tehran electricity distributing grid. The resulting operation of
this method on some testing system is illuminated improvement of
voltage profile and loss reduction indexes.
Abstract: This paper presents an application of particle swarm
optimization (PSO) to the grounding grid planning which compares to
the application of genetic algorithm (GA). Firstly, based on IEEE
Std.80, the cost function of the grounding grid and the constraints of
ground potential rise, step voltage and touch voltage are constructed
for formulating the optimization problem of grounding grid planning.
Secondly, GA and PSO algorithms for obtaining optimal solution of
grounding grid are developed. Finally, a case of grounding grid
planning is shown the superiority and availability of the PSO
algorithm and proposal planning results of grounding grid in cost and
computational time.
Abstract: Bus networks design is an important problem in
public transportation. The main step to this design, is determining the
number of required terminals and their locations. This is an especial
type of facility location problem, a large scale combinatorial
optimization problem that requires a long time to be solved.
The genetic algorithm (GA) is a search and optimization technique
which works based on evolutionary principle of natural
chromosomes. Specifically, the evolution of chromosomes due to the
action of crossover, mutation and natural selection of chromosomes
based on Darwin's survival-of-the-fittest principle, are all artificially
simulated to constitute a robust search and optimization procedure.
In this paper, we first state the problem as a mixed integer
programming (MIP) problem. Then we design a new crossover and
mutation for bus terminal location problem (BTLP). We tested the
different parameters of genetic algorithm (for a sample problem) and
obtained the optimal parameters for solving BTLP with numerical try
and error.
Abstract: Genetic Zone Routing Protocol (GZRP) is a new
hybrid routing protocol for MANETs which is an extension of ZRP
by using Genetic Algorithm (GA). GZRP uses GA on IERP and BRP
parts of ZRP to provide a limited set of alternative routes to the
destination in order to load balance the network and robustness
during node/link failure during the route discovery process. GZRP is
studied for its performance compared to ZRP in many folds like
scalability for packet delivery and proved with improved results. This
paper presents the results of the effect of load balancing on GZRP.
The results show that GZRP outperforms ZRP while balancing the
load.
Abstract: The weight constrained shortest path problem
(WCSPP) is one of most several known basic problems in
combinatorial optimization. Because of its importance in many areas
of applications such as computer science, engineering and operations
research, many researchers have extensively studied the WCSPP.
This paper mainly concentrates on the reduction of total search space
for finding WCSP using some existing Genetic Algorithm (GA). For
this purpose, some controlled schemes of genetic operators are
adopted on list chromosome representation. This approach gives a
near optimum solution with smaller elapsed generation than classical
GA technique. From further analysis on the matter, a new
generalized schema theorem is also developed from the philosophy
of Holland-s theorem.
Abstract: In this paper, investigation of subsynchronous
resonance (SSR) characteristics of a hybrid series compensated
system and the design of voltage controller for three level 24-pulse
Voltage Source Converter based Static Synchronous Series
Compensator (SSSC) is presented. Hybrid compensation consists of
series fixed capacitor and SSSC which is a active series FACTS
controller. The design of voltage controller for SSSC is based on
damping torque analysis, and Genetic Algorithm (GA) is adopted for
tuning the controller parameters. The SSR Characteristics of SSSC
with constant reactive voltage control modes has been investigated.
The results show that the constant reactive voltage control of SSSC
has the effect of reducing the electrical resonance frequency, which
detunes the SSR.The analysis of SSR with SSSC is carried out based
on frequency domain method, eigenvalue analysis and transient
simulation. While the eigenvalue and damping torque analysis are
based on D-Q model of SSSC, the transient simulation considers both
D-Q and detailed three phase nonlinear system model using
switching functions.
Abstract: This paper presents a systematic procedure for modelling and simulation of a power system installed with a power system stabilizer (PSS) and a flexible ac transmission system (FACTS)-based controller. For the design purpose, the model of example power system which is a single-machine infinite-bus power system installed with the proposed controllers is developed in MATLAB/SIMULINK. In the developed model synchronous generator is represented by model 1.1. which includes both the generator main field winding and the damper winding in q-axis so as to evaluate the impact of PSS and FACTS-based controller on power system stability. The model can be can be used for teaching the power system stability phenomena, and also for research works especially to develop generator controllers using advanced technologies. Further, to avoid adverse interactions, PSS and FACTS-based controller are simultaneously designed employing genetic algorithm (GA). The non-linear simulation results are presented for the example power system under various disturbance conditions to validate the effectiveness of the proposed modelling and simultaneous design approach.
Abstract: In this paper, genetic algorithm (GA) is proposed for
the design of an optimization algorithm to achieve the bandwidth
allocation of ATM network. In Broadband ISDN, the ATM is a highbandwidth;
fast packet switching and multiplexing technique. Using
ATM it can be flexibly reconfigure the network and reassign the
bandwidth to meet the requirements of all types of services. By
dynamically routing the traffic and adjusting the bandwidth
assignment, the average packet delay of the whole network can be
reduced to a minimum. M/M/1 model can be used to analyze the
performance.
Abstract: Unlike this study focused extensively on trading
behavior of option market, those researches were just taken their
attention to model-driven option pricing. For example, Black-Scholes
(B-S) model is one of the most famous option pricing models.
However, the arguments of B-S model are previously mentioned by
some pricing models reviewing. This paper following suggests the
importance of the dynamic character for option pricing, which is also
the reason why using the genetic algorithm (GA). Because of its
natural selection and species evolution, this study proposed a hybrid
model, the Genetic-BS model which combining GA and B-S to
estimate the price more accurate. As for the final experiments, the
result shows that the output estimated price with lower MAE value
than the calculated price by either B-S model or its enhanced one,
Gram-Charlier garch (G-C garch) model. Finally, this work would
conclude that the Genetic-BS pricing model is exactly practical.
Abstract: In this paper, genetic algorithm (GA) opmization technique is applied to design Flexible AC Transmission System (FACTS)-based damping controllers. Two types of controller structures, namely a proportional-integral (PI) and a lead-lag (LL) are considered. The design problem of the proposed controllers is formulated as an optimization problem and GA is employed to search for optimal controller parameters. By minimizing the time-domain based objective function, in which the deviation in the oscillatory rotor speed of the generator is involved; stability performance of the system is improved. The proposed controllers are tested on a weakly connected power system subjected to different disturbances. The non-linear simulation results are presented to show the effectiveness of the proposed controller and their ability to provide efficient damping of low frequency oscillations. It is also observed that the proposed SSSC-based controllers improve greatly the voltage profile of the system under severe disturbances. Further, the dynamic performances of both the PI and LL structured FACTS-controller are analyzed at different loading conditions and under various disturbance condition as well as under unbalanced fault conditions..
Abstract: In this paper, a new Genetic Algorithm (GA) based
methodology is proposed to optimize the Degree of Hybridization
(DOH) in a passenger parallel hybrid car. At first step, target
parameters for the vehicle are decided and then using ADvanced
VehIcle SimulatOR (ADVISOR) software, the variation pattern of
these target parameters, across the different DOHs, is extracted. At
the next step, a suitable cost function is defined and is optimized
using GA. In this paper, also a new technique has been proposed for
deciding the number of battery modules for each DOH, which leads
to a great improvement in the vehicle performance. The proposed
methodology is so simple, fast and at the same time, so efficient.
Abstract: This paper describes the optimization of a complex
dairy farm simulation model using two quite different methods of
optimization, the Genetic algorithm (GA) and the Lipschitz
Branch-and-Bound (LBB) algorithm. These techniques have been
used to improve an agricultural system model developed by Dexcel
Limited, New Zealand, which describes a detailed representation of
pastoral dairying scenarios and contains an 8-dimensional parameter
space. The model incorporates the sub-models of pasture growth and
animal metabolism, which are themselves complex in many cases.
Each evaluation of the objective function, a composite 'Farm
Performance Index (FPI)', requires simulation of at least a one-year
period of farm operation with a daily time-step, and is therefore
computationally expensive. The problem of visualization of the
objective function (response surface) in high-dimensional spaces is
also considered in the context of the farm optimization problem.
Adaptations of the sammon mapping and parallel coordinates
visualization are described which help visualize some important
properties of the model-s output topography. From this study, it is
found that GA requires fewer function evaluations in optimization
than the LBB algorithm.
Abstract: This study compares three meta heuristics to minimize makespan (Cmax) for Hybrid Flow Shop (HFS) Scheduling Problem with Parallel Machines. This problem is known to be NP-Hard. This study proposes three algorithms among improvement heuristic searches which are: Genetic Algorithm (GA), Simulated Annealing (SA), and Tabu Search (TS). SA and TS are known as deterministic improvement heuristic search. GA is known as stochastic improvement heuristic search. A comprehensive comparison from these three improvement heuristic searches is presented. The results for the experiments conducted show that TS is effective and efficient to solve HFS scheduling problems.
Abstract: An accurate and proficient artificial neural network
(ANN) based genetic algorithm (GA) is developed for predicting of
nanofluids viscosity. A genetic algorithm (GA) is used to optimize
the neural network parameters for minimizing the error between the
predictive viscosity and the experimental one. The experimental
viscosity in two nanofluids Al2O3-H2O and CuO-H2O from 278.15
to 343.15 K and volume fraction up to 15% were used from
literature. The result of this study reveals that GA-NN model is
outperform to the conventional neural nets in predicting the viscosity
of nanofluids with mean absolute relative error of 1.22% and 1.77%
for Al2O3-H2O and CuO-H2O, respectively. Furthermore, the results
of this work have also been compared with others models. The
findings of this work demonstrate that the GA-NN model is an
effective method for prediction viscosity of nanofluids and have
better accuracy and simplicity compared with the others models.