Michalewicz Z (1995). A Survey of Constraint Handling Techniques in Evolutionary Computation Methods. In John R. McDonnell, Robert G. Reynolds, and David B. Fogel (editors). Proceedings of the 4  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and pro life techniques, where pro choice encompasses eliminating, decoding, and preserving, while prolife covers penalty based and repairing approaches. Overviews and comparisons published on evolutionary computation techniques for constraint handling so far mainly concern continuous domains, [29,30,32,34]. Constraint handling in continuous and discrete domains rely to a certain extent on the same ideas. There are, however, also differences, for instance in continuous domains constraints can be characterized as linear, non linear, etc. and in case of linear constraints special averaging ....

Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, editors, Proc. of the 4th Annual Conference on Evolutionary Programming, pages 135--155. MIT Press, 1995.

....computation with success to stock market prices. 2. Optimization Genetic algorithms and evolutionary computing have long been applied to practical optimization problems. Goldberg s Ph.D. thesis under Holland [27] recorded an early and conspicuous success. Good reviews can be found in [11, 28, 43, 44]. Innovation and progress continues, cf. 36] and much else at the various GECCO conferences. Remarkably, during the last ten years several intriguing computational techniques, modeled on natural phenomena, have appeared, or been revived, and have shown much promise. These include ant colony ....

Zbigniew Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135--155, Cambridge, MA, 1995. MIT Press. http://www.coe.uncc.edu/zbyszek/papers.html.

....unconstrained optimization. These problems are often otherwise intractable and experience has yielded broadly successful results. The case of constrained optimization is more problematic for evolutionary computation and GAs in particular. In spite of considerable attention paid to the matter (see [2, 5, 6] for excellent reviews) there is no clearly best approach to encoding constrained optimization problems as GAs. Techniques are available and used, largely based on penalty functions. Still, this important class of problems remains somewhat recalcitrant. We explore a conceptually new approach to ....

Zbigniew Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135--155, Cambridge, MA, 1995. MIT Press. http://www.coe.uncc.edu/zbyszek/papers.html.

....behind this approach is to preserve beliefs that are socially accepted and discard (or prune) unacceptable beliefs. Therefore, if we apply a cultural algorithm for global optimization, then acceptable beliefs can be seen as constraints that direct the population at the micro evolutionary level [16]. 3 PREVIOUS WORK Reynolds et al. 22] and Chung Reynolds [2] have explored the use of cultural algorithms for global optimization with very encouraging results. Chung and Reynolds [2] use a hybrid of evolutionary programming and GENOCOP [17] in which they incorporate an interval ....

Zbigniew Michalewicz. A Survey of Constraint Handling Techniques in Evolutionary Computation Methods. In J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135-155. The MIT Press, Cambridge, Massachusetts, 1995.

....INTRODUCTION Recently much attention has been paid to the treatment of constrained optimization problems using evolutionary computation techniques in order to solve large scale real world problems. Several methods have been proposed to take care of constraints in evolutionary computational models [1 4]. A substantial part of the research on evolutionary computations, however, focuses on the processes of natural selection and genetics [1, 5] Computational methods based on socio behavioural models are fairly new developments. Reynolds [6] introduced a cultural algorithm in which problem solving ....

....in order to solve large scale real world problems. Several methods have been proposed to take care of constraints in evolutionary computational models [1 4] A substantial part of the research on evolutionary computations, however, focuses on the processes of natural selection and genetics [1, 5]. Computational methods based on socio behavioural models are fairly new developments. Reynolds [6] introduced a cultural algorithm in which problem solving experience of individuals in a population space was collected and reasoned about within a space that he called the belief space. This ....

Michalewicz, Z. (1995). A survey of constraint handling techniques in evolutionary computation methods. In: Proceedings of the 4th Annual Conference on Evolutionary Programming, MIT Press, Cambridge, MA, pp. 135--155.

....y described and discussed, indicating their main advantages and disadvantages. At the end, we conclude with some of the most promising paths of future research in this area. There are several other surveys on constraint handling techniques available in the specialized literature (see for example [104, 109, 103, 63, 34, 161]) but they are either too narrow (i.e. they cover a single group of constraint handling techniques) or they focus more on empirical comparisons and on the design of interesting test functions. None of these surverys attempt to focus on the discussion of the di erent aspects of each method or to ....

