C.A. Coello Coello. Theoretical and Numerical Constraint-Handling Techniques Used with Evoluionary Algorithms : a Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering, 191, 2002, 1245-1287. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Penalty Function Methods for Constrained.. - Kuri-Morales.. (Correct)
....under analysis; in section 3 we describe the experiments performed; in sections 4 and 5, finally, we present our results and conclusions. 2 Strategies The strategies we selected are variations of what is the most popular approach to constrained optimization: the application of penalty functions [1]. In this approach, a constrained problem is transformed into a non constrained one. The function under consideration is transformed as follows: region feasible x x penalty x f region feasible x x f x F ) 2) and the problem described in (1) turns into the one of ....
....parameters which remain constant throughout. Hence, this is a static penalty method. In our experiments it was impossible to consider special values for R ij in every function and, hence, we decided to utilize 4 penalty levels with R = 100, 200, 500, 1000 (instead of 50, 60 and 90 as reported in [1]) and intervals of (0 10) 10 100) 100 1000) and (1000 ) 2.2 Method J The original description of this method may be found in [3] In it a dynamic (nonstationary) penalty function is defined. That is, the penalty, function changes as the GA proceeds. The definition is as follows: 2 , ....
[Article contains additional citation context not shown here]
Coello, C., "Theoretical and Numerical Constraint-Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art", Computer Methods in Applied Mechanics and Engineering, 2001 (to be published).
A Study of Mechanisms to Handle Constraints in.. - Mezura-Montes, Coello Self-citation (Coello) (Correct)
No context found.
Coello, C.A.C.: Theoretical and Numerical Constraint Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering 191 (2002) 1245--1287
Simple Feasibility Rules and Differential Evolution .. - Mezura-Montes.. Self-citation (Coello) (Correct)
No context found.
Coello Coello, C.A.: Theoretical and Numerical Constraint Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering 191 (2002) 1245--1287
Engineering Optimization Using a Simple Evolutionary.. - Mezura-Montes.. (2003) Self-citation (Coello) (Correct)
No context found.
C. A. Coello Coello. Theoretical and Numerical Constraint Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering, 191(11-12):1245--1287, January 2002.
An Improved Diversity Mechanism for Solving Constrained.. - Mezura-Montes, Coello Self-citation (Coello) (Correct)
No context found.
Coello Coello, C.A.: Theoretical and Numerical Constraint Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering 191 (2002) 1245--1287
Multiobjective-Based Concepts to Handle Constraints in.. - Algorithms Efren.. (2003) Self-citation (Coello) (Correct)
No context found.
C. A. C. Coello. Theoretical and Numerical Constraint Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering, 191(11-12):1245--1287, January 2002.
What Makes a Constrained Problem Difficult to Solve by an.. - Mezura-Montes, Coello (2004) Self-citation (Coello) (Correct)
No context found.
Carlos A. Coello Coello. Theoretical and Numerical Constraint Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering, 191(11-12):1245--1287, January 2002.
A Parallel Implementation of an Artificial Immune System to.. - Coello, Cortes Self-citation (Coello) (Correct)
No context found.
Carlos A. Coello Coello. Theoretical and Numerical Constraint-Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering, 191(11-12):1245-1287, January 2002.
Constraint-Handling in Genetic Algorithms Through the Use Of.. - Montes (2002) (1 citation) Self-citation (Coello) (Correct)
No context found.
Carlos A. Coello Coello. Theoretical and Numerical Constraint-Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering, 191(11--12):1245-- 1287, January 2002.
IS-PAES: A Constraint-Handling Technique Based on - Multiobjective Optimization.. Self-citation (Coello) (Correct)
.... (equality, inequality, linear and nonlinear) The success of EAs in global optimization has triggered a considerable amount of research regarding the development of mechanisms able to incorporate information about the constraints of a problem into the fitness function of the EA used to optimize it [4, 17]. So far, the most common approach adopted in the evolutionary optimization literature to deal with constrained search spaces is the use of penalty functions. When using a penalty function, the amount of constraint violation is used to punish or penalize an infeasible solution so that feasible ....
....solution so that feasible solutions are favored by the selection process. Despite the popularity of penalty functions, they have several drawbacks from which the main one is that they require a careful fine tuning of the penalty factors that indicates the degree of penalization to be applied [4]. Recently, some researchers have suggested the use of multiobjective optimization concepts to handle constraints in EAs (see for example [4] This paper introduces a new approach that is based on an evolution strategy that was originally proposed for multiobjective optimization: the Pareto ....
[Article contains additional citation context not shown here]
Carlos A. Coello Coello. Theoretical and Numerical Constraint Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering, 191(11-12):1245--1287, January 2002.
Adding Knowledge and Efficient Data Structures to.. - Coello, Becerra Self-citation (Coello) (Correct)
....its current degree of progress mainly due to culture. In this paper, we propose an approach in which domain knowledge (using the concept of cultural algorithm) extracted during a run of an evolutionary algorithm is used to guide the search more eciently in constrained optimization problems [18, 3]. 2 NOTIONS OF CULTURAL ALGORITHMS Some social researchers have suggested that culture might be symbolically encoded and transmitted within and between populations, as another inheritance mechanism [6, 20] Using this idea, Reynolds [21] developed a computational model in which cultural ....
....gure at the left illustrates the feasible region of a problem. The gure at the right illustrates the representation of the constraints part of the belief space for the search space of the same problem. In this example, the intervals stored in the normative part must be [0.6, 2. 6] for x 1 , and [3, 5] for x 2 . region. The type of region depends on the feasibility of the individuals within. Four types are de ned: unknown feasible infeasible semi feasible To initialize this part, all counters are set to zero and the cell type is initialized to unknown (other values could be ....
Carlos A. Coello Coello. Theoretical and Numerical Constraint-Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering, 191(11-12):1245-1287, January 2002.
A Numerical Comparison of some Multiobjective-Based.. - Mezura-Montes, Coello (2002) Self-citation (Coello) (Correct)
....to bias eciently the search towards the feasible region in constrained search spaces. This has triggered a considerable amount of research and a wide variety of approaches have been suggested in the last few years to incorporate constraints into the tness function of an evolutionary algorithm [9, 31]. Technical Report EVOCINV 03 2002, Evolutionary Computation Group at CINVESTAV, Secci on de Computaci on, Departamento de Ingenier a El ectrica, CINVESTAV IPN, M exico, September 2002. The most common approach adopted to deal with constrained search spaces is the use of penalty functions. ....
....by the selection process. Despite the popularity of penalty functions, they have several drawbacks from which the main one is that they require a careful ne tuning of the penalty factors that accurately estimates the degree of penalization to be applied as to approach eciently the feasible region. [41, 9]. Among the several approaches that have been proposed as an alternative to the use of penalty functiones, there is a group of techniques in which the constraints of a problem are handled as objective functions (i.e. a single objective constrained problem is restated as an unconstrained ....
[Article contains additional citation context not shown here]
Carlos A. Coello Coello. Theoretical and Numerical Constraint Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering, 191(1112) :1245-1287, January 2002.
On the Usefulness of the Evolution Strategies'.. - Mezura-Montes, Coello (2003) Self-citation (Coello) (Correct)
....de Computacion, Departamento de Ingeniera Electrica, CINVESTAV IPN, Mexico, January 2003. cannot distinguish between feasible and infeasible solutions. Therefore, several approaches have been suggested in the literature to allow Evolutionary Algorithms (EAs) to deal with constrained problems [13]. The most common approach adopted to deal with constrained search spaces is the use of penalty functions. When using a penalty function, the amount of constraint violation is used to punish or penalize an infeasible solution so that feasible solutions are favored by the selection process. ....
....selection process. Despite the popularity of penalty functions, they have several drawbacks from which the main one is that they require a careful fine tuning of the penalty factors that accurately estimates the degree of penalization to be applied as to approach efficiently the feasible region [33, 13]. There are also studies about using multiobjective concepts to handle constraints in EAs [22] These approaches find or approximate the optimal solution with less fitness function evaluations than other competitive approaches like the Homomorphous Maps of Koziel and Michalewicz [21] Two of the ....
[Article contains additional citation context not shown here]
Carlos A. Coello Coello. Theoretical and Numerical Constraint Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering, 191(11-12):1245-- 1287, January 2002.
Optimal Pump Scheduling for Water Supply . . . - Kelner (2003) (Correct)
No context found.
C.A. Coello Coello. Theoretical and Numerical Constraint-Handling Techniques Used with Evoluionary Algorithms : a Survey of the State of the Art. Computer Methods in Applied Mechanics and Engineering, 191, 2002, 1245-1287.
Soft Computing Methodologies for Structural Optimization - Papadrakakis, Lagaros (2003) (Correct)
No context found.
C.A.C. Coello, Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state-of-the-art, Comp. Meth., Appl. Mech. Eng. 191 (11) (2002) 1245--1287.
Multicriteria Optimization with Export Rules for Mechanical Design - Coelho (2004) (Correct)
No context found.
C.A.C. Coello, Theoretical and numerical constraint-handling techniques used with evolutionary algorithms : a survey of the state of the art, Computer Methods in Applied Mechanics and Engineering, 191, pp. 1245-1287 (2002).
A Filter-Based Evolutionary Algorithm for Constrained - Optimization Extend Ed (2003) (Correct)
No context found.
C. A. Coello Coello. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering, 2001.
Derivative-Free Filter Simulated Annealing Method for.. - Hedar, Fukushima (2004) (Correct)
No context found.
Coello Coello, C. A. (2002), Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art, Computer Methods in Applied Mechanics and Engineering 191, 1245--1287.
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