- Conference Article
2
- 10.7551/978-0-262-32621-6-ch102
Constrained Group Counseling Optimization
- Jul 30, 2014
- Mohammed Eita + 2 more +2
Constrained Group Counseling Optimization
The most existing constrained optimization evolutionary algorithms (COEAs) for solving constrained optimization problems (COPs) only focus on combining a single EA with a single constraint-handling technique (CHT). As a result, the search ability of these algorithms could be limited. Motivated by these observations, we propose an ensemble method which combines different style of EA and CHT from the EA knowledge-base and the CHT knowledge-base, respectively. The proposed method uses two EAs and two CHTs. It randomly combines them to generate novel offspring individuals during each generation. Simulations and comparisons based on four benchmark COPs and engineering optimization problem demonstrate the effectiveness of the proposed approach.
Constrained Group Counseling Optimization
Constrained Group Counseling Optimization
Constrained Group Counseling Optimization
Constrained Group Counseling Optimization
On the Cooperation Between Evolutionary Algorithms and Constraint Handling Techniques
During the past few decades, many Evolutionary Algorithms (EAs) together with the Constraint Handling Techniques (CHTs) have been developed to solve the constrained optimization problems (COPs). To obtain competitive performance, an effective CHT needs to be in conjunction with an efficient EA. In the previous paper, how the Differential Evolution influence the relationship between problems and penalty parameters was studied. In this paper, further study on how much can be improved through good evolutionary algorithms, or whether a good enough EA can make up the shortcoming of a simple CHT, and which factors are related will be the focus. Four different EAs are taken as an example, and Deb’s feasibility-based rule is taken as the CHT for its simplicity. Experimental results show that better performance in EAs is not necessarily the reason for the improved performance of constrained optimization evolutionary algorithms (COEAs), and the key point is to find the shortcoming of the CHT and improve the shortcoming in the corresponding revision of EA.
Read moreAn Improved C2oDE based on Stochastic Ranking
How to balance diversity and convergence as well as constraint violation and objective function in Constrained Optimization Problems (COPs) is an important and key issue when designing a new Constrained Optimization Evolutionary Algorithms (COEAs). C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> oDE set a good example on this point, and obtains promising results. In C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> oDE, the two Constraint Handling Techniques (CHTs) are adopted fixed in two phases. To verify whether there are some other more efficient combinations, Stochastic Ranking (SR) is adopted to balance the combination. Experimental results show a good performance, which also give some inspiration for other research.
Read moreComposite Evolutionary Algorithm for Constrained Optimization
Evolutionary algorithms are amongst the best known methods of solving difficult constrained optimization problems, for which traditional methods are not applicable. Due to the variability of characteristics in different constrained optimization problems, no single evolutionary with single operator performs consistently over a range of problems. We introduce an algorithm framework that uses multiple search operators in each generation. A composite evolutionary algorithm is proposed in this paper and combined feasibility rule to solve constrained optimization problems. The proposed evolutionary algorithm combines three crossover operators with two mutation operators. The selection criteria based on feasibility of individual is used to deal with the constraints. The proposed method is tested on five well-known benchmark constrained optimization problems, and the experimental results show that it is effective and robust
Read moreDouble-track particle swarm optimizer for nonlinear constrained optimization problems
Double-track particle swarm optimizer for nonlinear constrained optimization problems
Voting-mechanism based ensemble constraint handling technique for real-world single-objective constrained optimization
Constraint handling techniques are of great significance in efficiently solving constrained optimization problems. This paper proposes a novel ensemble framework for constraint handling techniques based on voting-mechanism, in which four popular constraint handling techniques are included. Each of the constituent constraint handling techniques votes for the solutions at each generation based on its own rules. Solutions getting more votes are regarded as promising individuals and survive to the next generation. This ensemble framework based on voting-mechanism reflects the collective wisdom in decision-making of human beings. In addition, a differential evolution (DE) variant is designed as the search engine, in which four search strategies are combined to generate new individuals and maintain the balance between diversity and convergence of the population. The proposed algorithm has been tested on 57 real world single-objective constraint optimization problems and 7 problems are selected using variable reduction strategy (VRS). The experiment shows that the proposed algorithm achieves competitive performance, indicating that the voting-mechanism ensemble constraint handling technique combine DE algorithm together can effectively deal with constrained optimization problems.
Read moreConstrained evolutionary optimization based on dynamic knowledge transfer
Constrained evolutionary optimization based on dynamic knowledge transfer
A General Framework of Dynamic Constrained Multiobjective Evolutionary Algorithms for Constrained Optimization
A novel multiobjective technique is proposed for solving constrained optimization problems (COPs) in this paper. The method highlights three different perspectives: 1) a COP is converted into an equivalent dynamic constrained multiobjective optimization problem (DCMOP) with three objectives: a) the original objective; b) a constraint-violation objective; and c) a niche-count objective; 2) a method of gradually reducing the constraint boundary aims to handle the constraint difficulty; and 3) a method of gradually reducing the niche size aims to handle the multimodal difficulty. A general framework of the design of dynamic constrained multiobjective evolutionary algorithms is proposed for solving DCMOPs. Three popular types of multiobjective evolutionary algorithms, i.e., Pareto ranking-based, decomposition-based, and hype-volume indicator-based, are employed to instantiate the framework. The three instantiations are tested on two benchmark suites. Experimental results show that they perform better than or competitive to a set of state-of-the-art constraint optimizers, especially on problems with a large number of dimensions.
Read moreA new constrained optimization evolutionary algorithm by using good point set
Solving constrained optimization problems (COPs) via evolutionary algorithms (EAs) has attracted much attention recently. A new constrained optimization evolutionary algorithm by using good point set (COEAGP) is presented in this paper. In the process of population evolution, multi-objective optimization techniques and good point set in number theory are integrated into our algorithm. The approach transforms COP into a bi-objective optimization problem firstly. Then the crossover operator is designed by using the principle of good point set The purpose of the new crossover is to enrich the exploration and exploitation abilities of the approach proposed. The new crossover operator can produce a small but representative set of points as the potential offspring. After that the BGA mutation operator is applied to potential offspring for enhancing the diversity of the potential offspring population. Furthermore, the update operator incorporates Pareto dominance and the tournament selection operator to choose the best individuals in the current offspring for the next generation. The new approach is tested on 8 well-known benchmark functions, and the empirical evidence suggests that it is robust and efficient when handling linear/nonlinear equality/inequality constraints and that COEAGP outperforms or performs similarly to the other techniques referred in this paper in terms of the quality of the resulting solutions.
Read moreAdaptively Allocating Constraint-Handling Techniques for Constrained Multi-objective Optimization Problems
For solving constrained multi-objective optimization problems (CMOPs), an effective constraint-handling technique (CHT) is of great importance. Recently, many CHTs have been proposed for solving CMOPs. However, no single CHT can outperform all kinds of CMOPs. This paper proposes an algorithm, namely, ACHT-M2M, which adaptively allocates the existing CHTs in an M2M framework for solving CMOPs. To be more specific, a CMOP is first decomposed into several constrained multi-objective optimization subproblems by ACHT-M2M. Each subproblem has a subpopulation in a subregion. CHT for each subregion is adaptively allocated according to a proposed composite performance measure. Population for the next generation is selected from subregions by selection operators with different CHTs and the obtained nondominated feasible solutions in each generation are used to update a predefined archive. ACHT-M2M assembles the advantages of different CHTs and makes them cooperate with each other. The proposed ACHT-M2M is finally compared with the other 12 representative algorithms on benchmark CMOPs and the experimental results further confirm the effectiveness of ACHT-M2M for solving CMOPs.
Read moreProperly Pareto Optimality Based Multiobjective Evolutionary Algorithm for Constrained Optimization
Constrained optimization problem (COP) is converted into bi-objective optimization problem (BOP) and solved with a simple differential evolution (DE) algorithm guided by e-properly Pareto optimality. e-properly Pareto optimality is stronger than Pareto optimality, which results in Pareto optimal solutions at special region. Since one of the extreme point on Pareto front of BOP is the optimal solution of COP, e-properly Pareto optimality can be used to guide generic multi-objective evolutionary algorithm to converge to the specific point. Therefore, a simple biased non-dominated sorting selection is designed to match the preference, and then it is used in DE to solve COP. Numerical experiments for several standard test functions with different characteristic illustrate that the new proposed algorithm is effective and efficient.
Read moreVoting enabled dynamic constraint portfolios for evolutionary multi-objective optimization
Voting enabled dynamic constraint portfolios for evolutionary multi-objective optimization
A combined constraint handling framework: an empirical study
This paper presents a new combined constraint handling framework (CCHF) for solving constrained optimization problems (COPs). The framework combines promising aspects of different constraint handling techniques (CHTs) in different situations with consideration of problem characteristics. In order to realize the framework, the features of two popular used CHTs (i.e., Deb’s feasibility-based rule and multi-objective optimization technique) are firstly studied based on their relationship with penalty function method. And then, a general relationship between problem characteristics and CHTs in different situations (i.e., infeasible situation, semi-feasible situation, and feasible situation) is empirically obtained. Finally, CCHF is proposed based on the corresponding relationship. Also, for the first time, this paper demonstrates that multi-objective optimization technique essentially can be expressed in the form of penalty function method. As CCHF combines promising aspects of different CHTs, it shows good performance on the 22 well-known benchmark test functions. In general, it is comparable to the other four differential evolution-based approaches and five dynamic or ensemble state-of-the-art approaches for constrained optimization.
Read moreBalancing Constraints and Objectives by Considering Problem Types in Constrained Multiobjective Optimization.
Constrained multiobjective optimization problems widely exist in real-world applications. To handle them, the balance between constraints and objectives is crucial, but remains challenging due to non-negligible impacts of problem types. In our context, the problem types refer particularly to those determined by the relationship between the constrained Pareto-optimal front (PF) and the unconstrained PF. Unfortunately, there has been little awareness on how to achieve this balance when faced with different types of problems. In this article, we propose a new constraint handling technique (CHT) by taking into account potential problem types. Specifically, inspired by the prior work, problems are classified into three primary types: 1) I; 2) II; and 3) III, with the constrained PF being made up of the entire, part and none of the unconstrained counterpart, respectively. Clearly, any problem must be one of the three types. For each possible type, there exists a tailored mechanism being used to handle the relationships between constraints and objectives (i.e., constraint priority, objective priority, or the switch between them). It is worth mentioning that exact problem types are not required because we just consider their possibilities in the new CHT. Conceptually, we show that the new CHT can make a tradeoff among different types of problems. This argument is confirmed by experimental studies performed on 38 benchmark problems, whose types are known, and a real-world problem (with unknown types) in search-based software engineering. Results demonstrate that within both decomposition-based and nondecomposition-based frameworks, the new CHT can indeed achieve a good tradeoff among different problem types, being better than several state-of-the-art CHTs.
Read more