....similar or equal tness) which seriously limits its applicability in highly constrained search spaces. The problem with Ho meister Sprave s approach is that it is based on the assumption that infeasible points will always be valuated worse than feasible ones, and that is not always the case [103]. Other researchers have used di erent distance based static penalty functions [68, 5, 79, 124, 144, 17, 172] but in all cases these metrics rely on some extra parameter (namely one or more penalty factors) which are dicult to generalize and normally remain problem dependent. 2.2 Dynamic ....

[Article contains additional citation context not shown here]

Zbigniew Michalewicz. A Survey of Constraint Handling Techniques in Evolutionary Computation Methods. In J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135-155. The MIT Press, Cambridge, Massachusetts, 1995.

....behind this approach is to preserve beliefs that are socially accepted and discard (or prune) unacceptable beliefs. Therefore, if we apply a cultural algorithm for global optimization, then acceptable beliefs can be seen as constraints that direct the population at the micro evolutionary level [12]. Therefore, constraints can influence directly the search process, leading to an efficient optimization process. A cultural algorithm models the evolution of the culture component of an evolutionary computational system over time. This culture component provides an explicit mechanism for ....

Zbigniew Michalewicz. A Survey of Constraint Handling Techniques in Evolutionary Computation Methods. In J. R. McDonnell, R. G. Reynolds and D. B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135-155. The MIT Press, Cambridge, Massachusetts, 1995.

....handling, as most design optimization problems involve constraints. The presence of constraints significantly affects the performance of any optimization algorithm including evolutionary optimization methods. A comprehensive review on constraint handling methods is presented by Michalewicz[24]. A wide range of constraint handling methods have evolved over the years ranging from rejection of infeasible solutions, use of penalty functions and their variants, repair methods, use of decoders, separate treatment of constraints and objectives and hybrid methods incorporating knowledge of ....

Michalewicz, Z.: A survey of constraint handling techniques in evolutionary computation methods, Proceedings of the Fourth Annual Conference on Evolutionary Programming, (MIT Press, Cambridge, MA)(1995), 135-155.

....maximum restrictions on the sum of order point and order quantity for every item, to avoid the risk of exceeding maximum inventory levels. These constraints are handled by penalizing unfeasible individuals under the assumption of the superiority of feasible solutions over unfeasible solutions [19]. This is also what is done in the method described by Powell and Skolnick in [22] suggested earlier by Richardson et al. in [23] This constraint handling technique is implemented in the following way: evaluations of feasible solutions are mapped into the interval [0; C max ] and unfeasible ....

Zbigniew Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In John R. McDonnell, Robert G. Reynolds, and David B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135--155. MIT Press, 1995.

....constraint satisfaction problems but may not work well for constrained NLPs, because it does not consider the objective seriously. Besides, it calculates fitness based on historical records, making it easy to get stuck in local minima. All these methods have at least one of the following problems [129, 133, 130]: a) di#culty in finding feasible regions or in maintaining feasibility for nonlinear constraints, b) requiring specific domain knowledge or problem dependent genetic operators, and (c) tendency to get stuck at local minima. A series of software packages, GENOCOP I, II, and III [76] utilize ....

Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Proc. of 4th Annual Conf. on Evolutionary Programming, pages 135--155, 1995.

....the existence of a solution. In this thesis I restrict the discussion to finding one solution. With this terminology, solving a CSP means finding one feasible element of the search space while solving a COP means finding a feasible and optimal element. Solving COPs by GAs is extensively treated in [21, 22] and [25] the present investigation concerns solving CSPs by GAs. In this thesis binary constraint satisfaction problems over finite domains are considered, this means that constraints act between pairs of variables. This is not restrictive however since any CSP can be reduced to a binary CSP by ....

Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In J.R. McDonnell, R.G. Reynolds, and D.B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135--155. MIT Press, 1995.

