Abstract: Particle swarm optimization (PSO) is becoming one of
the most important swarm intelligent paradigms for solving global
optimization problems. Although some progress has been made to
improve PSO algorithms over the last two decades, additional work
is still needed to balance parameters to achieve better numerical
properties of accuracy, efficiency, and stability. In the optimal
PSO algorithm, the optimal weightings of (√ 5 − 1)/2 and (3 − √5)/2 are used for the cognitive factor and the social factor,
respectively. By the same token, the same optimal weightings have
been applied for intensification searches and diversification searches,
respectively. Perturbation and constriction effects are optimally
balanced. Simulations of the de Jong, the Rosenbrock, and the
Griewank functions show that the optimal PSO algorithm indeed
achieves better numerical properties and outperforms the canonical
PSO algorithm.
Abstract: Gas lift optimization is becoming more important now a day in petroleum industry. A proper lift optimization can reduce the operating cost, increase the net present value (NPV) and maximize the recovery from the asset. A widely accepted definition of gas lift optimization is to obtain the maximum output under specified operating conditions. In addition, gas lift, a costly and indispensable means to recover oil from high depth reservoir entails solving the gas lift optimization problems. Gas lift optimization is a continuous process; there are two levels of production optimization. The total field optimization involves optimizing the surface facilities and the injection rate that can be achieved by standard tools softwares. Well level optimization can be achieved by optimizing the well parameters such as point of injection, injection rate, and injection pressure. All these aspects have been investigated and presented in this study by using experimental data and PROSPER simulation program. The results show that the well head pressure has a large influence on the gas lift performance and also proved that smart gas lift valve can be used to improve gas lift performance by controlling gas injection from down hole. Obtaining the optimum gas injection rate is important because excessive gas injection reduces production rate and consequently increases the operation cost.
Abstract: This paper covers application of an elitist selfadaptive
step-size search (ESASS) to optimum design of steel
skeletal structures. In the ESASS two approaches are considered for
improving the convergence accuracy as well as the computational
efficiency of the original technique namely the so called selfadaptive
step-size search (SASS). Firstly, an additional randomness
is incorporated into the sampling step of the technique to preserve
exploration capability of the algorithm during the optimization.
Moreover, an adaptive sampling scheme is introduced to improve the
quality of final solutions. Secondly, computational efficiency of the
technique is accelerated via avoiding unnecessary analyses during the
optimization process using an upper bound strategy. The numerical
results demonstrate the usefulness of the ESASS in the sizing
optimization problems of steel truss and frame structures.
Abstract: Evolution strategy (ES) is a well-known instance of evolutionary algorithms, and there have been many studies on ES. In this paper, the author proposes an extended ES for solving fuzzy-valued optimization problems. In the proposed ES, genotype values are not real numbers but fuzzy numbers. Evolutionary processes in the ES are extended so that it can handle genotype instances with fuzzy numbers. In this study, the proposed method is experimentally applied to the evolution of neural networks with fuzzy weights and biases. Results reveal that fuzzy neural networks evolved using the proposed ES with fuzzy genotype values can model hidden target fuzzy functions even though no training data are explicitly provided. Next, the proposed method is evaluated in terms of variations in specifying fuzzy numbers as genotype values. One of the mostly adopted fuzzy numbers is a symmetric triangular one that can be specified by its lower and upper bounds (LU) or its center and width (CW). Experimental results revealed that the LU model contributed better to the fuzzy ES than the CW model, which indicates that the LU model should be adopted in future applications of the proposed method.
Abstract: Facility location is a complex real-world problem
which needs a strategic management decision. This paper provides a
general review on studies, efforts and developments in Facility
Location Problems which are classical optimization problems having
a wide-spread applications in various areas such as transportation,
distribution, production, supply chain decisions and
telecommunication. Our goal is not to review all variants of different
studies in FLPs or to describe very detailed computational techniques
and solution approaches, but rather to provide a broad overview of
major location problems that have been studied, indicating how they
are formulated and what are proposed by researchers to tackle the
problem. A brief, elucidative table based on a grouping according to
“General Problem Type” and “Methods Proposed” used in the studies
is also presented at the end of the work.
Abstract: Evolutionary optimization methods such as genetic
algorithms have been used extensively for the construction site layout
problem. More recently, ant colony optimization algorithms, which
are evolutionary methods based on the foraging behavior of ants,
have been successfully applied to benchmark combinatorial
optimization problems. This paper proposes a formulation of the site
layout problem in terms of a sequencing problem that is suitable for
solution using an ant colony optimization algorithm.
In the construction industry, site layout is a very important
planning problem. The objective of site layout is to position
temporary facilities both geographically and at the correct time such
that the construction work can be performed satisfactorily with
minimal costs and improved safety and working environment. During
the last decade, evolutionary methods such as genetic algorithms
have been used extensively for the construction site layout problem.
This paper proposes an ant colony optimization model for
construction site layout. A simple case study for a highway project is
utilized to illustrate the application of the model.
Abstract: Nature is the immense gifted source for solving
complex problems. It always helps to find the optimal solution to
solve the problem. Mobile Ad Hoc NETwork (MANET) is a wide
research area of networks which has set of independent nodes. The
characteristics involved in MANET’s are Dynamic, does not depend
on any fixed infrastructure or centralized networks, High mobility.
The Bio-Inspired algorithms are mimics the nature for solving
optimization problems opening a new era in MANET. The typical
Swarm Intelligence (SI) algorithms are Ant Colony Optimization
(ACO), Artificial Bee Colony (ABC), Particle Swarm Optimization
(PSO), Modified Termite Algorithm, Bat Algorithm (BA), Wolf
Search Algorithm (WSA) and so on. This work mainly concentrated
on nature of MANET and behavior of nodes. Also it analyses various
performance metrics such as throughput, QoS and End-to-End delay
etc.
Abstract: Nature is a great source of inspiration for solving
complex problems in networks. It helps to find the optimal solution.
Metaheuristic algorithm is one of the nature-inspired algorithm which
helps in solving routing problem in networks. The dynamic features,
changing of topology frequently and limited bandwidth make the
routing, challenging in MANET. Implementation of appropriate
routing algorithms leads to the efficient transmission of data in
mobile ad hoc networks. The algorithms that are inspired by the
principles of naturally-distributed/collective behavior of social
colonies have shown excellence in dealing with complex
optimization problems. Thus some of the bio-inspired metaheuristic
algorithms help to increase the efficiency of routing in ad hoc
networks. This survey work presents the overview of bio-inspired
metaheuristic algorithms which support the efficiency of routing in
mobile ad hoc networks.
Abstract: Non-linear FEM calculations are indispensable when
important technical information like operating performance of a
rubber component is desired. For example rubber bumpers built into
air-spring structures may undergo large deformations under load,
which in itself shows non-linear behavior. The changing contact
range between the parts and the incompressibility of the rubber
increases this non-linear behavior further. The material
characterization of an elastomeric component is also a demanding
engineering task.
The shape optimization problem of rubber parts led to the study of
FEM based calculation processes. This type of problems was posed
and investigated by several authors. In this paper the time demand of
certain calculation methods are studied and the possibilities of time
reduction is presented.
Abstract: This paper presents an evolutionary algorithm for
solving multi-objective optimization problems-based artificial neural
network (ANN). The multi-objective evolutionary algorithm used in
this study is genetic algorithm while ANN used is radial basis
function network (RBFN). The proposed algorithm named memetic
elitist Pareto non-dominated sorting genetic algorithm-based RBFN
(MEPGAN). The proposed algorithm is implemented on medical
diseases problems. The experimental results indicate that the
proposed algorithm is viable, and provides an effective means to
design multi-objective RBFNs with good generalization capability
and compact network structure. This study shows that MEPGAN
generates RBFNs coming with an appropriate balance between
accuracy and simplicity, comparing to the other algorithms found in
literature.
Abstract: This paper presents a new meta-heuristic bio-inspired
optimization algorithm which is called Cuttlefish Algorithm (CFA).
The algorithm mimics the mechanism of color changing behavior of
the cuttlefish to solve numerical global optimization problems. The
colors and patterns of the cuttlefish are produced by reflected light
from three different layers of cells. The proposed algorithm considers
mainly two processes: reflection and visibility. Reflection process
simulates light reflection mechanism used by these layers, while
visibility process simulates visibility of matching patterns of the
cuttlefish. To show the effectiveness of the algorithm, it is tested with
some other popular bio-inspired optimization algorithms such as
Genetic Algorithms (GA), Particle Swarm Optimization (PSO) and
Bees Algorithm (BA) that have been previously proposed in the
literature. Simulations and obtained results indicate that the proposed
CFA is superior when compared with these algorithms.
Abstract: This paper presents the performance state analysis of
Self-Excited Induction Generator (SEIG) using Artificial Bee Colony
(ABC) optimization technique. The total admittance of the induction
machine is minimized to calculate the frequency and magnetizing
reactance corresponding to any rotor speed, load impedance and
excitation capacitance. The performance of SEIG is calculated using
the optimized parameter found. The results obtained by ABC
algorithm are compared with results from numerical method. The
results obtained coincide with the numerical method results. This
technique proves to be efficient in solving nonlinear constrained
optimization problems and analyzing the performance of SEIG.
Abstract: This paper presents the implementation of Artificial Bees Colony (ABC) algorithm in solving Directional OverCurrent Relays (DOCRs) coordination problem for near-end faults occurring in fixed network topology. The coordination optimization of DOCRs is formulated as linear programming (LP) problem. The objective function is introduced to minimize the operating time of the associated relay which depends on the time multiplier setting. The proposed technique is to taken as a technique for comparison purpose in order to highlight its superiority. The proposed algorithms have been tested successfully on 8 bus test system. The simulation results demonstrated that the ABC algorithm which has been proved to have good search ability is capable in dealing with constraint optimization problems.
Abstract: Genetic Algorithm (GA) is a powerful technique for solving optimization problems. It follows the idea of survival of the fittest - Better and better solutions evolve from previous generations until a near optimal solution is obtained. GA uses the main three operations, the selection, crossover and mutation to produce new generations from the old ones. GA has been widely used to solve optimization problems in many applications such as traveling salesman problem, airport traffic control, information retrieval (IR), reactive power optimization, job shop scheduling, and hydraulics systems such as water pipeline systems. In water pipeline systems we need to achieve some goals optimally such as minimum cost of construction, minimum length of pipes and diameters, and the place of protection devices. GA shows high performance over the other optimization techniques, moreover, it is easy to implement and use. Also, it searches a limited number of solutions.
Abstract: The The dynamic economic dispatch (DED) problem is one of the complex constrained optimization problems that have nonlinear, con-convex and non-smooth objective functions. The purpose of the DED is to determine the optimal economic operation of the committed units while meeting the load demand. Associated to this constrained problem there exist highly nonlinear and non-convex practical constraints to be satisfied. Therefore, classical and derivative-based methods are likely not to converge to an optimal or near optimal solution to such a dynamic and large-scale problem. In this paper, an Artificial Immune System technique (AIS) is implemented and applied to solve the DED problem considering the transmission power losses and the valve-point effects in addition to the other operational constraints. To demonstrate the effectiveness of the proposed technique, two case studies are considered. The results obtained using the AIS are compared to those obtained by other methods reported in the literature and found better.
Abstract: Conjugate gradient method has been enormously used
to solve large scale unconstrained optimization problems due to the
number of iteration, memory, CPU time, and convergence property,
in this paper we find a new class of nonlinear conjugate gradient
coefficient with global convergence properties proved by exact line
search. The numerical results for our new βK give a good result when
it compared with well known formulas.
Abstract: The dynamic economic dispatch (DED) problem is one of the complex constrained optimization problems that have nonlinear, con-convex and non-smooth objective functions. The purpose of the DED is to determine the optimal economic operation of the committed units while meeting the load demand. Associated to this constrained problem there exist highly nonlinear and non-convex practical constraints to be satisfied. Therefore, classical and derivative-based methods are likely not to converge to an optimal or near optimal solution to such a dynamic and large-scale problem. In this paper, an Artificial Immune System technique (AIS) is implemented and applied to solve the DED problem considering the transmission power losses and the valve-point effects in addition to the other operational constraints. To demonstrate the effectiveness of the proposed technique, two case studies are considered. The results obtained using the AIS are compared to those obtained by other methods reported in the literature and found better.
Abstract: This paper describes optimal thinning of an Elliptical
Cylindrical Array (ECA) of uniformly excited isotropic antennas
which can generate directive beam with minimum relative Side Lobe
Level (SLL). The Particle Swarm Optimization (PSO) method, which
represents a new approach for optimization problems in
electromagnetic, is used in the optimization process. The PSO is used
to determine the optimal set of ‘ON-OFF’ elements that provides a
radiation pattern with maximum SLL reduction. Optimization is done
without prefixing the value of First Null Beam Width (FNBW). The
variation of SLL with element spacing of thinned array is also
reported. Simulation results show that the number of array elements
can be reduced by more than 50% of the total number of elements in
the array with a simultaneous reduction in SLL to less than -27dB.
Abstract: The author proposes an extension of genetic algorithm (GA) for solving fuzzy-valued optimization problems. In the proposed GA, values in the genotypes are not real numbers but fuzzy numbers. Evolutionary processes in GA are extended so that GA can handle genotype instances with fuzzy numbers. The proposed method is applied to evolving neural networks with fuzzy weights and biases. Experimental results showed that fuzzy neural networks evolved by the fuzzy GA could model hidden target fuzzy functions well despite the fact that no training data was explicitly provided.
Abstract: The author proposes an extension of particle swarm optimization (PSO) for solving interval-valued optimization problems and applies the extended PSO to evolutionary training of neural networks (NNs) with interval weights. In the proposed PSO, values in the genotypes are not real numbers but intervals. Experimental results show that interval-valued NNs trained by the proposed method could well approximate hidden target functions despite the fact that no training data was explicitly provided.