Haiyan Liu

Dr. Haiyan Liu


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 April 2020 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
HLHaiyan Liu
Haiyan Liu
Yuping WangYuping Wang
Yuping Wang
NFNinglei Fan
Ninglei Fan
Many real world problems contain a large number of decision variables which can be modeled as large scale global optimization (LSGO) problems. One effective way to solve an LSGO problem is to decompose it into smaller sub-problems to solve. The existing works mainly focused on designing methods to decompose separable problems, while seldom focused on the decomposition of non-separable large scale problems. Also, the existing decomposition methods only learn the interaction (correlation or interdependence) among variables to make the decomposition. In this paper, we make the decomposition deeper: we not only consider the variable interaction, but also take the essentialness of the variable into account to form a deep grouping method. To do this, we first design an essential/trivial variable detection scheme to support the deep decomposition for both separable problems and non-separable problems. Based on it, we propose a new decomposition method called deep grouping method. Then, we design a new differential evolution (DE) algorithm with a new mutation strategy. By integrating all these, we propose a hybrid deep grouping (HDG) algorithm. Finally, the experiments are conducted on the widely used and most challenging LSGO benchmark suites, and the comparison results of the proposed algorithm with the state-of-the-art algorithms indicate the proposed algorithm is more effective.

19 December 2022 in Axioms
Verified
Journal Article
Open access
PDF file
HLHaiyan Liu
Haiyan Liu
SXSiyan Xue
Siyan Xue
YCYuan Cheng
Yuan Cheng
Shouheng TuoShouheng Tuo
Shouheng Tuo
The filled function method is an effective way to solve global optimization problems. However, its effectiveness is greatly affected by the selection of parameters, and the non-continuous or non-differentiable properties of the constructed filled function. To overcome the above-mentioned drawbacks, in this paper, a new parameterless filled function is proposed that is continuous and differentiable. Theoretical proofs have been made to show the properties of the proposed filled function. Based on the new filled function, a filled function algorithm is proposed to solve unconstrained global optimization problems. Experiments are carried out on widely used test problems and an application of supply chain problems with equality and inequality constraints. The numerical results show that the proposed filled function is effective.