0 Voturi pozitive0 Voturi negative

4 (de) vizualizări7 paginiConstraint Handling techniques

Sep 12, 2015

© © All Rights Reserved

PDF, TXT sau citiți online pe Scribd

Constraint Handling techniques

© All Rights Reserved

4 (de) vizualizări

Constraint Handling techniques

© All Rights Reserved

- 2-Signal Matching Through Scale Space
- PP_Lingo
- 07a80203 Optimization Techniques
- Improved Shuffled Frog Leaping Algorithm for the Combined Heat and Power Economic Dispatch.
- Optimizing Pumping Systems
- 1908.11444
- Particle Swarm Optimization-Meander Line Polarizer
- Planning Ahead in a Harvesting Variant of the Travelling Salesperson Problem
- pvarray12
- EC-MDPE12.pptx
- A Brief Look at Intersective Properties
- snigdha
- Chicken Swarm Optimization
- Matlab Optimization Toolbox Mathworks.ir
- 3 Article Azojete Vol 7 24-33
- Binder1 61.pdf
- Modern Optimization Techniques in Power Systems
- IJETR041253
- energies-05-03674
- A new bio-inspired algorithm Chicken swarm optimization.pdf

Sunteți pe pagina 1din 7

.Genevieve Coath and Saman K. Halgamuge

Mechatronics and Manufacturing Research Grolip

Department of Mechanical and Manufacturing Engineering

University of Melhourne

. .

,[gcoath. sam]@mame.mu.oz.au

I

. .

,

, A j

. .

constraint-handling methods used in the application of

particle swarm optimization (PSO) to constrained nonlinear optimization problems (CNOPs). A brief review

of constraint-handling techniques for evolutionary algorithms (EAs) is given, followed by a direct comparison

of two existing methods of enforcing constraints using

PSO. The two methods considered are the application

of non-stationary multi-stage penalty functions and the

preservation of feasible solutions.'Fivebenchmark functions are used for the comparison. and the results are

examined to'assess'the performance of eacti,method in

terms of accuracy and rate of convergenfe. Conclusions

are drawn and suggestions for the applicability of each

method to real-world CNOPs are given:.

.*

1 Introduction

..

, <

was ahle to. find better solutions than, the EAs considered.