....and pro life techniques, where pro choice encompasses eliminating, decoding, and preserving, while pro life covers penalty based and repairing approaches. Overviews and comparisons published on evolutionary computation techniques for constraint handling so far mainly concern continuous domains, [29, 30, 31, 34]. Constraint handling in continuous and discrete domains rely to a certain extent on the same ideas. There are, however, also di erences, for instance in continuous domains constraints can be characterized as linear, non linear, etc. and in case of linear constraints special averaging ....

Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In J.R. McDonnell, R.G. Reynolds, and D.B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135-155, Cambridge, MA, 1995. MIT Press.

....objective function. This is simply because the constructor may have not reduced p all the way down to zero. Also, since the objective function may have been de ned only on the feasible space F and not on S, some adjustments may be necessary. Di erent ways of combining p with f has been proposed [Michalewicz, 1995]. Unfortunately, the factors [Michalewicz, 1995] that in uence the design of e are problem dependent. In Section 3.2 we explain more in detail the evaluation function applied to our particular case of study. 3 A case study. The valued n queens problem The n queens problem consist of placing n ....

....constructor may have not reduced p all the way down to zero. Also, since the objective function may have been de ned only on the feasible space F and not on S, some adjustments may be necessary. Di erent ways of combining p with f has been proposed [Michalewicz, 1995] Unfortunately, the factors [Michalewicz, 1995] that in uence the design of e are problem dependent. In Section 3.2 we explain more in detail the evaluation function applied to our particular case of study. 3 A case study. The valued n queens problem The n queens problem consist of placing n queens on n di erent squares on a chess board ....

[Article contains additional citation context not shown here]

Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135-155. MIT Press, 1995.

....section. 3. 1 Constraint Manipulation Techniques In order to manipulate the restriction set there are several methods which can be grouped in three major categories: i) methods which preserve the feasibility of solutions [10] ii) methods based in penalty functions [16] 22] 6] 8] 12][11][17] and (iii) methods based in the search of feasible solutions[21] 15] Among these the method proposed in [10] is the only one with significant results when applied to high order problems. Studies conducted in [18] showed that the other two categories are perfectly suitable only when ....

Michalewicz, Z. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the 4th Annual Conference on Evolutionary Programming (Cambridge, MA, 1995), MIT Press.

....a whole, candidate solutions are defined in an n dimensional hypercube with n independent parameters. Constraints in the search impose complicated feasible solution domain shape from the hypercube. Most of the research on ES on constrained problems use heuristics to handle infeasible solutions, [5]. The performance of the search is dependent on the quality of the heuristics. Such heuristics usually become problem dependent for better performance. If feasible solution domains defined by domains of parameters and constraints can be mapped into a hypercubic domain again, then ES can be easily ....

Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the fourth Annual Conference on Evolutionary Programming, Cambridge, MA, 1995. MIT Press

.... this panoply of choices, it seems reasonable to expect that for at least some classes of problem there will be a broad congruence of results over many of these different 1 Thus the title of this section has been inspired by but differentiated carefully from the prior works by Wirth (1976) and Michalewicz (1992) 80 measures. For other problem classes it might be possible to rank the performance of different representations with respect to a particular performance measure and some chosen set of parameters and operators. The principal aim of this section is to identify and measure properties of ....

Z. Michalewicz, 1995b. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135--155. MIT Press (Cambridge, MA).

....provided, showing their advantages and disadvantages, and we will conclude with some of the most promising paths of future research. It should be mentioned that despite the fact that there are other surveys on constraint handling techniques available in the specialized literature (see for example [86, 85, 52, 23, 127]) they are either too narrow (i.e. they cover a single constraint handling technique) or they focus more on empirical comparisons and on the design of interesting test functions and do not attempt to be comprehensive as we pretend in this paper. Our main goal is to provide enough (mainly ....

....the macro evolutionary process of a cultural algorithm. The main idea behind this approach is to preserve beliefs that are socially accepted and discard (or prune) unacceptable beliefs. The acceptable beliefs can be seen as constraints that direct the population at the microevolutionary level [85]. Therefore, constraints can influence directly the search process, leading to an efficient optimization process. In fact, Reynolds et al. 114] and Chung Reynolds [15] have explored this area of research with very encouraging results in numerical optimization. The approach taken by Chung and ....

[Article contains additional citation context not shown here]

