Deb, K.: An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering 186 (2000) 311--338  Home/Search   Document Details and Download   Summary   Related Articles   Check

....from the entire population. When the tournaments finish, the p individuals with the larger number of victories are selected to form the following generation. The tournament rules adopted for the current proposal are very similar to those adopted by Deb in his penalty approach based on feasibility [5]. However, unlike Deb s approach, in our case, we never add violated constraints (as normally done with penalty based approaches) The new tournament rules adopted by our approach are the following: 1. If both individuals are feasible, or both are infeasible, then the individual with the best ....

Kalyanmoy Deb. An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering,

....in [1] and PSO Optimum attribution PACA Experiment #1 of GAs in [1] PSO Func type value Worst Best Average Worst Best Average Average P f ( G 1 Min. 15 12.9995 15.0000 14.9379 14.0566 14.7207 14.4609 5. 0200 0 The constraint handling method for PSO and PACA is following the criteria [8]: a) any feasible solution is preferred to any infeasible solution; b) among two feasible solutions, the one having better objective function value is preferred; c) among two infeasible solutions, the one having smaller constraint violation is preferred. 6. Results and discussion Table 2 ....

K. Deb, "An efficient constraint handling method for genetic algorithms," Comput. Methods Appl. Mech. Engrg., Vol. 186, pp. 311-338, 2000

....of constraint violation to decide who wins. Since we used stochastic universal sampling in our implementation, then we assign fitness to each individual based on these simple rules described before. It is also possible to use directly a tournament selection based on dominance (like proposed by Deb [17]) but its main drawback is that the high selection pressure generated by tournament selection will make necessary to use an additional procedure to preserve diversity in the population (e.g. niching or sharing [18] and we wanted to avoid the introduction of extra parameters into the GA. To ....

Kalyanmoy Deb. An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering, 2000. (in Press).

....even when some guidelines have been provided by the authors of this method [118] to define such penalties, they also admit that it is difficult to produce generic values that can be used in any problem for which no previous information is available. 4. 7 Penalty function based on feasibility Deb [31] proposed an interesting approach in which an individual is evaluated using: fitness i (X) ae f i (X) if OE j (X) 0; 8j = 1; 2; m fworst P m j=1 OE j (X) otherwise (30) where fworst is the objective function value of the worst feasible solution in the population, and OE j (X) ....

....refers only to inequality constraints (equality constraints can be transformed to inequality constraints using a tolerance) If there are no feasible solutions in the population, then fworst is set to zero. Using binary tournament selection, Deb uses the following rules to compare two individuals [31]: 1. A feasible solution is always preferred over an infeasible one. 2. Between two feasible solutions, the one having better objective function is preferred. 3. Between two infeasible solutions, the one having smaller constraint violation is preferred. No penalty factor is required, since the ....

[Article contains additional citation context not shown here]

Kalyanmoy Deb. An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering, 1999. (in Press).

No context found.

Deb, K. (in press). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering.

....individual distance values corresponding to each objective. The following algorithm clearly outlines the crowding distance computation procedure of all solutions in an non dominated set Z: crowding distance assignment (Z) for each i, set Z[i]distance = 0 for each objective m Z = sort(Z, m) Z[1]istace = Z[l]istace = ec for i = 2 to (l 1) 1] m 1] m) number of solutions in Z initialize distance sort using each objective value so that boundary points are always selected for all other points Here Z[i] m refers to the m th objective function value of the i th individual in ....

.... 1) 2] disconnected A = 0.5 sin 1 2 cos 1 sin 2 1.5 cos 2 A2 = 1.5 sin 1 cos 1 2 sin 2 0.5 cos 2 B = 0.5 sinx 2cosx sinx2 1.5 cosx2 B2 = 1.5 sinx cosx 2 sinx2 0.5 cosx2 ( KUR 3 [ 5,5] f(x) i= 10exp xi 0. 2 x i non convex f2(x) ZL (Ixil 8 sinx ZDT1 30 [0, 1] f(x) x x [0, 1] convex 0, g(x) 1 9 (EL2 xi) 1) i = 2, ZDT2 30 [0, 1] f(x) x x [0, 1] non convex 2 x = g x [1 Ix glxll 2] x = 0, g(x) 1 9 (EL2 xe) 1) i = 2, ZDT3 30 [0, 1] f(x) x x [0, 1] convex, f2(x) g(x) 1 x] Xl sin(10x) xi = 0, disconnected g(x) 1 ....

[Article contains additional citation context not shown here]

K. Deb, "An efficient constraint handling method for genetic algorithms," Computer Methods in Applied Mechanics and Engineering, in press.

.... the MPF method was successfully used in constrained optimization of real world problems, e.g. SS96] For a survey on constrained optimization using evolutionary algorithms, see Michalewicz and Schoenauer [MS96] This paper uses a penalty function approach proposed for GAs by the second author [Deb98]. This method uses two metrics. One is directly based on violated constraints obtained by simple addition and the other on the worst fitness value of feasible individuals entering the selection operator in the current generation. It works with substitute fitness val ues for infeasible individuals ....

