Abstract: Fractional delay FIR filters design method based on
the differential evolution algorithm is presented. Differential evolution
is an evolutionary algorithm for solving a global optimization problems in the continuous search space. In the proposed approach,
an evolutionary algorithm is used to determine the coefficients of
a fractional delay FIR filter based on the Farrow structure. Basic
differential evolution is enhanced with a restricted mating technique,
which improves the algorithm performance in terms of convergence
speed and obtained solution. Evolutionary optimization is carried out by minimizing an objective function which is based on the amplitude
response and phase delay errors. Experimental results show that the proposed algorithm leads to a reduction in the amplitude response and phase delay errors relative to those achieved with the Least-Squares
method.
Abstract: Truss optimization problem has been vastly studied
during the past 30 years and many different methods have been
proposed for this problem. Even though most of these methods
assume that the design variables are continuously valued, in reality,
the design variables of optimization problems such as cross-sectional
areas are discretely valued. In this paper, an improved hill climbing
and an improved simulated annealing algorithm have been proposed
to solve the truss optimization problem with discrete values for crosssectional
areas. Obtained results have been compared to other
methods in the literature and the comparison represents that the
proposed methods can be used more efficiently than other proposed
methods
Abstract: The job shop scheduling problem (JSSP) is well known as one of the most difficult combinatorial optimization problems. This paper presents a hybrid genetic algorithm for the JSSP with the objective of minimizing makespan. The efficiency of the genetic algorithm is enhanced by integrating it with a local search method. The chromosome representation of the problem is based on operations. Schedules are constructed using a procedure that generates full active schedules. In each generation, a local search heuristic based on Nowicki and Smutnicki-s neighborhood is applied to improve the solutions. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm.
Abstract: Direct search methods are evolutionary algorithms used to solve optimization problems. (DS) methods do not require any information about the gradient of the objective function at hand while searching for an optimum solution. One of such methods is Pattern Search (PS) algorithm. This paper presents a new approach based on a constrained pattern search algorithm to solve a security constrained power system economic dispatch problem (SCED). Operation of power systems demands a high degree of security to keep the system satisfactorily operating when subjected to disturbances, while and at the same time it is required to pay attention to the economic aspects. Pattern recognition technique is used first to assess dynamic security. Linear classifiers that determine the stability of electric power system are presented and added to other system stability and operational constraints. The problem is formulated as a constrained optimization problem in a way that insures a secure-economic system operation. Pattern search method is then applied to solve the constrained optimization formulation. In particular, the method is tested using one system. Simulation results of the proposed approach are compared with those reported in literature. The outcome is very encouraging and proves that pattern search (PS) is very applicable for solving security constrained power system economic dispatch problem (SCED).
Abstract: Color Image quantization (CQ) is an important
problem in computer graphics, image and processing. The aim of
quantization is to reduce colors in an image with minimum distortion.
Clustering is a widely used technique for color quantization; all
colors in an image are grouped to small clusters. In this paper, we
proposed a new hybrid approach for color quantization using firefly
algorithm (FA) and K-means algorithm. Firefly algorithm is a swarmbased
algorithm that can be used for solving optimization problems.
The proposed method can overcome the drawbacks of both
algorithms such as the local optima converge problem in K-means
and the early converge of firefly algorithm. Experiments on three
commonly used images and the comparison results shows that the
proposed algorithm surpasses both the base-line technique k-means
clustering and original firefly algorithm.
Abstract: The Artificial immune systems algorithms are Meta
heuristic optimization method, which are used for clustering and
pattern recognition applications are abundantly. These algorithms in
multimodal optimization problems are more efficient than genetic
algorithms. A major drawback in these algorithms is their slow
convergence to global optimum and their weak stability can be
considered in various running of these algorithms. In this paper,
improved Artificial Immune System Algorithm is introduced for the
first time to overcome its problems of artificial immune system. That
use of the small size of a local search around the memory antibodies
is used for improving the algorithm efficiently. The credibility of the
proposed approach is evaluated by simulations, and it is shown that
the proposed approach achieves better results can be achieved
compared to the standard artificial immune system algorithms
Abstract: This paper presents the use of Legendre pseudospectral
method for the optimization of finite-thrust orbital transfer for
spacecrafts. In order to get an accurate solution, the System-s
dynamics equations were normalized through a dimensionless method.
The Legendre pseudospectral method is based on interpolating
functions on Legendre-Gauss-Lobatto (LGL) quadrature nodes. This
is used to transform the optimal control problem into a constrained
parameter optimization problem. The developed novel optimization
algorithm can be used to solve similar optimization problems of
spacecraft finite-thrust orbital transfer. The results of a numerical
simulation verified the validity of the proposed optimization method.
The simulation results reveal that pseudospectral optimization method
is a promising method for real-time trajectory optimization and
provides good accuracy and fast convergence.
Abstract: Genetic algorithms (GAs) have been widely used for
global optimization problems. The GA performance depends highly
on the choice of the search space for each parameter to be optimized.
Often, this choice is a problem-based experience. The search space
being a set of potential solutions may contain the global optimum
and/or other local optimums. A bad choice of this search space
results in poor solutions. In this paper, our approach consists in
extending the search space boundaries during the GA optimization,
only when it is required. This leads to more diversification of GA
population by new solutions that were not available with fixed search
space boundaries. So, these dynamic search spaces can improve the
GA optimization performances. The proposed approach is applied to
power system stabilizer optimization for multimachine power system
(16-generator and 68-bus). The obtained results are evaluated and
compared with those obtained by ordinary GAs. Eigenvalue analysis
and nonlinear system simulation results show the effectiveness of the
proposed approach to damp out the electromechanical oscillation and
enhance the global system stability.
Abstract: Environmental awareness and the recent
environmental policies have forced many electric utilities to
restructure their operational practices to account for their emission
impacts. One way to accomplish this is by reformulating the
traditional economic dispatch problem such that emission effects are
included in the mathematical model. This paper presents a Particle
Swarm Optimization (PSO) algorithm to solve the Economic-
Emission Dispatch problem (EED) which gained recent attention due
to the deregulation of the power industry and strict environmental
regulations. The problem is formulated as a multi-objective one with
two competing functions, namely economic cost and emission
functions, subject to different constraints. The inequality constraints
considered are the generating unit capacity limits while the equality
constraint is generation-demand balance. A novel equality constraint
handling mechanism is proposed in this paper. PSO algorithm is
tested on a 30-bus standard test system. Results obtained show that
PSO algorithm has a great potential in handling multi-objective
optimization problems and is capable of capturing Pareto optimal
solution set under different loading conditions.
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: Very Large and/or computationally complex optimization problems sometimes require parallel or highperformance computing for achieving a reasonable time for computation. One of the most popular and most complicate problems of this family is “Traveling Salesman Problem". In this paper we have introduced a Branch & Bound based algorithm for the solution of such complicated problems. The main focus of the algorithm is to solve the “symmetric traveling salesman problem". We reviewed some of already available algorithms and felt that there is need of new algorithm which should give optimal solution or near to the optimal solution. On the basis of the use of logarithmic sampling, it was found that the proposed algorithm produced a relatively optimal solution for the problem and results excellent performance as compared with the traditional algorithms of this series.
Abstract: Artificial Neural Network (ANN)s are best suited for
prediction and optimization problems. Trained ANNs have found
wide spread acceptance in several antenna design systems. Four
parameters namely antenna radiation resistance, loss resistance, efficiency,
and inductance can be used to design an antenna layout though
there are several other parameters available. An ANN can be trained
to provide the best and worst case precisions of an antenna design
problem defined by these four parameters. This work describes the
use of an ANN to generate the four mentioned parameters for a loop
antenna for the specified frequency range. It also provides insights
to the prediction of best and worst-case design problems observed
in applications and thereby formulate a model for physical layout
design of a loop antenna.
Abstract: This paper presents two simplified models to
determine nodal voltages in power distribution networks. These
models allow estimating the impact of the installation of reactive
power compensations equipments like fixed or switched capacitor
banks. The procedure used to develop the models is similar to the
procedure used to develop linear power flow models of transmission
lines, which have been widely used in optimization problems of
operation planning and system expansion. The steady state non-linear
load flow equations are approximated by linear equations relating the
voltage amplitude and currents. The approximations of the linear
equations are based on the high relationship between line resistance
and line reactance (ratio R/X), which is valid for power distribution
networks. The performance and accuracy of the models are evaluated
through comparisons with the exact results obtained from the
solution of the load flow using two test networks: a hypothetical
network with 23 nodes and a real network with 217 nodes.
Abstract: This paper presents a mathematical model and a
methodology to analyze the losses in transmission expansion
planning (TEP) under uncertainty in demand. The methodology is
based on discrete particle swarm optimization (DPSO). DPSO is a
useful and powerful stochastic evolutionary algorithm to solve the
large-scale, discrete and nonlinear optimization problems like TEP.
The effectiveness of the proposed idea is tested on an actual
transmission network of the Azerbaijan regional electric company,
Iran. The simulation results show that considering the losses even for
transmission expansion planning of a network with low load growth
is caused that operational costs decreases considerably and the
network satisfies the requirement of delivering electric power more
reliable to load centers.
Abstract: The Prediction of aerodynamic characteristics and
shape optimization of airfoil under the ground effect have been carried
out by integration of computational fluid dynamics and the multiobjective
Pareto-based genetic algorithm. The main flow
characteristics around an airfoil of WIG craft are lift force, lift-to-drag
ratio and static height stability (H.S). However, they show a strong
trade-off phenomenon so that it is not easy to satisfy the design
requirements simultaneously. This difficulty can be resolved by the
optimal design. The above mentioned three characteristics are chosen
as the objective functions and NACA0015 airfoil is considered as a
baseline model in the present study. The profile of airfoil is
constructed by Bezier curves with fourteen control points and these
control points are adopted as the design variables. For multi-objective
optimization problems, the optimal solutions are not unique but a set
of non-dominated optima and they are called Pareto frontiers or Pareto
sets. As the results of optimization, forty numbers of non- dominated
Pareto optima can be obtained at thirty evolutions.
Abstract: In this paper, a method based on Non-Dominated
Sorting Genetic Algorithm (NSGA) has been presented for the Volt /
Var control in power distribution systems with dispersed generation
(DG). Genetic algorithm approach is used due to its broad
applicability, ease of use and high accuracy. The proposed method is
better suited for volt/var control problems. A multi-objective
optimization problem has been formulated for the volt/var control of
the distribution system. The non-dominated sorting genetic algorithm
based method proposed in this paper, alleviates the problem of tuning
the weighting factors required in solving the multi-objective volt/var
control optimization problems. Based on the simulation studies
carried out on the distribution system, the proposed scheme has been
found to be simple, accurate and easy to apply to solve the multiobjective
volt/var control optimization problem of the distribution
system with dispersed generation.
Abstract: In this paper we introduce an approach via optimization methods to find approximate solutions for nonlinear Fredholm integral equations of the first kind. To
this purpose, we consider two stages of approximation.
First we convert the integral equation to a moment problem and then we modify the new problem to two classes of optimization problems, non-constraint optimization problems
and optimal control problems. Finally numerical examples is
proposed.
Abstract: The paper proposes an approach for design of modular
systems based on original technique for modeling and formulation of
combinatorial optimization problems. The proposed approach is
described on the example of personal computer configuration design.
It takes into account the existing compatibility restrictions between
the modules and can be extended and modified to reflect different
functional and users- requirements. The developed design modeling
technique is used to formulate single objective nonlinear mixedinteger
optimization tasks. The practical applicability of the
developed approach is numerically tested on the basis of real modules
data. Solutions of the formulated optimization tasks define the
optimal configuration of the system that satisfies all compatibility
restrictions and user requirements.
Abstract: We study a new technique for optimal data compression
subject to conditions of causality and different types of memory. The
technique is based on the assumption that some information about
compressed data can be obtained from a solution of the associated
problem without constraints of causality and memory. This allows
us to consider two separate problem related to compression and decompression
subject to those constraints. Their solutions are given
and the analysis of the associated errors is provided.
Abstract: Combinatorial optimization problems arise in many scientific and practical applications. Therefore many researchers try to find or improve different methods to solve these problems with high quality results and in less time. Genetic Algorithm (GA) and Simulated Annealing (SA) have been used to solve optimization problems. Both GA and SA search a solution space throughout a sequence of iterative states. However, there are also significant differences between them. The GA mechanism is parallel on a set of solutions and exchanges information using the crossover operation. SA works on a single solution at a time. In this work SA and GA are combined using new technique in order to overcome the disadvantages' of both algorithms.