Zbigniew Michalewicz. A Survey of Constraint Handling Techniques in Evolutionary Computation Methods. In J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135--155. The MIT Press, Cambridge, Massachusetts, 1995.

....of variables v 1 ; v n within the domains D 1 ; D n such that the relations c 1 ; c m hold. Solving a CSP means nding one feasible element of the search space, solving a COP means nding a feasible and optimal element. Solving COPs by EAs is extensively treated in [30, 31, 32, 33] and [34] where di erent options for constraint handling are given and an experimental comparison of various options can be found. Such surveys or comparative investigations on EAs and CSPs in general are more seldom, at this moment we are only aware of [12] and [16] Let us note that the problem ....

Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In J.R. McDonnell, R.G. Reynolds, and D.B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135-155. MIT Press, 1995.

....also maximum restrictions on the sum of order point and order quantity for every item, to avoid the risk of exceeding maximum inventory levels. These constraints are handled by penalizing unfeasible individuals under the assumption of the superiority of feasible solutions over unfeasible solutions [19]. This is also what is done in the method described by Powell and Skolnick in [22] suggested earlier by Richardson et al. in [23] This constraint handling technique is implemented in the following way: evaluations of feasible solutions are mapped into the interval [0; C max ] and unfeasible ....

Zbigniew Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In John R. McDonnell, Robert G. Reynolds, and David B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135--155. MIT Press, 1995.

....cantilever plate problem that these specific twodimensional crossover operators clearly outperform the standard one and two points bitstring crossover operators [Kane and Schoenauer 1995] 3. 3 Constrained Optimization Many methods have been designed to constrained evolutionary optimization (see [Michalewicz 1995] for a survey of such methods) In particular, the method described in [ Schoenauer and Xanthakis 1993] has been successfully applied to another problem of structural mechanics, the optimization of truss structures. But as the focus of this work is representation, the standard method of ....

Michalewicz, Z. (1995). A survey of constraint handling techniques in evolutionary computation methods. In J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, editors, Proceedings of the 4 th Annual Conference on Evolutionary Programming.

.... These approaches can be categorized as follows: ffl Eliminating infeasible solutions ffl Repairing infeasible solutions ffl Using modified genetic operators ffl Applying penalties for infeasibility The elimination of infeasible solutions has been shown by several authors to be a poor approach [1, 2, 3]. This approach is an especially poor performer for those problems having a small feasible to infeasible ratio of solutions. Further, by eliminating those population members violating any constraint no matter how close it is to being feasible, good genetic material is likely being eliminated. ....

Michalewicz, Z., "A Survey of Constraint Handling Techniques in Evolutionary Methods, " submitted for publication, 1995.

....Simulated Annealing [81] might give analogous results on this problem if used by experienced users. 6.5 Constraint handling The problem of handling constraints in evolutionary algorithms has received much attention, and no universal method is yet known. An exhaustive survey can be found in [114]. Behavioral Memory offers an alternative approach to constraint evolutionary optimization. The ideal way of handling constraints is to have the search space limited to the feasible space (the set of points satisfying all constraints) In some cases, a suitable change of variables can transform ....

....is not necessary in this last era. More details can be found in [154] as well as a toy example, and results of an application to a truss structure optimization problem (see also [153] for the latter problem) The BMCHA has also been compared to other constraint handling methods in the survey [114]. Though it does not apply to any constrained problem, it demonstrates quite efficient on a bunch of test functions. 6.6 Discussion and further work The applications of the Behavioral Memory paradigm presented above are arguments for population based stochastic algorithms against single point ....

Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, editors, Proceedings of the 4 th Annual Conference on Evolutionary Programming, 1995.

....constraints, for any given test point x a function d c ( x) is required (9) It provides some measure of infeasibility guiding the search towards the feasible domain, thus increasing the exploitation of any generated test point speeding up the overall search. In two recent studies, Michalewicz [5, 6] compared several approaches to handle constraints in Genetic Algorithms (GAs) using a measure of infeasibility as described above. Except for the lethal offspring method of ES, all of them define surrogate functions F : IR n IR, so they have to satisfy (5) and (7) Although the ES approach ....

