Abstract: In this paper the direct kinematic model of a multiple
applications three degrees of freedom industrial manipulator, was
developed using the homogeneous transformation matrices and the
Denavit - Hartenberg parameters, likewise the inverse kinematic
model was developed using the same method, verifying that in the
workload border the inverse kinematic presents considerable errors,
therefore a genetic algorithm was implemented to optimize the model
improving greatly the efficiency of the model.
Abstract: Recently, genetic algorithms (GA) and particle swarm optimization (PSO) technique have attracted considerable attention among various modern heuristic optimization techniques. The GA has been popular in academia and the industry mainly because of its intuitiveness, ease of implementation, and the ability to effectively solve highly non-linear, mixed integer optimization problems that are typical of complex engineering systems. PSO technique is a relatively recent heuristic search method whose mechanics are inspired by the swarming or collaborative behavior of biological populations. In this paper both PSO and GA optimization are employed for finding stable reduced order models of single-input- single-output large-scale linear systems. Both the techniques guarantee stability of reduced order model if the original high order model is stable. PSO method is based on the minimization of the Integral Squared Error (ISE) between the transient responses of original higher order model and the reduced order model pertaining to a unit step input. Both the methods are illustrated through numerical example from literature and the results are compared with recently published conventional model reduction technique.
Abstract: Sharing the manufacturing facility through remote
operation and monitoring of a machining process is challenge for
effective use the production facility. Several automation tools in term
of hardware and software are necessary for successfully remote
operation of a machine. This paper presents a prototype of workpiece
holding attachment for remote operation of milling process by self
configuration the workpiece setup. The prototype is designed with
mechanism to reorient the work surface into machining spindle
direction with high positioning accuracy. Variety of parts geometry
is hold by attachment to perform single setup machining. Pin type
with array pattern additionally clamps the workpiece surface from
two opposite directions for increasing the machining rigidity.
Optimum pins configuration for conforming the workpiece geometry
with minimum deformation is determined through hybrid algorithms,
Genetic Algorithms (GA) and Particle Swarm Optimization (PSO).
Prototype with intelligent optimization technique enables to hold
several variety of workpiece geometry which is suitable for
machining low of repetitive production in remote operation.
Abstract: Several works regarding facial recognition have dealt with methods which identify isolated characteristics of the face or with templates which encompass several regions of it. In this paper a new technique which approaches the problem holistically dispensing with the need to identify geometrical characteristics or regions of the face is introduced. The characterization of a face is achieved by randomly sampling selected attributes of the pixels of its image. From this information we construct a set of data, which correspond to the values of low frequencies, gradient, entropy and another several characteristics of pixel of the image. Generating a set of “p" variables. The multivariate data set with different polynomials minimizing the data fitness error in the minimax sense (L∞ - Norm) is approximated. With the use of a Genetic Algorithm (GA) it is able to circumvent the problem of dimensionality inherent to higher degree polynomial approximations. The GA yields the degree and values of a set of coefficients of the polynomials approximating of the image of a face. By finding a family of characteristic polynomials from several variables (pixel characteristics) for each face (say Fi ) in the data base through a resampling process the system in use, is trained. A face (say F ) is recognized by finding its characteristic polynomials and using an AdaBoost Classifier from F -s polynomials to each of the Fi -s polynomials. The winner is the polynomial family closer to F -s corresponding to target face in data base.
Abstract: Prior research has not effectively investigated how the
profitability of Chinese branches affect FDIs in China [1, 2], so this
study for the first time incorporates realistic earnings information
to systematically investigate effects of innovation, imitation, and
profit factors of FDI diffusions from Taiwan to China. Our nonlinear
least square (NLS) model, which incorporates earnings factors,
forms a nonlinear ordinary differential equation (ODE) in numerical
simulation programs. The model parameters are obtained through
a genetic algorithms (GA) technique and then optimized with the
collected data for the best accuracy. Particularly, Taiwanese regulatory
FDI restrictions are also considered in our modified model to meet
the realistic conditions. To validate the model-s effectiveness, this
investigation compares the prediction accuracy of modified model
with the conventional diffusion model, which does not take account
of the profitability factors.
The results clearly demonstrate the internal influence to be positive,
as early FDI adopters- consistent praises of FDI attract potential firms
to make the same move. The former erects a behavior model for the
latter to imitate their foreign investment decision. Particularly, the
results of modified diffusion models show that the earnings from
Chinese branches are positively related to the internal influence. In
general, the imitating tendency of potential consumers is substantially
hindered by the losses in the Chinese branches, and these firms would
invest less into China. The FDI inflow extension depends on earnings
of Chinese branches, and companies will adjust their FDI strategies
based on the returns. Since this research has proved that earning is
an influential factor on FDI dynamics, our revised model explicitly
performs superior in prediction ability than conventional diffusion
model.
Abstract: A stiffened laminated composite panel (1 m length ×
0.5m width) was optimized for minimum weight and deflection under
several constraints using genetic algorithm. Here, a significant study
on the performance of a penalty function with two kinds of static and
dynamic penalty factors was conducted. The results have shown that
linear dynamic penalty factors are more effective than the static ones.
Also, a specially combined linear-exponential function has shown to
perform more effective than the previously mentioned penalty
functions. This was then resulted in the less sensitivity of the GA to
the amount of penalty factor.
Abstract: The Chiu-s method which generates a Takagi-Sugeno Fuzzy Inference System (FIS) is a method of fuzzy rules extraction. The rules output is a linear function of inputs. In addition, these rules are not explicit for the expert. In this paper, we develop a method which generates Mamdani FIS, where the rules output is fuzzy. The method proceeds in two steps: first, it uses the subtractive clustering principle to estimate both the number of clusters and the initial locations of a cluster centers. Each obtained cluster corresponds to a Mamdani fuzzy rule. Then, it optimizes the fuzzy model parameters by applying a genetic algorithm. This method is illustrated on a traffic network management application. We suggest also a Mamdani fuzzy rules generation method, where the expert wants to classify the output variables in some fuzzy predefined classes.
Abstract: Dealing with hundreds of features in character
recognition systems is not unusual. This large number of features
leads to the increase of computational workload of recognition
process. There have been many methods which try to remove
unnecessary or redundant features and reduce feature dimensionality.
Besides because of the characteristics of Farsi scripts, it-s not
possible to apply other languages algorithms to Farsi directly. In this
paper some methods for feature subset selection using genetic
algorithms are applied on a Farsi optical character recognition (OCR)
system. Experimental results show that application of genetic
algorithms (GA) to feature subset selection in a Farsi OCR results in
lower computational complexity and enhanced recognition rate.
Abstract: Nowadays, the challenge in hydraulic turbine design is
the multi-objective design of turbine runner to reach higher
efficiency. The hydraulic performance of a turbine is strictly depends
on runner blades shape. The present paper focuses on the application
of the multi-objective optimization algorithm to the design of a small
Francis turbine runner. The optimization exercise focuses on the
efficiency improvement at the best efficiency operating point (BEP)
of the GAMM Francis turbine. A global optimization method based
on artificial neural networks (ANN) and genetic algorithms (GA)
coupled by 3D Navier-Stokes flow solver has been used to improve
the performance of an initial geometry of a Francis runner. The
results show the good ability of optimization algorithm and the final
geometry has better efficiency with initial geometry. The goal was to
optimize the geometry of the blades of GAMM turbine runner which
leads to maximum total efficiency by changing the design parameters
of camber line in at least 5 sections of a blade. The efficiency of the
optimized geometry is improved from 90.7% to 92.5%. Finally,
design parameters and the way of selection have been considered and
discussed.
Abstract: Investment in a constructed facility represents a cost in
the short term that returns benefits only over the long term use of the
facility. Thus, the costs occur earlier than the benefits, and the owners
of facilities must obtain the capital resources to finance the costs of
construction. A project cannot proceed without an adequate
financing, and the cost of providing an adequate financing can be
quite large. For these reasons, the attention to the project finance is an
important aspect of project management. Finance is also a concern to
the other organizations involved in a project such as the general
contractor and material suppliers. Unless an owner immediately and
completely covers the costs incurred by each participant, these
organizations face financing problems of their own. At a more
general level, the project finance is the only one aspect of the general
problem of corporate finance. If numerous projects are considered
and financed together, then the net cash flow requirements constitute
the corporate financing problem for capital investment. Whether
project finance is performed at the project or at the corporate level
does not alter the basic financing problem .In this paper, we will first
consider facility financing from the owner's perspective, with due
consideration for its interaction with other organizations involved in a
project. Later, we discuss the problems of construction financing
which are crucial to the profitability and solvency of construction
contractors. The objective of this paper is to present the steps utilized
to determine the best combination of minimum project financing.
The proposed model considers financing; schedule and maximum net
area .The proposed model is called Project Financing and Schedule
Integration using Genetic Algorithms "PFSIGA". This model
intended to determine more steps (maximum net area) for any project
with a subproject. An illustrative example will demonstrate the
feature of this technique. The model verification and testing are put
into consideration.
Abstract: In some real applications of Statistical Process Control
it is necessary to design a control chart to not detect small process
shifts, but keeping a good performance to detect moderate and large
shifts in the quality. In this work we develop a new quality control
chart, the synthetic T2 control chart, that can be designed to cope with
this objective. A multi-objective optimization is carried out employing
Genetic Algorithms, finding the Pareto-optimal front of
non-dominated solutions for this optimization problem.
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: Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.
Abstract: In this work Artificial Intelligence (AI) techniques like Fuzzy logic, Genetic Algorithms and Particle Swarm Optimization have been used to improve the performance of the Automatic Generation Control (AGC) system. Instead of applying Genetic Algorithms and Particle swarm optimization independently for optimizing the parameters of the conventional AGC with PI controller, an intelligent tuned Fuzzy logic controller (acting as the secondary controller in the AGC system) has been designed. The controller gives an improved dynamic performance for both hydrothermal and thermal-thermal power systems under a variety of operating conditions.
Abstract: Due to the non- intuitive nature of Quantum
algorithms, it becomes difficult for a classically trained person to
efficiently construct new ones. So rather than designing new
algorithms manually, lately, Genetic algorithms (GA) are being
implemented for this purpose. GA is a technique to automatically
solve a problem using principles of Darwinian evolution. This has
been implemented to explore the possibility of evolving an n-qubit
circuit when the circuit matrix has been provided using a set of
single, two and three qubit gates. Using a variable length population
and universal stochastic selection procedure, a number of possible
solution circuits, with different number of gates can be obtained for
the same input matrix during different runs of GA. The given
algorithm has also been successfully implemented to obtain two and
three qubit Boolean circuits using Quantum gates. The results
demonstrate the effectiveness of the GA procedure even when the
search spaces are large.
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: In this paper, a novel associative memory model will be proposed and applied to memory retrievals based on the conventional continuous time model. The conventional model presents memory capacity is very low and retrieval process easily converges to an equilibrium state which is very different from the stored patterns. Genetic Algorithms is well-known with the capability of global optimal search escaping local optimum on progress to reach a global optimum. Based on the well-known idea of Genetic Algorithms, this work proposes a heuristic rule to make a mutation when the state of the network is trapped in a spurious memory. The proposal heuristic associative memory show the stored capacity does not depend on the number of stored patterns and the retrieval ability is up to ~ 1.
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.