Abstract: A numerical simulation of optimization all of electrospinning processing parameters to obtain smallest nanofiber diameter have been performed by employing genetic algorithm (GA). Fitness function in genetic algorithm methods, which was different for each parameter, was determined by simulation approach based on the Reneker’s model. Moreover, others genetic algorithm parameter, namely length of population, crossover and mutation were applied to get the optimum electrospinning processing parameters. In addition, minimum fiber diameter, 32 nm, was achieved from a simulation by applied the optimum parameters of electrospinning. This finding may be useful for process control and prediction of electrospun fiber production. In this paper, it is also compared between predicted parameters with some experimental results.
Abstract: In this paper a genetic algorithm (GA) with dual-fitness function is proposed and applied to solve the deterministic identical machine scheduling problem. The mating fitness function value was used to determine the mating for chromosomes, while the selection fitness function value was used to determine their survivals. The performance of this algorithm was tested on deterministic identical machine scheduling using simulated data. The results obtained from the proposed GA were compared with classical GA and integer programming (IP). Results showed that dual-fitness function GA outperformed the classical single-fitness function GA with statistical significance for large problems and was competitive to IP, particularly when large size problems were used.
Abstract: The Genetic Algorithm (GA) is one of the most important methods used to solve many combinatorial optimization problems. Therefore, many researchers have tried to improve the GA by using different methods and operations in order to find the optimal solution within reasonable time. This paper proposes an improved GA (IGA), where the new crossover operation, population reformulates operation, multi mutation operation, partial local optimal mutation operation, and rearrangement operation are used to solve the Traveling Salesman Problem. The proposed IGA was then compared with three GAs, which use different crossover operations and mutations. The results of this comparison show that the IGA can achieve better results for the solutions in a faster time.
Abstract: Realistic systems generally are systems with various
inputs and outputs also known as Multiple Input Multiple Output
(MIMO). Such systems usually prove to be complex and difficult to
model and control purposes. Therefore, decomposition was used to
separate individual inputs and outputs. A PID is assigned to each
individual pair to regulate desired settling time. Suitable parameters
of PIDs obtained from Genetic Algorithm (GA), using Mean of
Squared Error (MSE) objective function.
Abstract: The objective of this study is to present the test
results of variable air volume (VAV) air conditioning system
optimized by two objective genetic algorithm (GA). The objective
functions are energy savings and thermal comfort. The optimal set
points for fuzzy logic controller (FLC) are the supply air temperature
(Ts), the supply duct static pressure (Ps), the chilled water
temperature (Tw), and zone temperature (Tz) that is taken as the
problem variables. Supply airflow rate and chilled water flow rate are
considered to be the constraints. The optimal set point values are
obtained from GA process and assigned into fuzzy logic controller
(FLC) in order to conserve energy and maintain thermal comfort in
real time VAV air conditioning system. A VAV air conditioning
system with FLC installed in a software laboratory has been taken for
the purpose of energy analysis. The total energy saving obtained in
VAV GA optimization system with FLC compared with constant air
volume (CAV) system is expected to achieve 31.5%. The optimal
duct static pressure obtained through Genetic fuzzy methodology
attributes to better air distribution by delivering the optimal quantity
of supply air to the conditioned space. This combination enhanced
the advantages of uniform air distribution, thermal comfort and
improved energy savings potential.
Abstract: Charge Simulation Method (CSM) is one of the very widely used numerical field computation technique in High Voltage (HV) engineering. The high voltage fields of varying non uniformities are encountered in practice. CSM programs being case specific, the simulation accuracies heavily depend on the user (programmers) experience. Here is an effort to understand CSM errors and evolve some guidelines to setup accurate CSM models, relating non uniformities with assignment factors. The results are for the six-point-charge model of sphere-plane gap geometry. Using genetic algorithm (GA) as tool, optimum assignment factors at different non uniformity factors for this model have been evaluated and analyzed. It is shown that the symmetrically placed six-point-charge models can be good enough to set up CSM programs with potential errors less than 0.1% when the field non uniformity factor is greater than 2.64 (field utilization factor less than 52.76%).
Abstract: In this paper, an optimal design of linear phase digital
high pass finite impulse response (FIR) filter using Particle Swarm
Optimization with Constriction Factor and Inertia Weight Approach
(PSO-CFIWA) has been presented. In the design process, the filter
length, pass band and stop band frequencies, feasible pass band and
stop band ripple sizes are specified. FIR filter design is a multi-modal
optimization problem. The conventional gradient based optimization
techniques are not efficient for digital filter design. Given the filter
specifications to be realized, the PSO-CFIWA algorithm generates a
set of optimal filter coefficients and tries to meet the ideal frequency
response characteristic. In this paper, for the given problem, the
designs of the optimal FIR high pass filters of different orders have
been performed. The simulation results have been compared to those
obtained by the well accepted algorithms such as Parks and
McClellan algorithm (PM), genetic algorithm (GA). The results
justify that the proposed optimal filter design approach using PSOCFIWA
outperforms PM and GA, not only in the accuracy of the
designed filter but also in the convergence speed and solution
quality.
Abstract: The importance of supply chain and logistics
management has been widely recognised. Effective management of
the supply chain can reduce costs and lead times and improve
responsiveness to changing customer demands. This paper proposes a
multi-matrix real-coded Generic Algorithm (MRGA) based
optimisation tool that minimises total costs associated within supply
chain logistics. According to finite capacity constraints of all parties
within the chain, Genetic Algorithm (GA) often produces infeasible
chromosomes during initialisation and evolution processes. In the
proposed algorithm, chromosome initialisation procedure, crossover
and mutation operations that always guarantee feasible solutions
were embedded. The proposed algorithm was tested using three sizes
of benchmarking dataset of logistic chain network, which are typical
of those faced by most global manufacturing companies. A half
fractional factorial design was carried out to investigate the influence
of alternative crossover and mutation operators by varying GA
parameters. The analysis of experimental results suggested that the
quality of solutions obtained is sensitive to the ways in which the
genetic parameters and operators are set.
Abstract: This paper presents an efficient approach to feeder
reconfiguration for power loss reduction and voltage profile
imprvement in unbalanced radial distribution systems (URDS). In
this paper Genetic Algorithm (GA) is used to obtain solution for
reconfiguration of radial distribution systems to minimize the losses.
A forward and backward algorithm is used to calculate load flows in
unbalanced distribution systems. By simulating the survival of the
fittest among the strings, the optimum string is searched by
randomized information exchange between strings by performing
crossover and mutation. Results have shown that proposed algorithm
has advantages over previous algorithms The proposed method is
effectively tested on 19 node and 25 node unbalanced radial
distribution systems.
Abstract: In the context of spectrum surveillance, a method to
recover the code of spread spectrum signal is presented, whereas the
receiver has no knowledge of the transmitter-s spreading sequence.
The approach is based on a genetic algorithm (GA), which is forced to
model the received signal. Genetic algorithms (GAs) are well known
for their robustness in solving complex optimization problems.
Experimental results show that the method provides a good
estimation, even when the signal power is below the noise power.
Abstract: This work proposes an approach to address automatic
text summarization. This approach is a trainable summarizer, which
takes into account several features, including sentence position,
positive keyword, negative keyword, sentence centrality, sentence
resemblance to the title, sentence inclusion of name entity, sentence
inclusion of numerical data, sentence relative length, Bushy path of
the sentence and aggregated similarity for each sentence to generate
summaries. First we investigate the effect of each sentence feature on
the summarization task. Then we use all features score function to
train genetic algorithm (GA) and mathematical regression (MR)
models to obtain a suitable combination of feature weights. The
proposed approach performance is measured at several compression
rates on a data corpus composed of 100 English religious articles.
The results of the proposed approach are promising.
Abstract: Several researchers have proposed methods about
combination of Genetic Algorithm (GA) and Fuzzy Logic (the use of
GA to obtain fuzzy rules and application of fuzzy logic in
optimization of GA). In this paper, we suggest a new method in
which fuzzy decision making is used to improve the performance of
genetic algorithm. In the suggested method, we determine the alleles
that enhance the fitness of chromosomes and try to insert them to the
next generation.
In this algorithm we try to present an innovative vaccination in the
process of reproduction in genetic algorithm, with considering the
trade off between exploration and exploitation.
Abstract: In this paper, we propose a new hybrid learning model for stock market indices prediction by adding a passive congregation term to the standard hybrid model comprising Particle Swarm Optimization (PSO) with Genetic Algorithm (GA) operators in training Neural Networks (NN). This new passive congregation term is based on the cooperation between different particles in determining new positions rather than depending on the particles selfish thinking without considering other particles positions, thus it enables PSO to perform both the local and global search instead of only doing the local search. Experiment study carried out on the most famous European stock market indices in both long term and short term prediction shows significantly the influence of the passive congregation term in improving the prediction accuracy compared to standard hybrid model.
Abstract: This paper presents a comparison of metaheuristic
algorithms, Genetic Algorithm (GA) and Ant Colony Optimization
(ACO), in producing freeman chain code (FCC). The main problem
in representing characters using FCC is the length of the FCC
depends on the starting points. Isolated characters, especially the
upper-case characters, usually have branches that make the traversing
process difficult. The study in FCC construction using one
continuous route has not been widely explored. This is our
motivation to use the population-based metaheuristics. The
experimental result shows that the route length using GA is better
than ACO, however, ACO is better in computation time than GA.
Abstract: Design for cost (DFC) is a method that reduces life
cycle cost (LCC) from the angle of designers. Multiple domain
features mapping (MDFM) methodology was given in DFC. Using
MDFM, we can use design features to estimate the LCC. From the
angle of DFC, the design features of family cars were obtained, such
as all dimensions, engine power and emission volume. At the
conceptual design stage, cars- LCC were estimated using back
propagation (BP) artificial neural networks (ANN) method and
case-based reasoning (CBR). Hamming space was used to measure the
similarity among cases in CBR method. Levenberg-Marquardt (LM)
algorithm and genetic algorithm (GA) were used in ANN. The
differences of LCC estimation model between CBR and artificial
neural networks (ANN) were provided. ANN and CBR separately
each method has its shortcomings. By combining ANN and CBR
improved results accuracy was obtained. Firstly, using ANN selected
some design features that affect LCC. Then using LCC estimation
results of ANN could raise the accuracy of LCC estimation in CBR
method. Thirdly, using ANN estimate LCC errors and correct errors in
CBR-s estimation results if the accuracy is not enough accurate.
Finally, economically family cars and sport utility vehicle (SUV) was
given as LCC estimation cases using this hybrid approach combining
ANN and CBR.
Abstract: This paper describes about the process of recognition and classification of brain images such as normal and abnormal based on PSO-SVM. Image Classification is becoming more important for medical diagnosis process. In medical area especially for diagnosis the abnormality of the patient is classified, which plays a great role for the doctors to diagnosis the patient according to the severeness of the diseases. In case of DICOM images it is very tough for optimal recognition and early detection of diseases. Our work focuses on recognition and classification of DICOM image based on collective approach of digital image processing. For optimal recognition and classification Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Support Vector Machine (SVM) are used. The collective approach by using PSO-SVM gives high approximation capability and much faster convergence.
Abstract: This paper considers a scheduling problem in flexible
flow shops environment with the aim of minimizing two important
criteria including makespan and cumulative tardiness of jobs. Since
the proposed problem is known as an Np-hard problem in literature,
we have to develop a meta-heuristic to solve it. We considered
general structure of Genetic Algorithm (GA) and developed a new
version of that based on Data Envelopment Analysis (DEA). Two
objective functions assumed as two different inputs for each Decision
Making Unit (DMU). In this paper we focused on efficiency score of
DMUs and efficient frontier concept in DEA technique. After
introducing the method we defined two different scenarios with
considering two types of mutation operator. Also we provided an
experimental design with some computational results to show the
performance of algorithm. The results show that the algorithm
implements in a reasonable time.
Abstract: A proposed small-signal model parameters for a pseudomorphic high electron mobility transistor (PHEMT) is presented. Both extrinsic and intrinsic circuit elements of a smallsignal model are determined using genetic algorithm (GA) as a stochastic global search and optimization tool. The parameters extraction of the small-signal model is performed on 200-μm gate width AlGaAs/InGaAs PHEMT. The equivalent circuit elements for a proposed 18 elements model are determined directly from the measured S- parameters. The GA is used to extract the parameters of the proposed small-signal model from 0.5 up to 18 GHz.
Abstract: The genetic algorithm (GA) based solution techniques
are found suitable for optimization because of their ability of
simultaneous multidimensional search. Many GA-variants have been
tried in the past to solve optimal power flow (OPF), one of the
nonlinear problems of electric power system. The issues like
convergence speed and accuracy of the optimal solution obtained
after number of generations using GA techniques and handling
system constraints in OPF are subjects of discussion. The results
obtained for GA-Fuzzy OPF on various power systems have shown
faster convergence and lesser generation costs as compared to other
approaches. This paper presents an enhanced GA-Fuzzy OPF (EGAOPF)
using penalty factors to handle line flow constraints and load
bus voltage limits for both normal network and contingency case
with congestion. In addition to crossover and mutation rate
adaptation scheme that adapts crossover and mutation probabilities
for each generation based on fitness values of previous generations, a
block swap operator is also incorporated in proposed EGA-OPF. The
line flow limits and load bus voltage magnitude limits are handled by
incorporating line overflow and load voltage penalty factors
respectively in each chromosome fitness function. The effects of
different penalty factors settings are also analyzed under contingent
state.
Abstract: Asynchronous Transfer Mode (ATM) is widely used
in telecommunications systems to send data, video and voice at a
very high speed. In ATM network optimizing the bandwidth through
dynamic routing is an important consideration. Previous research
work shows that traditional optimization heuristics result in suboptimal
solution. In this paper we have explored non-traditional
optimization technique. We propose comparison of two such
algorithms - Genetic Algorithm (GA) and Tabu search (TS), based on
non-traditional Optimization approach, for solving the dynamic
routing problem in ATM networks which in return will optimize the
bandwidth. The optimized bandwidth could mean that some
attractive business applications would become feasible such as high
speed LAN interconnection, teleconferencing etc. We have also
performed a comparative study of the selection mechanisms in GA
and listed the best selection mechanism and a new initialization
technique which improves the efficiency of the GA.