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: Feature and model selection are in the center of
attention of many researches because of their impact on classifiers-
performance. Both selections are usually performed separately but
recent developments suggest using a combined GA-SVM approach to
perform them simultaneously. This approach improves the
performance of the classifier identifying the best subset of variables
and the optimal parameters- values. Although GA-SVM is an
effective method it is computationally expensive, thus a rough
method can be considered. The paper investigates a joined approach
of Genetic Algorithm and kernel matrix criteria to perform
simultaneously feature and model selection for SVM classification
problem. The purpose of this research is to improve the classification
performance of SVM through an efficient approach, the Kernel
Matrix Genetic Algorithm method (KMGA).
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: The main goal of this work is to propose a way for
combined use of two nontraditional algorithms by solving topological
problems on telecommunications concentrator networks. The
algorithms suggested are the Simulated Annealing algorithm and the
Genetic Algorithm. The Algorithm of Simulated Annealing unifies
the well known local search algorithms. In addition - Simulated
Annealing allows acceptation of moves in the search space witch lead
to decisions with higher cost in order to attempt to overcome any
local minima obtained. The Genetic Algorithm is a heuristic approach
witch is being used in wide areas of optimization works. In the last
years this approach is also widely implemented in
Telecommunications Networks Planning. In order to solve less or
more complex planning problem it is important to find the most
appropriate parameters for initializing the function of the algorithm.
Abstract: Several approaches such as linear programming, network
modeling, greedy heuristic and decision support system are well-known
approaches in solving irregular airline operation problem. This paper
presents an alternative approach based on Multi Objective Micro Genetic
Algorithm. The aim of this research is to introduce the concept of Multi
Objective Micro Genetic Algorithm as a tool to solve irregular airline
operation, combine and reroute problem. The experiment result indicated
that the model could obtain optimal solutions within a few second.
Abstract: In the control theory one attempts to find a controller
that provides the best possible performance with respect to some
given measures of performance. There are many sorts of controllers
e.g. a typical PID controller, LQR controller, Fuzzy controller etc. In
the paper will be introduced polynomial controller with novel tuning
method which is based on the special pole placement encoding
scheme and optimization by Genetic Algorithms (GA). The examples
will show the performance of the novel designed polynomial
controller with comparison to common PID controller.
Abstract: Transmission network expansion planning (TNEP) is a basic part of power system planning that determines where, when and how many new transmission lines should be added to the network. Up till now, various methods have been presented to solve the static transmission network expansion planning (STNEP) problem. But in all of these methods, lines adequacy rate has not been considered at the end of planning horizon, i.e., expanded network misses adequacy after some times and needs to be expanded again. In this paper, expansion planning has been implemented by merging lines loading parameter in the STNEP and inserting investment cost into the fitness function constraints using genetic algorithm. Expanded network will possess a maximum adequacy to provide load demand and also the transmission lines overloaded later. Finally, adequacy index could be defined and used to compare some designs that have different investment costs and adequacy rates. In this paper, the proposed idea has been tested on the Garvers network. The results show that the network will possess maximum efficiency economically.
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: Load managing method on road became necessary
since overloaded vehicles occur damage on road facilities and existing
systems for preventing this damage still show many
problems.Accordingly, efficient managing system for preventing
overloaded vehicles could be organized by using the road itself as a
scale by applying genetic algorithm to analyze the load and the drive
information of vehicles.Therefore, this paper organized Ubiquitous
sensor network system for development of intelligent overload vehicle
regulation system, also in this study, to use the behavior of road, the
transformation was measured by installing underground box type
indoor model and indoor experiment was held using genetic algorithm.
And we examined wireless possibility of overloaded vehicle
regulation system through experiment of the transmission and
reception distance.If this system will apply to road and bridge, might
be effective for economy and convenience through establishment of
U-IT system..
Abstract: This paper presents a systematic approach for
designing Static Synchronous Series Compensator (SSSC) based
supplementary damping controllers for damping low frequency
oscillations in a single-machine infinite-bus power system. The
design problem of the proposed controller is formulated as an
optimization problem and RCGA 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. Simulation results are presented and compared
with a conventional method of tuning the damping controller
parameters to show the effectiveness and robustness of the proposed
design approach.
Abstract: In this paper, we focus on the use of knowledge bases
in two different application areas – control of systems with unknown
or strongly nonlinear models (i.e. hardly controllable by the classical
methods), and robot motion planning in eight directions. The first
one deals with fuzzy logic and the paper presents approaches for
setting and aggregating the rules of a knowledge base. Te second one
is concentrated on a case-based reasoning strategy for finding the
path in a planar scene with obstacles.
Abstract: Several optimization algorithms specifically applied to
the problem of Operation Planning of Hydrothermal Power Systems
have been developed and are used. Although providing solutions to
various problems encountered, these algorithms have some
weaknesses, difficulties in convergence, simplification of the original
formulation of the problem, or owing to the complexity of the
objective function. Thus, this paper presents the development of a
computational tool for solving optimization problem identified and to
provide the User an easy handling. Adopted as intelligent
optimization technique, Genetic Algorithms and programming
language Java. First made the modeling of the chromosomes, then
implemented the function assessment of the problem and the
operators involved, and finally the drafting of the graphical interfaces
for access to the User. The program has managed to relate a coherent
performance in problem resolution without the need for
simplification of the calculations together with the ease of
manipulating the parameters of simulation and visualization of output
results.
Abstract: The Resource-Constrained Project Scheduling
Problem (RCPSP) is concerned with single-item or small batch
production where limited resources have to be allocated to dependent
activities over time. Over the past few decades, a lot of work has
been made with the use of optimal solution procedures for this basic
problem type and its extensions. Brucker and Knust[1] discuss, how
timetabling problems can be modeled as a RCPSP. Authors discuss
high school timetabling and university course timetabling problem as
an example. We have formulated two mathematical formulations of
course timetabling problem in a new way which are the prototype of
single-mode RCPSP. Our focus is to show, how course timetabling
problem can be transformed into RCPSP. We solve this
transformation model with genetic algorithm.
Abstract: Supply chain consists of all stages involved, directly
or indirectly, includes all functions involved in fulfilling a customer
demand. In two stage transportation supply chain problem,
transportation costs are of a significant proportion of final product
costs. It is often crucial for successful decisions making approaches
in two stage supply chain to explicit account for non-linear
transportation costs. In this paper, deterministic demand and finite
supply of products was considered. The optimized distribution level
and the routing structure from the manufacturing plants to the
distribution centres and to the end customers is determined using
developed mathematical model and solved by proposed particle
swarm optimization based genetic algorithm. Numerical analysis of
the case study is carried out to validate the model.
Abstract: In the modern manufacturing systems, the use of
thermal cutting techniques using oxyfuel, plasma and laser have
become indispensable for the shape forming of high quality complex
components; however, the conventional chip removal production
techniques still have its widespread space in the manufacturing
industry. Both these types of machining operations require the
positioning of end effector tool at the edge where the cutting process
commences. This repositioning of the cutting tool in every machining
operation is repeated several times and is termed as non-productive
time or airtime motion. Minimization of this non-productive
machining time plays an important role in mass production with high
speed machining. As, the tool moves from one region to the other by
rapid movement and visits a meticulous region once in the whole
operation, hence the non-productive time can be minimized by
synchronizing the tool movements. In this work, this problem is
being formulated as a general travelling salesman problem (TSP) and
a genetic algorithm approach has been applied to solve the same. For
improving the efficiency of the algorithm, the GA has been
hybridized with a noble special heuristic and simulating annealing
(SA). In the present work a novel heuristic in the combination of GA
has been developed for synchronization of toolpath movements
during repositioning of the tool. A comparative analysis of new Meta
heuristic techniques with simple genetic algorithm has been
performed. The proposed metaheuristic approach shows better
performance than simple genetic algorithm for minimization of nonproductive
toolpath length. Also, the results obtained with the help of
hybrid simulated annealing genetic algorithm (HSAGA) are also
found better than the results using simple genetic algorithm only.
Abstract: Transmission network expansion planning (TNEP) is an important component of power system planning that its task is to minimize the network construction and operational cost while satisfying the demand increasing, imposed technical and economic conditions. Up till now, various methods have been presented to solve the static transmission network expansion planning (STNEP) problem. But in all of these methods, the lines adequacy rate has not been studied after the planning horizon, i.e. when the expanded network misses its adequacy and needs to be expanded again. In this paper, in order to take transmission lines condition after expansion in to account from the line loading view point, the adequacy of transmission network is considered for solution of STNEP problem. To obtain optimal network arrangement, a decimal codification genetic algorithm (DCGA) is being used for minimizing the network construction and operational cost. The effectiveness of the proposed idea is tested on the Garver's six-bus network. The results evaluation reveals that the annual worth of network adequacy has a considerable effect on the network arrangement. In addition, the obtained network, based on the DCGA, has lower investment cost and higher adequacy rate. Thus, the network satisfies the requirements of delivering electric power more safely and reliably to load centers.
Abstract: A new genetic algorithm, termed the 'optimum individual monogenetic genetic algorithm' (OIMGA), is presented whose properties have been deliberately designed to be well suited to hardware implementation. Specific design criteria were to ensure fast access to the individuals in the population, to keep the required silicon area for hardware implementation to a minimum and to incorporate flexibility in the structure for the targeting of a range of applications. The first two criteria are met by retaining only the current optimum individual, thereby guaranteeing a small memory requirement that can easily be stored in fast on-chip memory. Also, OIMGA can be easily reconfigured to allow the investigation of problems that normally warrant either large GA populations or individuals many genes in length. Local convergence is achieved in OIMGA by retaining elite individuals, while population diversity is ensured by continually searching for the best individuals in fresh regions of the search space. The results given in this paper demonstrate that both the performance of OIMGA and its convergence time are superior to those of a range of existing hardware GA implementations.
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: In this paper, an artificial intelligent technique for
robust digital image watermarking in multiwavelet domain is
proposed. The embedding technique is based on the quantization
index modulation technique and the watermark extraction process
does not require the original image. We have developed an
optimization technique using the genetic algorithms to search for
optimal quantization steps to improve the quality of watermarked
image and robustness of the watermark. In addition, we construct a
prediction model based on image moments and back propagation
neural network to correct an attacked image geometrically before the
watermark extraction process begins. The experimental results show
that the proposed watermarking algorithm yields watermarked image
with good imperceptibility and very robust watermark against various
image processing attacks.