Abstract

Engineering designs can involve multiple stages, where at each stage, the design models are incrementally modified and optimized. In contrast to traditional dynamic optimization problems, where the changes are caused by some objective factors, the changes in such incremental optimization problems (IOPs) are usually caused by the modifications made by the decision makers during the design process. While existing work in the literature is mainly focused on traditional dynamic optimization, little research has been dedicated to solving such IOPs. In this paper, we study how to adopt cooperative coevolution to efficiently solve a specific type of IOPs, namely, those with increasing decision variables. First, we present a benchmark function generator on the basis of some basic formulations of IOPs with increasing decision variables and exploitable modular structure. Then, we propose a contribution-based cooperative coevolutionary framework coupled with an incremental grouping method for dealing with them. On one hand, the benchmark function generator is capable of generating various benchmark functions with various characteristics. On the other hand, the proposed framework is promising in solving such problems in terms of both optimization accuracy and computational efficiency. In addition, the proposed method is further assessed using a real-world application, i.e., the design optimization of a stepped cantilever beam.

Highlights

  • O PTIMIZATION problems are widely seen in various areas of science and engineering

  • We have investigated how to efficiently solve a specific type of incrementally modified optimization problem (IOP) with increasing decision variables

  • By taking the special property of IOPs, we have proposed a contribution based cooperative coevolution (CBCC) method

Read more

Summary

Introduction

O PTIMIZATION problems are widely seen in various areas of science and engineering. Some of the optimization problems have static objective functions, Manuscript received –. The changes in DOPs may affect the objective functions, the decision variables, or the constraints, where the reasons causing such changes can be attributed to the variance of available resources, the arrival of new jobs, the environmental changes, etc [2] For such DOPs, a widely accepted assumption is that they must be solved online as time goes by [3]. In traditional single-objective optimization, a decision vector can be optimized as a whole if the dimension is not large, but when it comes to large-scale optimization which can involve hundreds or even thousands of decision variables, the decision vector is usually decomposed into a set of components to break a large-scale problem into a set of simpler subproblems [24], [25] Since such variable grouping techniques can be applied to solving IOPs, this section will present some related background knowledge, including the variable separability as well as cooperative coevolution.

Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call