Distributed and Expensive Evolutionary Constrained Optimization With On-Demand Evaluation
针对工业中同时具有昂贵目标和昂贵约束的分布式优化问题，提出了一种按需评估的分布式进化约束优化算法，通过异步评估策略提升种群收敛性和多样性，实验表明其性能优于集中式方法。
Expensive optimization problems (EOPs) are common in industry and surrogate-assisted evolutionary algorithms (SAEAs) have been developed for solving them. However, many EOPs have not only expensive objective but also expensive constraints, which are evaluated through distributed ways. We define this kind of EOPs as distributed expensive constrained optimization problems (DECOPs). The distributed characteristic of DECOPs leads to the asynchronous evaluation of both objective and constraints. Though some researchers have studied the asynchronous evaluation of objectives, the asynchronous evaluation of constraints has not gained much attention. Therefore, this article gives a formal formulation of DECOPs and proposes a distributed evolutionary constrained optimization algorithm with on-demand evaluation (DEAOE). DEAOE can adaptively evolve different constraints in an asynchronous way through the on-demand evaluation strategy. The on-demand evaluation works from two aspects to improve the population convergence and diversity. From the aspect of individual selection, a joint sample selection strategy is adopted to determine which candidates are promising. From the aspect of constraint selection, an infeasible-first evaluation strategy is devised to judge which constraints need to be further evolved. Extensive experiments and analyses on benchmark functions and engineering problems demonstrate that DEAOE has better performance and higher efficiency compared to centralized state-of-the-art SAEAs.