Search

When solving constrained multiobjective optimization problems, it is crucial to deal with several conflicting objectives and various constraints simultaneously. To address these two issues, a constrained multiobjective differential evolution algorithm with an infeasible-proportion control mechanism is presented in this paper. Specifically, two populations are cooperatively employed in the evolution process. The first population is used to solve the original problem, that is, to explore the constrained Pareto front, while the second population is created to search for high-quality objective function information. Furthermore, differential evolution with two specific mutation strategies is employed to update each population. Cooperative strategies can not only balance diversity and convergence but also realize information exchange between the two populations provide new evolutionary directions. In addition, an infeasible-proportion control mechanism is used to gradually decrease the proportion of infeasible solutions in the second population. This enables the main population to pass through the infeasible region barrier in the early evolution stage and facilitates the search for a constrained Pareto front in the later evolution stage. Systematic experiments on 65 benchmark test functions show that the proposed algorithm is superior to or at least comparable to five well-established constrained multiobjective optimization methods. [ABSTRACT FROM AUTHOR]

Disasters have caused significant losses to humans in the past decades. It is essential to learn about the disaster situation so that rescue works can be conducted as soon as possible. Unmanned aerial vehicle (UAV) is a very useful and effective tool to improve the capacity of disaster situational awareness for responders. In the paper, UAV path planning is modelled as the optimization problem, in which fitness functions include travelling distance and risk of UAV, three constraints involve the height of UAV, angle of UAV, and limited UAV slope. An adaptive selection mutation constrained differential evolution algorithm is put forward to solve the problem. In the proposed algorithm, individuals are selected depending on their fitness values and constraint violations. The better the individual is, the higher the chosen probability it has. These selected individuals are used to make mutation, and the algorithm searches around the best individual among the selected individuals. The well-designed mechanism improves the exploitation and maintains the exploration. The experimental results have indicated that the proposed algorithm is competitive compared with the state-of-art algorithms, which makes it more suitable in the disaster scenario. [ABSTRACT FROM AUTHOR]