Hu and Eberhart 121, [41 implemented a PSO strategy of

tracking only feasible solutions, p i t h excellent results when

compared to GAS. This paper will attempt to provide an

assessment of these 2 'constraint-handling methods, as to

date there has been no direci comparison of their application using PSO. It should be noted that the literature is generally in agreement that in order for EAs, including PSO. to

be successfully applied to real-world problems in this area.

they must first prove their ability to solve highly complex

CNOPs.

I'

,

The optimizatibn of constrained functiqns, is a n area of par. * ,

, : . I

* .

.,

ticular importance in applications of engineering. mathematics and economics. among others. Constraints can he

hard or soft in nature:rrepr&enting physical limits of systems or preferred operating ranges. Hence, the rigidity with

which these constraints are enforced should reflect the nature of the constraints themselves..

Stochastic methods of solving constrained nonlinear optimization problems (CNOPs) are becoming popular due io

the success of evolutionary algorithms (EAs) in solving unconstrained optimization problems. EAs zomprise a family of computational techniques which. in general. simulate the evolutionary process [I]. Within this family. techniques may utilise population-based methods which rely on

stochastic variation and selection. When'applying EA techniques to CNOPs, constraints can he effectively removed

via penalty functions. and the problem can then he tackled

as an unconstrained optimization task.

Nonlinear optimization represents difficult challenges,

as noted in [2]. due to its incompatibility with general deterministic solution methods. Among many EAs investigated

for solving CNOPs, particle swarm optimization (PSO) has

been given considerable attention in the literature due to

its speed and efficiency as an optimization technique. For

real-timc CNOPs, which are common in many facets of engineering for example. genetic algorithms (GAS) may he

inefficient and slow, and thus PSO may provide a viable

alternative. Recently, PSO has been applied to CNOPs

with very encouraging results. Parsopoulos et a1 131 compared the ability of PSO to solve CNOPs with the use of

non-stationary multi-stage penalty functions'to that of other

as follows [ 5 ] :

Minimize or maximize f ( X ) .

subject to the linear and nonlinear constraints:

g~(.r)>o.i=l:..:~m~

g < ( r ) . r 0 : ; = ml i

1. ....r n . where z E R"

and the bound;: .zr. 5

i.5 s.

.

Where f and 91: ...:y, are continuously differentiable

functions.

Nonlinear optimization is complex and unpredictable,

and therefore deterministic approaches may he impossible

or inappropriate due to the assumptions made ahout the continuity and differentiability of the objective function [6]. (31.

Recently, there has'heen considerable interest in employing

stochastic methods to overcome CNOPs. and this has highlighted the need for solid EA strategies for coping with infeasible solutions.

Particie swarm 'optimization' was introduced by Kennedy

and Eberhart in 1995 [TI, IS]. It is'an evolutionary computation technique which is stochastic'in nature. and models

itself on flocking behaviour; such as that of birds. A random initialization process provides a population of possible

solutions, and through successive generations the optimum

result is found. Throughihese generations, each'"partic1e".

or potential solution, evolves. In the global version of PSO.

each particle knows its best position so far (pBest), and the

best position so far-among the entire group (@Best). The

basic equations utilised during this evolutionary process are

given below:

'.' , :

K d

21:

x Kd

+C2l'lllld

+ Clrand x (P<d - Z j d ) t

X (pgd

- .Cid)

2419

Authorized licensed use limited to: Zhejiang University. Downloaded on June 19,2010 at 08:15:00 UTC from IEEE Xplore. Restrictions apply.

(1)

Z,d

Z;d

+ V;d

(2)

is the inertia weight, and is set to j0.5 (ran,d/Z.O)];p,dis

the position at which the particle has achieved its hest fitness

so far, and pg,j is the position at which the hest global fitness has been achieved so far. The acceleration coefficients

ci and c2 are both set to 1.49445; and V,,, is set to the

dynamic range of the particle on each dimension (problemspecific). From Equation ( 2 ) , x;,j is the particle's next position, based on its previous position and new velocity, 1':d.

The above numeric'al parameters, as suggested in [41. are

used for all experiments in this paper. Population sizes of

30 are also used (for all hut one test case, which uses 50),

with the maximum number of generations being set to either 500 or 5000 depending on the complexity of the prohlem. PSO also has a local version, where each particle has

a knowledge of the hest position obtained within its own

neighhourhood (IBest) instead of the best position obtained

globally. This version of PSO is often used to overcome

problems associated with the swarm petting trapped in local

optima, which can occur in the global version of PSO when

applied to certain types of problems. The references 171 and

(81 provide a further explanation of PSO operation.

The application of PSO to various optimization problems

has been reported extensively in the literature [7], [9]. [IO],

with some excellent results. Whilst PSO has the advantages

of speed and simplicity when applied to a wide range of

problems. it is yet to he proven as a practical technique to

solve CNOPs. according to 121. Hence, the ability of PSO

in dealing with constrained problems needs a thorough investigation.

iteration number. Penalty functions lace the difficulty of

maintaining a balance between obtaining feasibility whilst

finding optimality. In the case of GAS. i t has been noted in

[6] that too high a penalty will force the CA to find a feasible solution even it is not optimal. Conversely, if the penalty

is small, the emphasis on feasibility is thereby reduced, and

the system may never converge.

The rejection of infeasible solutions is distinct from the

penalty function approach. Solutions are discarded if they

do not satisfy the constraints of the problem. This approach

has its drawbacks in that the decision must he made as to

whether to consider that some infeasible solutions may he

"better" than some feasible one [ I I ] ; or to distinguish between the hest infeasible solutions and the worst feasible

ones. This method is incorporated in evolutionary strategies

(ESs), whereby infeasible membersof a population are simply rejected. Recently, this method has been applied with

PSO, as discussed later.

Repair algorithms seek to restore feasibility to the solution space. They have been employed widely in GAS,

however it has been stated in [6] that the restoration process itself can represent a task similar in complexity to the

optimization problem itself.

3.1.1 Preservation of Feasible Solutions Method

constraint handling with PSO was adapted from [I21 by Hu

and Eberhart in [2]. When implementing this technique into

the global version of PSO, the initialisation process involves

3 Constraint-Handling Methods for Evolution- forcing all particles into the feasible space before any evalary Algorithms

uation of the objective function has begun. Upon evaluation

of the objective function, only particles which remain in the

Several methods in overcoming constraints associated with feasible space are counted for the new pBest and gBest valCNOPs with EAs have been reported. According to [I I]. ues (or IBest for the local version). The idea here is to acthese strategies fall into several distinct areas, some of celerate the iterative process of tracking feasible solutions

which are listed below:

hy forcing the search space to contain only solutions that

Methods based on penalty functions;

d o not violate any constraints. The obvious drawback of

Methods based on the rejection of infeasible solu- this method is that for CNOPs with extremely small feasible

space, the initialization process may he impractically long,

tions;

or almost impossible. Hence, no search can begin until the

Methods based on repair algorithms;

solution space is completely initialized.

Methods hased on specialized operators;

Methods hased on behavioural memory.

3.1.2 Penalty Function Method

The focus of this paper is on the first two methods, which

A non-stationary, multi-stage penalty function method

have already shown some potential when implemented with

(PFM) for constraint handling with PSO was implemented

PSO. Penalty functions are a traditional means for solving

CNOPs. When using this approach, the constraints are ef- by Parsopoulos and Vrahatis in [31. Penalty function methfectively removed, and a penalty is added to the objective ods require the fine-tuning of the penalty function paramfunction value (in a minimization problem) when a violation eters, to discourage premature convergence, whilst maintaining an emphasis on optimality. This penalty function

occurs. Hence, the optimization problem becomes one 01

method,

when implemented with PSO, requires a rigorous

minimizing the objective function and the penalty together,

Penalty functions can he stationary or non-stationary. Sta- checking process after evaluation of the objective function

to ascertain the extent of any constraint,violationIs, followed

tionary penalty functions add a fixed penalty when a viola.

by

the assignment and summation of any penalties applied.

tion occurs, as opposed to non-stationary penalty functions

which add a penalty proportional to the amount with which

2420

Authorized licensed use limited to: Zhejiang University. Downloaded on June 19,2010 at 08:15:00 UTC from IEEE Xplore. Restrictions apply.

was:

F ( z )= f(:r) + h(k)H(z).

z ES

c R"

(3)

Where f ( 2 ) is the original objective function to be optimized. h ( k ) is a penalty value which is modified according

to the algorithm's current iteration number, and H ( s ) is a

penalty factor. also from [ 3 ] ,and is defined as:

rn

H ( 2 ) = cB(yi(z))qi(z)yiq,(5))

(4)

i=l

constraints, yj(c) is a relative violated function of the conis

straints: B ( q i ( r ) )is an assignment function, and -/(qi(i))

the power of the penalty function [ 3 ] . As per [3], for the

experiments in this paper a violation tolerance was implemented, meaning that a constraint was only considered violated if gz(z)> lo-'. and the following values were used

for the penalty function in all cases except Test Problem 5 :

I f q , ( s ) < 1,~ ( y i ( 2 ) =

) 1. else ;,(qi(z)) = 2:

-40792.141

Subject to:

0 5 85.334407 0 . 0 0 5 t i 5 8 ~ 2 ~ 5o.onn6ztiz~12,-0.002205523r5 5 92.

90 5 80.51249 0 . 0 0 i ~ 3 ~ i x ~ 0x .j 0 0 2 9 9 5 ~ ~ : ~ ~ +

+0.002181~; 5 110.

20 5 9.30096i+ 0.004i026~:3z5 0 . 0 0 1 2 5 4 7 ~ ~ ~ ~ +

o.nni9n8R.l:3.1., 5 25.

and the hounds: i X 5 z1 5 102.33 5 r2 5 45,

27 5 i : j 5 45. where i = 3 . 4 . 5

Best known solution: .f* = -3OtiB5.53867

+

+

= 10. else i f q i ( r ) 5 0.1,

=.io.else if q t ( z ) 5 1, B(qi(.r)) = 100,

otherwise B(qi(z))

= 300:

The penalty value h ( k ) was set to h ( k ) = 4 for

Test Problem I and h ( k ) = k& for the remaining

test problems.

For Test Problem 5. a significantly larger value of S(q,(z))

was used. This was established only by trial and error, due 4.5 Test Problem 5 :

to the inability of the previous value of Q(qi(x))to encourage any convergence.

B(qi(z))

+

+

+

4 Experimental Methodology

Five well-known CNOP test problems were used in our

experiments, which comprise a selection of.minimization

problems common to those used in [31, [2], [5]and 161 for

comparative purposes. The aim of the experiments was to

directly compare the rate of convergence and accuracy of results of the two constraint-handling methods. in order to assess each method's suitability for application to real-world

problems. The test problems used were as follows:

4.1 Test Problem 1:

Subject to:

21 = 2 z * - I . z ~ / . 1 + z ; - l 5 0

Best known solution: .f* = 1.393.16.51

Subject to:

100 - ( X I - 512 - ( 2 7 - 5)2 5 0:

( I C~ 6)'

(z2 - q2- 82.81 5 0,

and the hounds: 13 5 z1 5 100:O 5 :z2 5 100

Best known solution: f' = 49G1.81381

f ( ~=

)

5 1000. wherej = 4 . 5 . 6 . 7 . 8

Best known solution: f * = 7019.21

Twenty runs of 500 iterations were performed on each

problem, and the average, hest and worst solutions noted.

For all prohlems except Test Problem a population of 30

.particles was used. For Test Problem 5. a population of 50

particles was used in conjunction with 5000 iterations. For

each test problem, the same initialization range was used for

both constraint-handling methods.

5 Results

The two constraint-handling methods, FSM and PFM, were

applied to the above five test problems. Tables I and 2 show

the hest known solutions to the test problems followed hy

the hest snlution obtained by FSM and PFM respectively

over the 20 runs. Tables 3 and 4 show the average optimal

solution obtained by each method, followed in hrackets by

242 1

Authorized licensed use limited to: Zhejiang University. Downloaded on June 19,2010 at 08:15:00 UTC from IEEE Xplore. Restrictions apply.

Table 1 : Comparison of hest known solutions and best optimal solutions obtained hy PSO using FSM over 20 runs.

PFM over 20 runs.

1.3934649

problem.

1.3934650

-6961.4960

(0.00000)

(0.00062)

-30648.008

8763.7 184

(0.09383)

(0.274458)

Table 2: Comparison of best known solutions and hest optimal solutions ohtained hy PSO using PFM over 20 runs.

The rate of convergence and accuracy of both methods applied to this prohlem were very competitive. As canhe seen

in Figure 1, a rapid convergence occurs during the first 2-3

iterations. The FSM achieved an optimum result very close

to the hest known solution. however the average optimum

results of the two methods over 20 runs were identical.

set to 5000.

the average maximum attempts (MA) required to initialize a

particle into the feasible space for the FSM, and the average

sum of violated constraints (SVC) for the P F M From the

results, it can he seen that thc accuracy of the techniques at

finding near-optimal solutions is extremely competitive.

It can he seen from Table 3 that the FSM may he inappropriate for CNOPs which have an extremely small feasible

space (such as Test Problem 2, whose relative size of feasible space is < O.OOGG%, [ 2 ] ) . In such cases, it can he

almost impossihle to randomly generate an initial set of feasible solutions. This problem was particularly apparent in

Test Problem 5, where it took an inordinate amount of time

to initialize less than IOW of the particles into the feasible

solution space, hence the FSM was considered impractical

for application to this problem. Graphical results of the convergence of each method on each test problcm are shown

below. It should be noted that for the sake of clarity, the

graphs represent convergence over the number of iterations

for which greatest convergence occurs for each test prohlem. Test Problem I was the only case where the initial

values of each respective method allowed the results to he

This problem is a cuhic function whose relative size of feasible space is 0.0066% 121. The PFM achieved a better optimum result and a better average optimum than the FSM,

with a significantly faster convergence rate. as can he seen

hy comparing Figures 2 and 3.

FSM over 20 runs.

I Test 1 FSM

-6960.4 I55

680.75298

-30665.091

(MA)

(60,267)

(732)

(16)

2422

100 iterations

IO0 iterations

i.

>o

This test problem is a quadratic function which has a comparatively large relative size of feasible space (52.1230%,,

[2]), for which both methods showed convergence over a

similar number of iterations. The PFM outperformed the

FSM in terms of the optimum value found, however the

FSM performed consistently well. achieving the better average optimum.

100 iterations

Both methods showed rapid convergence within the first I O

iterations, however the PFM showed a significantly faster

rate of convergence with a slightly better optimum result. It

didn't perform quite as well as the FSM with its average optimum over 20 runs. The PFM did however, perform better

with this test problem than in 1-11, with its SVC also being

lower. This different result may be attributable to the difference of PSO parameters used.

iterations

100 iterations

iterations

2423

of the accuracy and convergence rate of each method when

selecting which one to apply to real-world CNOPs. These

methods were directly compared using identical swarm parameters through simulations, and the hest, worst ,and average solutions noted. The two methods were found to he

extremely competitive, however the rate of convergence of

the penalty function method (PFM) was found to he significantly faster than that of the feasible solutions method

(FSM) in 2 out of the 4 test problems considered. In the

other 2 test problems. the rates of convergence were comparable. The fifth test problem could not he compared due

to the FSM struggling to satisfy all of the constraints during

the initialization process, hence the FSM was found to he

impractical for this case. The accuracy of the average optimal result found by each method was identical in I out of

the 4 test cases, and of the remaining 3, the FSM found

the hetter average optimum result in 2 of them. Hence,

the choice of constraint-handling method is very problemdependent; some problems may require the rapid convereence characteristic shown by the PFM in some of the test

cases, whereas others may have constraints which are suitable to evaluate during the initialization process. Finetuning of the PFM parameters may result in better average

optimal solutions for the PFM. and implementation of the

local version of PSO with test problems which are inclined

to get stuck in local optima (such as Test Problem 5 ) , may

also improve results.

space with feasible solutions due to the binding constraints.

This test prohlem was hy far the hardest to implement for

both techniques, as can he seen in Tables 2 and 4, where its

optimal solution is good hut, its average optimal solution is

comparatively poor. When implementing the PFM with this

test problem. the penalty values which had worked well for

all of the other test problems were changed to have a larger

penalty for large violations (chosen by trial and error), to

ensure convergence. Convergence did not occur with every

run, hence the poor average optimum result. Proper finetuning of the penalty function parameters may result in a

better average optimum, or implementation of the local version of PSO to overcome problems of the swarm getting

stuck in local optima. Difticulties finding the optimal result

for this particular test problem were also noted in [6], where

GASwere used.

'1'"'

Acknowledgments

The authors would like to greatly acknowledge the Rowden White Foundation for their generous financial support

of this research. The authors would also like to acknowledge the assistance of Asanga Ratnaweera for his helpful

suggestions in preparing this paper.

iterations

6 Applications

Bibliography

with optimization tasks as varied as power system operation

[IO], internal combustion engine design [14], biomedical

applications [ I S ] , design of a pressure vessel and a welded

beam [41. The authors have recently applied PSO using the

PFM in this paper to the optimal power flow problem, which

has shown excellent preliminary results. This is a real-world

CNOP which has both equality and inequality constraints.

In this case, the FSM would he inappropriate and impractical due to the requirement of having to preprocess functional constraints. which would require repeated evaluation

of the objective function itself during the initialization process.

[ I ] T. Back, D. Fogel, and T. Michalewicz, eds.. ELY1urioriar:v Conrputation, vol. I . Institute of Physics,

2000.

optimization problems with particle swarm optimization," in Proceedings of the 6th World Multiconfererice

on Systemics. Cybenietics and Iilforniarics, 2002.

[31 K. Parsopoulos and M. Vrahatis, "Particle swarm optimization method for constrained optimization prohlems:' in Intelligent techirologies - theon and applications: new trends in intelligent technologies. vol. 16

of Frontiers in Artificial lritelligerice andilpplicariorrs,

pp. 214-220.10s Press, 2002.

The purpose of this contribution was to assess the performance of two existing constraint-handling methods when

used with particle swarm optimization (PSO) to solve constrained nonlinear optimization problems (CNOPs). This

141 X. Hu, R. Eherhart. and Y. Shi. "Engineering optimization with particle swarm,'' in Proceedings of the

2003 IEEE Swarni Intelligence Syrposiuni. pp. 5357. 2003.

2424

[51 W. Hock and K. Schittkowski, Test exaniplesfor notilirtear progranimbrg codes, vol. 187 of Lecture mtes

in ecorioniics arid niathemarical s w e n i s . SpringerVerlag, 1981.

penalty functions to solve nonlinear constrained optimization prohlems with CA's," i n Proceedings ofthe

Firsr IEEE Conference on Evolutionay Contputarion,

[7] J. Kennedy and R. Eberhart, "Particle swarm optimisation," in-Proceediiigs of the IEEE Itirerttariotial Coirfererice 011 Neural Networks, vol. 4. pp. 1942-1948,

1995.

181 R. Eherhart and I. Kennedy, "A new optimizer using

particle swarm theory:' in Proceedirigs of rlie 6th Irrrernariotial Syntposium on Micro Machine and Huniari

Science, pp. 39-43. 1995.

[91 P. Angeline, "Using selection to improve particle swarm optimization," in Proceedings of the

IEEE World Congress on Conipiitarioiial lritelligettce,

pp. 84-89.1998.

[IO] Y. Fukuyama and H. Yoshida. "Particle swarm

optimization for reactive power and voltage control in electric power systems." Proceedings of the

IEEE Corrgress 011 Evolutionan Conipiitation. vol. 1 ,

pp. 87-93.2001.

II I ] Z. Micha1ewicz;A survey ofconstraint handlingtechniques in evolutionary computation methods," in Proceedirrgs of the 4th Annual Curifererice on Rwltiriori. a n Progranintitig, pp. 135-155, 1995.

[I21 S. Koziel and Z. Michaelewicr, Evolutiotian olgorirlinrs honionrorphous niappirigs arid consrrairied puranteter optinrimion, vol. 7. pp. 19-44. 1999.

I131 I. Yang. Y. Chen, I. Horng. and C . Kao, Applyirigfaniily conipetiriori to evolurion strategies f o r constrained

optinii:atiorr. vol. 1213 of Lecture notes in conipurer

science. Sprinp-Verlag, 1997.

[ 141 A. Ratnaweera. S. Halgamuge, and H. Watson, "Parti-

coefficients," in Proceedings of the 1st International

Conference or1 F t q Systems and Knowledge Disco\,e n , pp. 264-268,2002.

[ 151 R. Eherhart and H. Xiaohui. "Human tremor analysis using particle swarm optimization," in Proceedings

of the 1999 Congress on Evolurionan Computation,

vol. 3 , 1999.

2425

- 2-Signal Matching Through Scale SpaceÎncărcat dekede0309
- PP_LingoÎncărcat deNeoKratox
- 07a80203 Optimization TechniquesÎncărcat deSharanya Thirichinapalli
- Improved Shuffled Frog Leaping Algorithm for the Combined Heat and Power Economic Dispatch.Încărcat deHCTL Open
- Optimizing Pumping SystemsÎncărcat devicopip
- 1908.11444Încărcat deGaston GB
- Particle Swarm Optimization-Meander Line PolarizerÎncărcat denstl0101
- Planning Ahead in a Harvesting Variant of the Travelling Salesperson ProblemÎncărcat deGRUNDOPUNK
- pvarray12Încărcat demakroum
- EC-MDPE12.pptxÎncărcat deX Nerkiun Hexamethyl Tetramine
- A Brief Look at Intersective PropertiesÎncărcat deEric Bakovic
- snigdhaÎncărcat deSnigdha Patnaik
- Chicken Swarm OptimizationÎncărcat deMohamed Taleb
- Matlab Optimization Toolbox Mathworks.irÎncărcat deMohammad Reza Madadi
- 3 Article Azojete Vol 7 24-33Încărcat deAZOJETE
- Binder1 61.pdfÎncărcat deAbdul Rahman
- Modern Optimization Techniques in Power SystemsÎncărcat dekannanchammy
- IJETR041253Încărcat deerpublication
- energies-05-03674Încărcat debryan
- A new bio-inspired algorithm Chicken swarm optimization.pdfÎncărcat deGhanda Gharhiez
- Hamedi 2011Încărcat deSteven Chandra
- 3137-14205-1-PBÎncărcat deashikhmd4467
- alg ii relationships 1Încărcat deapi-358108925
- Uad Local Search Opt Final-1 (1)Încărcat dePrashantyelekar
- ADAPTIVE MULTIMODAL BIOMETRIC FUSION ALGORITHM USING PARTICLE SWARM OPTIMIZATION AND BELIEF FUNCTIONSÎncărcat deMia Amalia
- water management strategies.pdfÎncărcat deZafar Qadri
- Steel - 03-Prof. Zahid Siddiqi.pdfÎncărcat deMuhammad Ahmed
- FWOweb2013-V3Încărcat deChristian Marcelo Moyano Tobar
- Ch_1_156628108711722279335d5b8d7f5de95Încărcat dekhali
- Viaje Progrmamacion LinealÎncărcat deppvasquezco

- Neural NetworksÎncărcat derian ngganden
- algorithmsÎncărcat debaalaajee
- Hydrothermal 93Încărcat deSujoy Das
- CroÎncărcat debaalaajee
- ARPN JournalÎncărcat debaalaajee
- Electrical Drives and ControlsÎncărcat debaalaajee
- EE6351 Model QpÎncărcat dewidepermit
- evco.1993.1.1Încărcat debaalaajee
- MiaoÎncărcat debaalaajee
- EDÎncărcat debaalaajee
- Improved Particle Swarm Optimization Combined With ChaosÎncărcat debaalaajee
- station code index 2Încărcat deABID H
- Swarm IntelligenceÎncărcat deDheeraj Gopal Dubey
- EDÎncărcat debaalaajee
- 01_LoadFlow_R1Încărcat deJohnfinn Caddick
- Vallalaar-PaadalkalÎncărcat deapi-19968843
- Particle Swarm OptimizationÎncărcat debaalaajee
- USA is Commercially Strong Country the People of USA Are Very Hard WorkingÎncărcat debaalaajee
- Neural Networks by HajekÎncărcat debaalaajee
- ModellingÎncărcat debaalaajee
- Modeling and Simulation of Reduction ZoneÎncărcat deJarus Ydenap
- 3-09-026.docÎncărcat debaalaajee
- A New Optimizer Using Particle Swarm TheoryÎncărcat debaalaajee
- The Particle Swarm Optimization Algorithm, Convergence Analysis and Parameter SelectionÎncărcat debaalaajee
- 7 Unit Test System DataÎncărcat debaalaajee

- Small FM Radio Circuit.pdfÎncărcat deSantosh Kumar
- Central Custer County Mining DistrictsÎncărcat devladaputo
- 86lor1.pdfÎncărcat dejunsana
- Channel Capacity of IMDD Optical CommunicationÎncărcat dewatchitonthetv
- Lulu Qian, Erik Winfree and Jehoshua Bruck- Neural network computation with DNA strand displacement cascadesÎncărcat deCogsms
- Danish Int Case StudyÎncărcat deTrancemission
- Fv 11 15vk1 Updated0116 SubmittalÎncărcat deجزائري بتخمام اوربي
- An Approach of D-STATCOM in Single Phase System with Power Quality ImprovementÎncărcat deAnonymous 7VPPkWS8O
- CarnacÎncărcat deAtilla Qurbanov
- FMDS0504-transformadores-Încărcat deJose Luis Rodriguez Reza
- ASME-MFC-6MÎncărcat deGanesh Gany
- Dynamic Brake(Pr)Încărcat dekr_abhijeet72356587
- Symbolic Interactionism (Sociology)Încărcat deRi
- DODGE RAM Cummins ECM Pin Layout DiagramÎncărcat deRM Módulos
- PsychrometerÎncărcat dePauline Mae Araneta
- mini unit final copyÎncărcat deapi-288089824
- ASE Lesson PlanÎncărcat deKrishna Murthy
- Tutorial for mathsÎncărcat demukesh3021
- Clutch Service ManualÎncărcat deW Morales
- BOOK;s JUAL Theodolite SOKKIA DT 740 _ 087809762415Încărcat deasepmulyana
- Operations ManualÎncărcat deWestern Mindanao State University
- Land Rover Series I 1954-1958 Parts Catalogue COMPLETEÎncărcat deJames
- Director of Human Resources or Vice President of Human ResourcesÎncărcat deapi-78723721
- E2004(auto cad)Încărcat deameruddin
- Information SystemÎncărcat deNazmiIzyan
- Pawan Kumar Dubey_JKT_FO_HR-15-N PCP-Appraisal Form.docÎncărcat dePawanDubey
- MEC 512Încărcat deMark Daryl Mayandoc
- Strand7 R246 Verification Manual TOCÎncărcat deTommaso Pascon
- Satellite Trainer Stc10Încărcat deRishi Kesh
- Service and maintenance manual AFPX 513.pdfÎncărcat deManuel Amado Montoya Agudelo

## Mult mai mult decât documente.

Descoperiți tot ce are Scribd de oferit, inclusiv cărți și cărți audio de la editori majori.

Anulați oricând.