Abstract: By introducing the concept of Oracle we propose an approach for improving the performance of genetic algorithms for large-scale asymmetric Traveling Salesman Problems. The results have shown that the proposed approach allows overcoming some traditional problems for creating efficient genetic algorithms.
Abstract: The main objective of this paper is applying a
comparison between the Wolf Pack Search (WPS) as a newly
introduced intelligent algorithm with several other known algorithms
including Particle Swarm Optimization (PSO), Shuffled Frog
Leaping (SFL), Binary and Continues Genetic algorithms. All
algorithms are applied on two benchmark cost functions. The aim is
to identify the best algorithm in terms of more speed and accuracy in
finding the solution, where speed is measured in terms of function
evaluations. The simulation results show that the SFL algorithm with
less function evaluations becomes first if the simulation time is
important, while if accuracy is the significant issue, WPS and PSO
would have a better performance.
Abstract: In this work, Experimental tie-line results and
solubility (binodal) curves were obtained for the ternary systems
(water + acetic acid + methyl isobutyl ketone (MIBK)), (water +
lactic acid+ methyl isobutyl ketone) at T = 294.15K and atmospheric
pressure. The consistency of the values of the experimental tie-lines
was determined through the Othmer-Tobias and Hands correlations.
For the extraction effectiveness of solvents, the distribution and
selectivity curves were plotted. In addition, these experimental tieline
data were also correlated with NRTL model. The interaction
parameters for the NRTL model were retrieved from the obtained
experimental results by means of a combination of the homotopy
method and the genetic algorithms.
Abstract: This paper presents the speed regulation scheme of a small brushless dc motor (BLDC motor) with trapezoidal back-emf consideration. The proposed control strategy uses the proportional controller in which the proportional gain, kp, is appropriately adjusted by using genetic algorithms. As a result, the proportional control can perform well in order to compensate the BLDC motor with load disturbance. This confirms that the proposed speed regulation scheme gives satisfactory results.
Abstract: The design of a steam turbine is a very complex
engineering operation that can be simplified and improved thanks to
computer-aided multi-objective optimization. This process makes use
of existing optimization algorithms and losses correlations to identify
those geometries that deliver the best balance of performance (i.e.
Pareto-optimal points).
This paper deals with a one-dimensional multi-objective and
multi-point optimization of a single-stage steam turbine. Using a
genetic optimization algorithm and an algebraic one-dimensional
ideal gas-path model based on loss and deviation correlations, a code
capable of performing the optimization of a predefined steam turbine
stage was developed. More specifically, during this study the
parameters modified (i.e. decision variables) to identify the best
performing geometries were solidity and angles both for stator and
rotor cascades, while the objective functions to maximize were totalto-
static efficiency and specific work done.
Finally, an accurate analysis of the obtained results was carried
out.
Abstract: An enhanced particle swarm optimization algorithm
(PSO) is presented in this work to solve the non-convex OPF
problem that has both discrete and continuous optimization variables.
The objective functions considered are the conventional quadratic
function and the augmented quadratic function. The latter model
presents non-differentiable and non-convex regions that challenge
most gradient-based optimization algorithms. The optimization
variables to be optimized are the generator real power outputs and
voltage magnitudes, discrete transformer tap settings, and discrete
reactive power injections due to capacitor banks. The set of equality
constraints taken into account are the power flow equations while the
inequality ones are the limits of the real and reactive power of the
generators, voltage magnitude at each bus, transformer tap settings,
and capacitor banks reactive power injections. The proposed
algorithm combines PSO with Newton-Raphson algorithm to
minimize the fuel cost function. The IEEE 30-bus system with six
generating units is used to test the proposed algorithm. Several cases
were investigated to test and validate the consistency of detecting
optimal or near optimal solution for each objective. Results are
compared to solutions obtained using sequential quadratic
programming and Genetic Algorithms.
Abstract: The evolution of technology and construction techniques has enabled the upgrading of transport networks. In particular, the high-speed rail networks allow convoys to peak at above 300 km/h. These structures, however, often significantly impact the surrounding environment. Among the effects of greater importance are the ones provoked by the soundwave connected to train transit. The wave propagation affects the quality of life in areas surrounding the tracks, often for several hundred metres. There are substantial damages to properties (buildings and land), in terms of market depreciation. The present study, integrating expertise in acoustics, computering and evaluation fields, outlines a useful model to select project paths so as to minimize the noise impact and reduce the causes of possible litigation. It also facilitates the rational selection of initiatives to contain the environmental damage to the already existing railway tracks. The research is developed with reference to the Italian regulatory framework (usually more stringent than European and international standards) and refers to a case study concerning the high speed network in Italy.
Abstract: In this paper the design of maximally flat linear phase
finite impulse response (FIR) filters is considered. The problem is
handled with totally two different approaches. The first one is
completely deterministic numerical approach where the problem is
formulated as a Linear Complementarity Problem (LCP). The other
one is based on a combination of Markov Random Fields (MRF's)
approach with messy genetic algorithm (MGA). Markov Random
Fields (MRFs) are a class of probabilistic models that have been
applied for many years to the analysis of visual patterns or textures.
Our objective is to establish MRFs as an interesting approach to
modeling messy genetic algorithms. We establish a theoretical result
that every genetic algorithm problem can be characterized in terms of
a MRF model. This allows us to construct an explicit probabilistic
model of the MGA fitness function and introduce the Ising MGA.
Experimentations done with Ising MGA are less costly than those
done with standard MGA since much less computations are involved.
The least computations of all is for the LCP. Results of the LCP,
random search, random seeded search, MGA, and Ising MGA are
discussed.
Abstract: In this paper, we present optimal control for
movement and trajectory planning for four degrees-of-freedom robot
using Fuzzy Logic (FL) and Genetic Algorithms (GAs). We have
evaluated using Fuzzy Logic (FL) and Genetic Algorithms (GAs)
for four degree-of-freedom (4 DOF) robotics arm, Uncertainties like;
Movement, Friction and Settling Time in robotic arm movement
have been compensated using Fuzzy logic and Genetic Algorithms.
The development of a fuzzy genetic optimization algorithm is
presented and discussed. The result are compared only GA and
Fuzzy GA. This paper describes genetic algorithms, which is
designed to optimize robot movement and trajectory. Though the
model represents is a general model for redundant structures and
could represent any n-link structures. The result is a complete
trajectory planning with Fuzzy logic and Genetic algorithms
demonstrating the flexibility of this technique of artificial
intelligence.
Abstract: The present study presents a new approach to automatic
data clustering and classification problems in large and complex
databases and, at the same time, derives specific types of explicit rules
describing each cluster. The method works well in both sparse and
dense multidimensional data spaces. The members of the data space
can be of the same nature or represent different classes. A number
of N-dimensional ellipsoids are used for enclosing the data clouds.
Due to the geometry of an ellipsoid and its free rotation in space
the detection of clusters becomes very efficient. The method is based
on genetic algorithms that are used for the optimization of location,
orientation and geometric characteristics of the hyper-ellipsoids. The
proposed approach can serve as a basis for the development of
general knowledge systems for discovering hidden knowledge and
unexpected patterns and rules in various large databases.