CCChenming Cao

Chenming Cao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Chenming Cao has a total of 17 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Multi-Task Surrogate-Assisted Search with Bayesian Competitive Knowledge Transfer for Expensive Optimization

    by Yi Lu, Xiaoming Xue, Kai Zhang, Liming Zhang, Guodong Chen, Chenming Cao, Piyang Liu, Kay Chen Tan

    Expensive optimization problems (EOPs) present significant challenges for traditional evolutionary optimization due to their limited evaluation calls. Although surrogate-assisted search (SAS) has become a popular paradigm for addressing EOPs, it still suffers from the cold-start issue. In response to this challenge, knowledge transfer has been gaining popularity for its ability to leverage search experience from potentially related instances, ultimately facilitating head-start optimization for more efficient decision-making. However, the curse of negative transfer persists when applying knowledge transfer to EOPs, primarily due to the inherent limitations of existing methods in assessing knowledge transferability. On the one hand, a priori transferability assessment criteria are intrinsically inaccurate due to their imprecise understandings. On the other hand, a posteriori methods often necessitate sufficient observations to make correct inferences, rendering them inefficient when applied to EOPs. Considering the above, this paper introduces a Bayesian competitive knowledge transfer (BCKT) method developed to improve multi-task SAS (MSAS) when addressing multiple EOPs simultaneously. Specifically, the transferability of knowledge is estimated from a Bayesian perspective that accommodates both prior beliefs and empirical evidence, enabling accurate competition between inner-task and inter-task solutions, ultimately leading to the adaptive use of promising solutions while effectively suppressing inferior ones. The effectiveness of our method in boosting various SAS algorithms for both multi-task and many-task problems is empirically validated, complemented by comparative studies that demonstrate its superiority over peer algorithms and its applicability to real-world scenarios. The source code of our method is available at https://github.com/XmingHsueh/MSAS-BCKT.

  • Global and Local Search Experience-Based Evolutionary Sequential Transfer Optimization

    by Chenming Cao, Kai Zhang, Xiaoming Xue, Kay Chen Tan, Jian Wang, Liming Zhang, Piyang Liu, Xia Yan

    Evolutionary sequential transfer optimization (ESTO), which aims to better optimize a target task using the knowledge extracted from a number of previously-solved source tasks, has been gaining continually increasing research attention over the years. Particularly, solution-based ESTO (S-ESTO) that transfers task solutions has been receiving much popularity due to its ease of implementation and optimizer independency. However, existing S-ESTO algorithms put much emphasis on utilizing source optimized solutions standing for global search experience without being aware of the potential of intermediate solutions that represent local optimization experience. Besides, most of them cannot take full advantage of the solution data from evolutionary search. In light of the above, this study aims to develop a global and local search experience-based solution transfer technique to maximally release the potential of optimization experience hidden in the source tasks. Firstly, a novel transferability metric named landscape encoding-based rank correlation (LERC) is developed. Then, we propose to divide the optimization experience into two classes: global and local search experience. Accordingly, by instantiating LERC into global and local versions, we develop two distinct transfer methods to exploit the global and local search experience, respectively. Finally, by combining the two transfer methods, we propose an S-ESTO algorithm that can transfer the global and local search experience simultaneously for maximum performance enhancement for the target task. Experiments conducted on a set of benchmark problems and a practical case study verify the efficacy of the proposed methods. The source code of our algorithm is available at https://github.com/ccm831143/GL-LERC.


  • Competitive Knowledge Transfer–Enhanced Surrogate-Assisted Search for Production Optimization

    by Chenming Cao, Xiaoming Xue, Kai Zhang, Linqi Song, Liming Zhang, Xia Yan, Yongfei Yang, Jun Yao, Wensheng Zhou, Chen Liu

    Summary: Production optimization is a crucial component of closed-loop reservoir management, which typically aims to search for the best development scheme for maximum economic benefit. Over the decades, a large body of algorithms have been proposed to address production optimization problems, among which the surrogate-assisted evolutionary algorithm (SAEA) gained much research popularity due to its problem information-agnostic implementation and strong global search capability. However, existing production optimization methods often optimize individual tasks from scratch in an isolated manner, ignoring the available optimization experience hidden in previously optimized tasks. The incapability of transferring knowledge from possibly related tasks makes these algorithms always require a considerable number of simulation runs to obtain high-quality development schemes, which could be computationally prohibitive. To address this issue, this paper proposes a novel competitive knowledge transfer (CKT) method to leverage the knowledge from previously solved tasks toward enhanced production optimization performance. The proposed method consists of two parts: (1) similarity measurement that uses both reservoir features and optimization data for identifying the most promising previously solved task and (2) CKT that launches a competition between the development schemes of different tasks to decide whether to trigger the knowledge transfer. The efficacy of the proposed method is validated on a number of synthetic benchmark functions as well as two production optimization tasks. The experimental results demonstrate that the proposed method can significantly improve production optimization performance and achieve better optimization results when certain helpful previously optimized tasks are available.