....points, and the definition of problem specific penalty functions. The method of metric penalty functions described here bases on the premise that infeasible points must be always valuated worse than feasible ones. There are of course problems where this assumption does not hold, as reasoned in [6]. The major advantage of MPFs is that any information available about violated constraints can be used to guide the search towards the feasible region, without the construction of an explicit surrogate function or biasing partial penalty functions. No external parameter must be added to an ....

Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, editors, Proceedings of the Fourth Annual Conference on Evolutionary Programming, pages 135--155. The MIT Press, Cambridge, MA, 1995.

No context found.

Michalewicz, Z., A Survey of Constraint Handling Techniques in Evolutionary Computation Methods, Proceedings of the 4th Annual Conference on EP, MIT Press, Cambridge, MA, 1995.

....(especially in the presence of feasible and unfeasible solutions of a constrained problem) and may lead to different constraint handling methods. Recently, eleven approaches (including the use of specialized operators, repair algorithms, penalty functions, cultural algorithms, etc. were surveyed [10] in the context of mathematical programming problems. Evolutionary computation techniques have received a lot of attention regarding their potential as optimization techniques for complex numerical functions. Many difficult functions were examined; very often they served as test beds for ....

Michalewicz, Z., A Survey of Constraint Handling Techniques in Evolutionary Computation Methods, Proceedings of the 4th Annual Conference on Evolutionary Programming, MIT Press, Cambridge, MA, 1995.

....many applications have been reported (see, for example, 18, 47, 57] A vast majority of industrial engineering optimization problems are constrained problems. The presence of constraints significantly affects the performance of any optimization algorithm, including evolutionary search methods [34]. This paper focuses on the issue of constraints handling in evolutionary computation techniques. The general way of dealing with constraints whatever the optimization method is by penalizing infeasible points. However, there are no guidelines on designing penalty functions. Some ....

Michalewicz, Z., A Survey of Constraint Handling Techniques in Evolutionary Computation Methods, Proceedings of the 4th Annual Conference on EP, MIT Press, Cambridge, MA, pp.135--155, 1995.

No context found.

Michalewicz Z (1995). A Survey of Constraint Handling Techniques in Evolutionary Computation Methods. In John R. McDonnell, Robert G. Reynolds, and David B. Fogel (editors). Proceedings of the 4

No context found.

Michalewicz Z (1995). A Survey of Constraint Handling Techniques in Evolutionary Computation Methods. In John R. McDonnell, Robert G. Reynolds, and David B. Fogel (editors). Proceedings of the 4

No context found.

Michalewicz Z. (1995). "A Survey of Constraint Handling Techniques in Evolutionary Computation Methods ".

No context found.

Zbigniew Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135--155, Cambridge, MA, 1995. MIT Press. http://www.coe.uncc.edu/zbyszek/papers.html.

No context found.

Zbigniew Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135--155, Cambridge, MA, 1995. MIT Press. http://www.coe.uncc.edu/zbyszek/papers.html.

No context found.

Z. Michalewicz, A Survey of Constraint Handling Techniques in Evolutionary Computation Methods, Proc. of the 4th Annual Conf. on Evolutionary Programming, pp. 135-155 (1995).

No context found.

Z. Michalewicz, A survey of Constraint Handling Techniques in Evolutionary Computation Methods, Proceedings of the Fourth Annual Conference on Evolutionary Programming, pages 135-155, The MIT

No context found.

Z. Michalewicz, A survey of Constraint Handling Techniques in Evolutionary Computation Methods, Proceedings of the Fourth Annual Conference on Evolutionary Programming, pages 135-155, The MIT Press, Cambridge, Massachusetts, 1995

No context found.

Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the Fourth Annual Conference on Evolutionary Programming, pages 135 -- 155, Cambridge, Massachusetts, 1995. The MIT Press.

No context found.

Michalewicz Z (1995). A Survey of Constraint Handling Techniques in Evolutionary Computation Methods. In John R. McDonnell, Robert G. Reynolds, and David B. Fogel (editors). Proceedings of the 4 Annual Conference on Evolutionary Programming, MIT Press, Cambridge, pp 135-155.

No context found.

Michalewicz, Zbigniew, A Survey of Constraint Handling Techniques in Evolutionary Computation Methods, in [EP95]

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