....The dynamic update scheme is implemented just before the selection operation. It uses the constraint violation information obtained from descendants generated and from the parents in order to guide the search toward the feasible region. The proposed method is similar to that suggested by Deb [Deb98] for genetic algorithms. The method is also similar to that suggested by Hoffmeister and Sprave [HS96] however, here we use a fitness function which depends on the parent and children population at every generation and, therefore, becomes a dynamic approach. This goal is pursued in two steps: ....

[Article contains additional citation context not shown here]

K. Deb. An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering, 1998. in print.

....solutions obtained using NSGA and NSGA II. It is clear that NSGA II is able to find a wider distribution of solutions than NSGA. NSGA II found the best cost solution with a cost of 2.79 units, which is close to the best solution (with a cost of 2. 38 units) found using a single objective GA [1]. 0 0.001 0.002 0.003 0.004 0.005 0.006 0.007 0.008 0.009 0 5 10 15 20 25 30 35 40 Cost NSGA II NSGA Fig. 7. Non dominated solutions obtained using NSGA II and NSGA for the welded beam design problem. 5 Conclusions In this paper, we have used a modified version of the ....

Deb, K. (in press). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering.

....is not near optimal from rigidity consideration and vice versa. This kind of conflicting objective functions leads to Pareto optimal solutions. In the following, we present the mathematical formulation of the two objective optimization problem of minimizing cost and the end deflection [15, 8]: Minimize f 1 ( x) 1:10471h 2 0:04811tb(14:0 ) Minimize f 2 ( x) ffi ( x) Subject to g 1 ( x) j 13; 600 Gamma ( x) 0; g 2 ( x) j 30; 000 Gamma oe( x) 0; g 3 ( x) j b Gamma h 0; g 4 ( x) j P c ( x) Gamma 6; 000 0: 1.7) The deflection term ffi ( x) is given as follows: ....

Deb, K. (in press). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering.

....of multi objective optimization is not served. This is because, in such cases, many interesting solutions with large trade offs among the objectives may not have been discovered. In most multi objective GA implementations, a specific diversity maintaining operator, such as a niching technique (Deb and Goldberg, 1989; Goldberg and Richardson, 1987) is used to find diverse Paretooptimal solutions. However, the following features of a multi objective optimization problem may cause multi objective GAs to have difficulty in maintaining diverse Pareto optimal solutions: 1. Convexity or non convexity in the ....

....6 . Single point crossover with p c = 1 is chosen. No mutation is used to investigate the effect of non dominated sorting concept alone. The niching parameter oe share = 0:158 is calculated based on normalized parameter values and assuming to form about 10 niches in the Pareto optimal front (Deb and Goldberg, 1989). Figure 5 shows a run of NSGA, which, even at generation 100, gets trapped at the local Pareto optimal solutions (marked with a ) When NSGA is 0 2 4 6 8 10 12 14 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 f 1 Global Pareto optimal front Local Pareto optimal front Initial population Population at ....

[Article contains additional citation context not shown here]

Deb, K. (in press). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering. Deb, K. and Goldberg, D. E. (1989). An investigation of niche and species formation in genetic function optimization. Proceedings of the Third International Conference on Genetic Algorithms (pp. 42-- 50).

No context found.

Deb, K. (in press). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering.

.... Anyway, the MPF method was successfully used in constrained optimization of realworld problems, e.g. SS96] For a survey on constrained optimization using evolutionary algorithms, see Michalewicz and Schoenauer [MS96] An alternative penalty function approach has been introduced by Deb [Deb98] for constrained optimization using GAs. This method uses two metrics. One is directly based on violated constraints obtained by simple addition and the other on the worst fitness value of feasible individuals entering the selection operator and the current generation. It works with substituted ....

....The dynamic update scheme is implemented just before the selection operation. It uses the constraint violation information obtained from descendants generated and from the parents in order to guide the search toward the feasible region. The proposed method is similar to that suggested by Deb [Deb98] for genetic algorithms. The method is also similar to that suggested by Hoffmeister and Sprave [HS96] however, here we use a fitness function which depends on the parent and children population at every generation and, therefore, becomes a dynamic approach. This goal is pursued in two steps: ....

[Article contains additional citation context not shown here]

K. Deb. An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering, 1998. in print.

No context found.

Deb, K.: An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering 186 (2000) 311--338

No context found.

Deb, K.: An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering 186 (2000) 311--338

No context found.

Kalyanmoy Deb. An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering, 186(2/4):311--338, 2000.

No context found.

K. Deb, An efficient constraint handling method for genetic algorithms, Computer Methods in Applied Mechanics and Engineering, 186, pp. 311-338 (2000).

No context found.

Deb K. An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 2000, 186(2-4): 311-338

No context found.

Deb, K., "An Efficient Constraint Handling Method for Genetic Algorithms", Computer Methods in Applied Mechanics and Engineering.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC