Abstract: Web service composition combines available services
to provide new functionality. Given the number of available
services with similar functionalities and different non functional
aspects (QoS), the problem of finding a QoS-optimal web service
composition is considered as an optimization problem belonging to
NP-hard class. Thus, an optimal solution cannot be found by exact
algorithms within a reasonable time. In this paper, a meta-heuristic
bio-inspired is presented to address the QoS aware web service
composition; it is based on Elephant Herding Optimization (EHO)
algorithm, which is inspired by the herding behavior of elephant
group. EHO is characterized by a process of dividing and combining
the population to sub populations (clan); this process allows the
exchange of information between local searches to move toward
a global optimum. However, with Applying others evolutionary
algorithms the problem of early stagnancy in a local optimum
cannot be avoided. Compared with PSO, the results of experimental
evaluation show that our proposition significantly outperforms the
existing algorithm with better performance of the fitness value and a
fast convergence.
Abstract: The crossover probability and mutation probability are the two important factors in genetic algorithm. The adaptive genetic algorithm can improve the convergence performance of genetic algorithm, in which the crossover probability and mutation probability are adaptively designed with the changes of fitness value. We apply adaptive genetic algorithm into a function optimization problem. The numerical experiment represents that adaptive genetic algorithm improves the convergence speed and avoids local convergence.
Abstract: Prior literature in the field of adaptive and
personalized learning sequence in e-learning have proposed and
implemented various mechanisms to improve the learning process
such as individualization and personalization, but complex to
implement due to expensive algorithmic programming and need of
extensive and prior data. The main objective of personalizing
learning sequence is to maximize learning by dynamically selecting
the closest teaching operation in order to achieve the learning
competency of learner. In this paper, a revolutionary technique has
been proposed and tested to perform individualization and
personalization using modified reversed roulette wheel selection
algorithm that runs at O(n). The technique is simpler to implement
and is algorithmically less expensive compared to other revolutionary
algorithms since it collects the dynamic real time performance matrix
such as examinations, reviews, and study to form the RWSA single
numerical fitness value. Results show that the implemented system is
capable of recommending new learning sequences that lessens time
of study based on student's prior knowledge and real performance
matrix.
Abstract: Recognition of Indian languages scripts is challenging problems. In Optical Character Recognition [OCR], a character or symbol to be recognized can be machine printed or handwritten characters/numerals. There are several approaches that deal with problem of recognition of numerals/character depending on the type of feature extracted and different way of extracting them. This paper proposes a recognition scheme for handwritten Hindi (devnagiri) numerals; most admired one in Indian subcontinent. Our work focused on a technique in feature extraction i.e. global based approach using end-points information, which is extracted from images of isolated numerals. These feature vectors are fed to neuro-memetic model [18] that has been trained to recognize a Hindi numeral. The archetype of system has been tested on varieties of image of numerals. . In proposed scheme data sets are fed to neuro-memetic algorithm, which identifies the rule with highest fitness value of nearly 100 % & template associates with this rule is nothing but identified numerals. Experimentation result shows that recognition rate is 92-97 % compared to other models.
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: This paper presents a particle swarm optimization
(PSO) based approach for multiple object tracking based on histogram
matching. To start with, gray-level histograms are calculated to
establish a feature model for each of the target object. The difference
between the gray-level histogram corresponding to each particle in the
search space and the target object is used as the fitness value. Multiple
swarms are created depending on the number of the target objects
under tracking. Because of the efficiency and simplicity of the PSO
algorithm for global optimization, target objects can be tracked as
iterations continue. Experimental results confirm that the proposed
PSO algorithm can rapidly converge, allowing real-time tracking of
each target object. When the objects being tracked move outside the
tracking range, global search capability of the PSO resumes to re-trace
the target objects.
Abstract: The purpose of this study was to examine and
compare physical fitness values of students engaged in different team
sport branches Totally 60 female, and 60 male athletes, that 20
athletes in each branch which are volleyball, basketball and football
participated the study as a volunteer. The mean ages of female and
male athletes were 21.20 ±1.87 and 21.61 ± 1.61 respectively. Age,
height, body weight, body mass index, flexibility, body fat
percentage, 30m sprint, maximum oxygen consumption capacity
(MaxVO2) and drop jump values were measured. As a result of
measurements, significant differences were found in height, weight,
MaxVO2, shuttle run speed between different sports branches in
female athletes. In male athletes, height, body weight, flexibility,
30m split speed and drop jump values were found significantly
different between sports branches.
As a conclusion and as a literature, it can be said that structure of
body has to be appropriate with the engaged sports branch. Physical
fitness values that required the sports branches can be expressed
clearly by increasing the number of subjects.
Abstract: This article proposes a novel Pareto-based multiobjective
meta-heuristic algorithm named non-dominated ranking
genetic algorithm (NRGA) to solve multi-facility location-allocation
problem. In NRGA, a fitness value representing rank is assigned to
each individual of the population. Moreover, two features ranked
based roulette wheel selection including select the fronts and choose
solutions from the fronts, are utilized. The proposed solving
methodology is validated using several examples taken from the
specialized literature. The performance of our approach shows that
NRGA algorithm is able to generate true and well distributed Pareto
optimal solutions.
Abstract: In this paper, we have proposed a low cost optimized solution for the movement of a three-arm manipulator using Genetic Algorithm (GA) and Analytical Hierarchy Process (AHP). A scheme is given for optimizing the movement of robotic arm with the help of Genetic Algorithm so that the minimum energy consumption criteria can be achieved. As compared to Direct Kinematics, Inverse Kinematics evolved two solutions out of which the best-fit solution is selected with the help of Genetic Algorithm and is kept in search space for future use. The Inverse Kinematics, Fitness Value evaluation and Binary Encoding like tasks are simulated and tested. Although, three factors viz. Movement, Friction and Least Settling Time (or Min. Vibration) are used for finding the Fitness Function / Fitness Values, however some more factors can also be considered.
Abstract: A new method for color image segmentation using fuzzy logic is proposed in this paper. Our aim here is to automatically produce a fuzzy system for color classification and image segmentation with least number of rules and minimum error rate. Particle swarm optimization is a sub class of evolutionary algorithms that has been inspired from social behavior of fishes, bees, birds, etc, that live together in colonies. We use comprehensive learning particle swarm optimization (CLPSO) technique to find optimal fuzzy rules and membership functions because it discourages premature convergence. Here each particle of the swarm codes a set of fuzzy rules. During evolution, a population member tries to maximize a fitness criterion which is here high classification rate and small number of rules. Finally, particle with the highest fitness value is selected as the best set of fuzzy rules for image segmentation. Our results, using this method for soccer field image segmentation in Robocop contests shows 89% performance. Less computational load is needed when using this method compared with other methods like ANFIS, because it generates a smaller number of fuzzy rules. Large train dataset and its variety, makes the proposed method invariant to illumination noise
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.