Abstract: This study presents a new approach based on Tanaka's
fuzzy linear regression (FLP) algorithm to solve well-known power
system economic load dispatch problem (ELD). Tanaka's fuzzy linear
regression (FLP) formulation will be employed to compute the
optimal solution of optimization problem after linearization. The
unknowns are expressed as fuzzy numbers with a triangular
membership function that has middle and spread value reflected on
the unknowns. The proposed fuzzy model is formulated as a linear
optimization problem, where the objective is to minimize the sum of
the spread of the unknowns, subject to double inequality constraints.
Linear programming technique is employed to obtain the middle and
the symmetric spread for every unknown (power generation level).
Simulation results of the proposed approach will be compared with
those reported in literature.
Abstract: In this paper, the modified optimal sliding mode control with a proposed method to design a sliding surface is presented. Because of the inability of the previous approach of the sliding mode method to design a bounded and suitable input, the new variation is proposed in the sliding manifold to obviate problems in a structural system. Although the sliding mode control is a powerful method to reject disturbances and noises, the chattering problem is not good for actuators. To decrease the chattering phenomena, the optimal control is added to the sliding mode control. Not only the proposed method can decline the intense variations in the inputs of the system but also it can produce the efficient responses respect to the sliding mode control and optimal control that are shown by performing some numerical simulations.
Abstract: Due to the complex network architecture, the mobile
adhoc network-s multihop feature gives additional problems to the
users. When the traffic load at each node gets increased, the
additional contention due its traffic pattern might cause the nodes
which are close to destination to starve the nodes more away from the
destination and also the capacity of network is unable to satisfy the
total user-s demand which results in an unfairness problem. In this
paper, we propose to create an algorithm to compute the optimal
MAC-layer bandwidth assigned to each flow in the network. The
bottleneck links contention area determines the fair time share which
is necessary to calculate the maximum allowed transmission rate used
by each flow. To completely utilize the network resources, we
compute two optimal rates namely, the maximum fair share and
minimum fair share. We use the maximum fair share achieved in
order to limit the input rate of those flows which crosses the
bottleneck links contention area when the flows that are not allocated
to the optimal transmission rate and calculate the following highest
fair share. Through simulation results, we show that the proposed
protocol achieves improved fair share and throughput with reduced
delay.
Abstract: This paper describes an optimal approach for feature
subset selection to classify the leaves based on Genetic Algorithm
(GA) and Kernel Based Principle Component Analysis (KPCA). Due
to high complexity in the selection of the optimal features, the
classification has become a critical task to analyse the leaf image
data. Initially the shape, texture and colour features are extracted
from the leaf images. These extracted features are optimized through
the separate functioning of GA and KPCA. This approach performs
an intersection operation over the subsets obtained from the
optimization process. Finally, the most common matching subset is
forwarded to train the Support Vector Machine (SVM). Our
experimental results successfully prove that the application of GA
and KPCA for feature subset selection using SVM as a classifier is
computationally effective and improves the accuracy of the classifier.
Abstract: The hypercube Qn is one of the most well-known
and popular interconnection networks and the k-ary n-cube Qk
n is
an enlarged family from Qn that keeps many pleasing properties
from hypercubes. In this article, we study the panpositionable
hamiltonicity of Qk
n for k ≥ 3 and n ≥ 2. Let x, y of V (Qk
n)
be two arbitrary vertices and C be a hamiltonian cycle of Qk
n.
We use dC(x, y) to denote the distance between x and y on the
hamiltonian cycle C. Define l as an integer satisfying d(x, y) ≤ l ≤ 1
2 |V (Qk
n)|. We prove the followings:
• When k = 3 and n ≥ 2, there exists a hamiltonian cycle C
of Qk
n such that dC(x, y) = l.
• When k ≥ 5 is odd and n ≥ 2, we request that l /∈ S
where S is a set of specific integers. Then there exists a
hamiltonian cycle C of Qk
n such that dC(x, y) = l.
• When k ≥ 4 is even and n ≥ 2, we request l-d(x, y) to be
even. Then there exists a hamiltonian cycle C of Qk
n such
that dC(x, y) = l.
The result is optimal since the restrictions on l is due to the
structure of Qk
n by definition.
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.
Abstract: System is using multiple processors for computing and information processing, is increasing rapidly speed operation of these systems compared with single processor systems, very significant impact on system performance is increased .important differences to yield a single multi-processor cpu, the scheduling policies, to reduce the implementation time of all processes. Notwithstanding the famous algorithms such as SPT, LPT, LSPT and RLPT for scheduling and there, but none led to the answer are not optimal.In this paper scheduling using genetic algorithms and innovative way to finish the whole process faster that we do and the result compared with three algorithms we mentioned.
Abstract: An optimal solution for a large number of constraint
satisfaction problems can be found using the technique of
substitution and elimination of variables analogous to the technique
that is used to solve systems of equations. A decision function
f(A)=max(A2) is used to determine which variables to eliminate. The
algorithm can be expressed in six lines and is remarkable in both its
simplicity and its ability to find an optimal solution. However it is
inefficient in that it needs to square the updated A matrix after each
variable elimination. To overcome this inefficiency the algorithm is
analyzed and it is shown that the A matrix only needs to be squared
once at the first step of the algorithm and then incrementally updated
for subsequent steps, resulting in significant improvement and an
algorithm complexity of O(n3).
Abstract: This paper presents optimal based damping controllers of Unified Power Flow Controller (UPFC) for improving the damping power system oscillations. The design problem of UPFC damping controller and system configurations is formulated as an optimization with time domain-based objective function by means of Adaptive Tabu Search (ATS) technique. The UPFC is installed in Single Machine Infinite Bus (SMIB) for the performance analysis of the power system and simulated using MATLAB-s simulink. The simulation results of these studies showed that designed controller has an tremendous capability in damping power system oscillations.
Abstract: The optimal grid spacing and turbulence model for the
2D numerical analysis of a vertical-axis water turbine (VAWaterT)
operating in a 2 m/s freestream current has been investigated. The
results of five different spatial domain discretizations and two
turbulence models (k-ω SST and k-ε RNG) have been compared, in
order to gain the optimal y+ parameter distribution along the blade
walls during a full rotor revolution. The resulting optimal mesh has
appeared to be quite similar to that obtained for the numerical
analysis of a vertical-axis wind turbine.
Abstract: The excellent suitability of the externally excited synchronous
machine (EESM) in automotive traction drive applications
is justified by its high efficiency over the whole operation range and
the high availability of materials. Usually, maximum efficiency is
obtained by modelling each single loss and minimizing the sum of all
losses. As a result, the quality of the optimization highly depends on
the precision of the model. Moreover, it requires accurate knowledge
of the saturation dependent machine inductances. Therefore, the
present contribution proposes a method to minimize the overall losses
of a salient pole EESM and its inverter in steady state operation based
on measurement data only. Since this method does not require any
manufacturer data, it is well suited for an automated measurement
data evaluation and inverter parametrization. The field oriented control
(FOC) of an EESM provides three current components resp. three
degrees of freedom (DOF). An analytic minimization of the copper
losses in the stator and the rotor (assuming constant inductances) is
performed and serves as a first approximation of how to choose the
optimal current reference values. After a numeric offline minimization
of the overall losses based on measurement data the results are
compared to a control strategy that satisfies cos (ϕ) = 1.
Abstract: This paper presents the application of an enhanced
Particle Swarm Optimization (EPSO) combined with Gaussian
Mutation (GM) for solving the Dynamic Economic Dispatch (DED)
problem considering the operating constraints of generators. The
EPSO consists of the standard PSO and a modified heuristic search
approaches. Namely, the ability of the traditional PSO is enhanced
by applying the modified heuristic search approach to prevent the
solutions from violating the constraints. In addition, Gaussian
Mutation is aimed at increasing the diversity of global search, whilst
it also prevents being trapped in suboptimal points during search. To
illustrate its efficiency and effectiveness, the developed EPSO-GM
approach is tested on the 3-unit and 10-unit 24-hour systems
considering valve-point effect. From the experimental results, it can
be concluded that the proposed EPSO-GM provides, the accurate
solution, the efficiency, and the feature of robust computation
compared with other algorithms under consideration.
Abstract: The concept of flexible manufacturing is highly
appealing in gaining a competitive edge in the market by quickly
adapting to the changing customer needs. Scheduling jobs on flexible
manufacturing systems (FMSs) is a challenging task of managing the
available flexibility on the shop floor to react to the dynamics of the
environment in real-time. In this paper, an agent-oriented scheduling
framework that can be integrated with a real or a simulated FMS is
proposed. This framework works in stochastic environments with a
dynamic model of job arrival. It supports a hierarchical cooperative
scheduling that builds on the available flexibility of the shop floor.
Testing the framework on a model of a real FMS showed the
capability of the proposed approach to overcome the drawbacks of
the conventional approaches and maintain a near optimal solution
despite the dynamics of the operational environment.
Abstract: This paper presents an application of particle swarm
optimization (PSO) to the grounding grid planning which compares to
the application of genetic algorithm (GA). Firstly, based on IEEE
Std.80, the cost function of the grounding grid and the constraints of
ground potential rise, step voltage and touch voltage are constructed
for formulating the optimization problem of grounding grid planning.
Secondly, GA and PSO algorithms for obtaining optimal solution of
grounding grid are developed. Finally, a case of grounding grid
planning is shown the superiority and availability of the PSO
algorithm and proposal planning results of grounding grid in cost and
computational time.
Abstract: In this paper, an H1-Galerkin mixed finite element method is discussed for the coupled Burgers equations. The optimal error estimates of the semi-discrete and fully discrete schemes of the coupled Burgers equation are derived.
Abstract: A theory for optimal filtering of infinite sets of random
signals is presented. There are several new distinctive features of the
proposed approach. First, a single optimal filter for processing any
signal from a given infinite signal set is provided. Second, the filter is
presented in the special form of a sum with p terms where each term
is represented as a combination of three operations. Each operation
is a special stage of the filtering aimed at facilitating the associated
numerical work. Third, an iterative scheme is implemented into the
filter structure to provide an improvement in the filter performance at
each step of the scheme. The final step of the scheme concerns signal
compression and decompression. This step is based on the solution of
a new rank-constrained matrix approximation problem. The solution
to the matrix problem is described in this paper. A rigorous error
analysis is given for the new filter.
Abstract: Bus networks design is an important problem in
public transportation. The main step to this design, is determining the
number of required terminals and their locations. This is an especial
type of facility location problem, a large scale combinatorial
optimization problem that requires a long time to be solved.
The genetic algorithm (GA) is a search and optimization technique
which works based on evolutionary principle of natural
chromosomes. Specifically, the evolution of chromosomes due to the
action of crossover, mutation and natural selection of chromosomes
based on Darwin's survival-of-the-fittest principle, are all artificially
simulated to constitute a robust search and optimization procedure.
In this paper, we first state the problem as a mixed integer
programming (MIP) problem. Then we design a new crossover and
mutation for bus terminal location problem (BTLP). We tested the
different parameters of genetic algorithm (for a sample problem) and
obtained the optimal parameters for solving BTLP with numerical try
and error.
Abstract: This article presents a short discussion on
optimum neighborhood size selection in a spherical selforganizing
feature map (SOFM). A majority of the literature
on the SOFMs have addressed the issue of selecting optimal
learning parameters in the case of Cartesian topology SOFMs.
However, the use of a Spherical SOFM suggested that the
learning aspects of Cartesian topology SOFM are not directly
translated. This article presents an approach on how to
estimate the neighborhood size of a spherical SOFM based on
the data. It adopts the L-curve criterion, previously suggested
for choosing the regularization parameter on problems of
linear equations where their right-hand-side is contaminated
with noise. Simulation results are presented on two artificial
4D data sets of the coupled Hénon-Ikeda map.
Abstract: Computational study of two dimensional supersonic reacting hydrogen-air flows is performed to investigate the nitrogen effects on ignition delay time for premixed and diffusion flames. Chemical reaction is treated using detail kinetics and the advection upstream splitting method is used to calculate the numerical inviscid fluxes. The results show that just in stoichiometric condition for both premixed and diffusion flames, there is monotone dependency of the ignition delay time to the nitrogen addition. In other situations, the optimal condition from ignition viewpoint should be found using numerical investigations.
Abstract: Recently, Genetic Algorithms (GA) and Differential
Evolution (DE) algorithm technique have attracted considerable
attention among various modern heuristic optimization techniques.
Since the two approaches are supposed to find a solution to a given
objective function but employ different strategies and computational
effort, it is appropriate to compare their performance. This paper
presents the application and performance comparison of DE and GA
optimization techniques, for flexible ac transmission system
(FACTS)-based controller design. The design objective is to enhance
the power system stability. The design problem of the FACTS-based
controller is formulated as an optimization problem and both the PSO
and GA optimization techniques are employed to search for optimal
controller parameters. The performance of both optimization
techniques has been compared. Further, the optimized controllers are
tested on a weekly connected power system subjected to different
disturbances, and their performance is compared with the
conventional power system stabilizer (CPSS). The eigenvalue
analysis and non-linear simulation results are presented and
compared to show the effectiveness of both the techniques in
designing a FACTS-based controller, to enhance power system
stability.