- 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
Constrained evolutionary optimization based on dynamic knowledge transfer
Constrained Group Counseling Optimization
Constrained Group Counseling Optimization
Constrained Group Counseling Optimization
Constrained Group Counseling Optimization
Multiple dynamic penalties based on decomposition for constrained optimization
Multiple dynamic penalties based on decomposition for constrained optimization
Knowledge-Base Constrained Optimization Evolutionary Algorithm and its Applications
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.
Read moreVoting-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 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 moreDouble-track particle swarm optimizer for nonlinear constrained optimization problems
Double-track particle swarm optimizer for nonlinear constrained optimization problems
An Adaptive Constraint Violation Evaluation Framework for Constrained Multiobjective Evolutionary Optimization
Constrained multiobjective optimization evolutionary algorithms cope with various constraints through the combination of a constraint violation evaluation (CVE) framework with a constraint handling technique. The evaluation of constraint violation is a critical problem that determines how effectively constraint information is utilized. However, this topic has received limited attention in existing research. To bridge this gap, an adaptive CVE (ACVE) framework that considers the evolutionary state is proposed in this paper. ACVE first divides solutions into multiple clusters. Each cluster is then reassigned a constraint violation value. By adjusting the number of clusters based on the evolutionary state, ACVE adaptively utilizes constraint information at different levels of granularity. This design allows ACVE to achieve a more optimal balance between constraint satisfaction and objective optimization, thereby reducing the dependency on constraint handling techniques. Extensive experiments conducted on several benchmark test suites demonstrate the effectiveness of ACVE. Based on ACVE, we develop the dual-population dynamic coevolutionary algorithm (DDCo). In experiments on multiple benchmark test suites, DDCo demonstrates superior or competitive performance compared with state-of-the-art algorithms, as evaluated using indicators such as inverted generational distance and hypervolume. Moreover, DDCo is successfully applied to optimize the charging protocols of lithium-ion batteries.
Read moreIndicator-Based Constrained Multiobjective Evolutionary Algorithms
Solving constrained multiobjective optimization problems (CMOPs) is a challenging task since it is necessary to optimize several conflicting objective functions and handle various constraints simultaneously. A promising way to solve CMOPs is to integrate multiobjective evolutionary algorithms (MOEAs) with constraint-handling techniques, and the resultant algorithms are called constrained MOEAs (CMOEAs). At present, many attempts have been made to combine dominance-based and decomposition-based MOEAs with diverse constraint-handling techniques together. However, for another main branch of MOEAs, i.e., indicator-based MOEAs, almost no effort has been devoted to extending them for solving CMOPs. In this article, we make the first study on the possibility and rationality of combining indicator-based MOEAs with constraint-handling techniques together. Afterward, we develop an indicator-based CMOEA framework which can combine indicator-based MOEAs with constraint-handling techniques conveniently. Based on the proposed framework, nine indicator-based CMOEAs are developed. Systemic experiments have been conducted on 19 widely used constrained multiobjective optimization test functions to identify the characteristics of these nine indicator-based CMOEAs. The experimental results suggest that both indicator-based MOEAs and constraint-handing techniques play very important roles in the performance of indicator-based CMOEAs. Some practical suggestions are also given about how to select appropriate indicator-based CMOEAs. Besides, we select a superior approach from these nine indicator-based CMOEAs and compare its performance with five state-of-the-art CMOEAs. The comparison results suggest that the selected indicator-based CMOEA can obtain quite competitive performance. It is thus believed that this article would encourage researchers to pay more attention to indicator-based CMOEAs in the future.
Read moreA 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 moreVoting enabled dynamic constraint portfolios for evolutionary multi-objective optimization
Voting enabled dynamic constraint portfolios for evolutionary multi-objective optimization
A Voting-Mechanism-Based Ensemble Framework for Constraint Handling Techniques
Effective constraint handling techniques (CHTs) are of great significance for evolutionary algorithms (EAs) dealing with constrained optimization problems (COPs). To date, many CHTs, such as penalty function, superiority of feasible solutions, and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula> -constraint (EC), have been designed. However, different CHTs are usually suited to different problems, even the most appropriate technique changes along with the stages of the optimization process. Motivated by this phenomenon, we propose a voting-mechanism-based ensemble framework, named voting mechanism for constraint handling (VMCH), to integrate multiple CHTs for solving various COPs. In this framework, each CHT acts as a voter, all voters vote for each pair of solutions, and the solution in each pair with the highest weighted votes is considered better. In addition, an adaptive strategy is developed to adjust the voter weights according to their historical voting performance. To investigate the performance of VMCH in improving existing algorithms, the proposed VMCH is embedded into the three best algorithms in the competition on constrained single objective real-parameter optimization at CEC 2018, namely, MAgES, iLSHADE <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula> , and IUDE, to form three new algorithm versions, i.e., MAgES-VMCH, iLSHADE <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula> -VMCH, and IUDE-VMCH. They are compared with seven state-of-the-art peer algorithms. Extensive experiments are conducted on 57 real-world COPs. The ranking results show that the new algorithm version MAgES-VMCH takes first place among the ten comparison algorithms. Moreover, all the new VMCH-enhanced versions of the three best algorithms are superior to their original versions. Therefore, the proposed VMCH framework can achieve competitive performance in solving COPs.
Read moreShift-Based Penalty for Evolutionary Constrained Multiobjective Optimization and its Application.
This article presents a new constraint-handling technique (CHT), called shift-based penalty (ShiP), for solving constrained multiobjective optimization problems. In ShiP, infeasible solutions are first shifted according to the distributions of their neighboring feasible solutions. The degree of shift is adaptively controlled by the proportion of feasible solutions in the current parent and offspring populations. Then, the shifted infeasible solutions are penalized based on their constraint violations. This two-step process can encourage infeasible solutions to approach/enter the feasible region from diverse directions in the early stage of evolution, and guide diverse feasible solutions toward the Pareto optimal solutions in the later stage of evolution. Moreover, ShiP can achieve an adaptive transition from both diversity and feasibility in the early stage of evolution to both diversity and convergence in the later stage of evolution. ShiP is flexible and can be embedded into three well-known multiobjective optimization frameworks. Experiments on benchmark test problems demonstrate that ShiP is highly competitive with other representative CHTs. Further, based on ShiP, we propose an archive-assisted constrained multiobjective evolutionary algorithm (CMOEA), called ShiP+, which outperforms two other state-of-the-art CMOEAs. Finally, ShiP is applied to the vehicle scheduling of the urban bus line successfully.
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 moreA comparative study of constraint-handling techniques in evolutionary constrained multiobjective optimization
Solving constrained multiobjective optimization problems is one of the most challenging areas in the evolutionary computation research community. To solve a constrained multiobjective optimization problem, an algorithm should tackle the objective functions and the constraints simultaneously. As a result, many constraint-handling techniques have been proposed. However, most of the existing constraint-handling techniques are developed to solve test instances (e.g., CTPs) with low dimension and large feasible region. On the other hand, experimental comparisons on different constraint-handling techniques remain scarce. In view of these two issues, in this paper we first construct 18 test instances, each of which exhibits different properties. Afterward, we choose three representative constraint-handling techniques and combine them with nondominated sorting genetic algorithm II to study the performance difference on various conditions. By the experimental studies, we point out the advantages and disadvantages of different constraint-handling techniques.
Read more