Hu Zhang

Hu Zhang

Auto-generated profile, based on publicly available information

Hu Zhang

CASIC Research Institute of Intelligent Decision Engineering, Beijing, China

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 January 2016 in Neurocomputing
Verified
Journal Article
Closed access
HZHu Zhang
Hu Zhang
XZXiujie Zhang
Xiujie Zhang
XGXiao-Zhi Gao
Xiao-Zhi Gao
SSShenmin Song
Shenmin Song

15 August 2018 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
JSJianyong Sun
Jianyong Sun
HZHu Zhang
Hu Zhang
AiMin ZhouAiMin Zhou
AiMin Zhou
QZQingfu Zhang
Qingfu Zhang
KZKe ZHANG
Ke ZHANG
KYKai Ye
Kai Ye
Combining machine learning techniques has shown great potentials in evolutionary optimization since the domain knowledge of an optimization problem, if well learned, can be a great help for creating high-quality solutions. However, existing learning-based multiobjective evolutionary algorithms (MOEAs) spend too much computational overhead on learning. To address this problem, we propose a learning-based MOEA where an online learning algorithm is embedded within the evolutionary search procedure. The online learning algorithm takes the stream of sequentially generated solutions along the evolution as its training data. It is noted that the stream of solutions are temporal, dependent, nonstationary, and nonstatic. These data characteristics make existing online learning algorithm not suitable for the evolution data. We hence modify an existing online agglomerative clustering algorithm to accommodate these characteristics. The modified online clustering algorithm is applied to adaptively discover the structure of the Pareto optimal set; and the learned structure is used to guide new solution creation. Experimental results have shown significant improvement over four state-of-the-art MOEAs on a variety of benchmark problems.

16 May 2022 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Open access
WCWenjie Chen
Wenjie Chen
WHWenjing Hong
Wenjing Hong
HZHu Zhang
Hu Zhang
PYPeng Yang
Peng Yang
KTKe Tang
Ke Tang
Multi-fidelity simulation is an effective approach to balancing speed and accuracy in expensive simulation, and its performance is affected by the quality of multi-fidelity simulation models. Building high-quality simulation models is non-trivial, especially for complex systems, because current manual modeling methods require sufficient domain knowledge and experience, increasing the labor and time costs. Motivated by the issues, this paper focuses on one of the most crucial simulation types, discrete event simulation, and develops a computer-aid multi-fidelity simulation modeling method called Optimization-based Multi-fidelity Simulation Modeling (OMFSM). OMFSM formulates multi-fidelity simulation modeling as a bi-objective simulation optimization problem to optimize speed and accuracy. An efficient optimization algorithm called Multi-objective Simulation Optimization based on Hypervolume (MOSO-HV) is tailored to select a set of high-quality models. Experimental results in a digital twin emergency department demonstrate that the computer-aid modeling method builds more and better multi-fidelity simulation models than manual modeling and reveal the effectiveness of MOSO-HV for OMFSM. The utility of OMFSM in multi-fidelity simulation is also justified by a real-world optimization problem.

17 January 2024 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
XGXiangzhou Gao
Xiangzhou Gao
SSShenmin Song
Shenmin Song
HZHu Zhang
Hu Zhang
Zhenkun WangZhenkun Wang
Zhenkun Wang
Due to the curse of dimensionality, the search efficiency of existing operators in large-scale decision space deteriorates dramatically. The competitive swarm optimizer-based framework has great potential in tackling large-scale single-objective optimization problems. However, the existing competitive swarm optimizers only focus on the loser to winner learning paradigm and neglect the significance of the winner determination mechanism for large-scale search, which makes the algorithm difficult to escape from local optima. To remedy this issue, a flexible ranking-based competitive swarm optimizer has been tailored for handling large-scale multi-objective optimization problems (MOPs). Concretely, a novel winner determination strategy is introduced to broadly identify high-quality individuals in the population to enhance diversity maintenance. In addition, a special competitive mechanism is adopted to guide the search direction, which is capable of efficiently increasing search space utilization. The simulation results validate that the proposed algorithm can significantly enhance the exploration and exploitation ability of the conventional competitive swarm optimizer, and outperforms several state-of-the-art large-scale multi-objective optimization algorithms on both large-scale benchmark MOPs and application examples.

12 September 2019 in IEEE Access
Verified
Journal Article
Open access
SWShuai Wang
Shuai Wang
HZHu Zhang
Hu Zhang
YZYi Zhang
Yi Zhang
AZAimin Zhou
Aimin Zhou
PWPeng Wu
Peng Wu
In evolutionary multi-objective optimization, it has been illuminated that guide search with neighboring solutions improve the quality of new trial solutions and accelerate algorithms convergence by the regularity property of the continuous multi-objective optimization problems (MOPs). Very recently, clustering learning-based mating strategies have been popular for establishing reproduction operators with neighboring solutions. However, the existing mating strategies may be more reasonable with the full consideration and utilization of the regularity property. The current mating restrictions excessively emphasize algorithm convergence and ignore population diversity. In addition, the selected clustering algorithms in mating restrictions are not conducive for solving MOPs, which have complex Pareto sets (PSs) andnor Pareto fronts (PFs). To solve above problems and address both the algorithm convergence and the population diversity of multi-objective evolutionary algorithms (MOEAs), the spectral clustering based multi-source mating selection strategy (SMMS) is designed to detect regularity properties and balance population diversity while accelerating algorithm convergence. Consequently, a spectral clustering based multi-source mating selection multi-objective evolutionary algorithms is proposed, teamed SMMEA. SMMEA is applied to a number of test suites with a complex PS or PF, and compared with six state-of-theart MOEAs. The results demonstrate that the proposed algorithm outperforms over the other approaches.

12 April 2017 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
YZYi Zhang
Yi Zhang
ZLZimu Li
Zimu Li
HZHu Zhang
Hu Zhang
ZYZhen Yu
Zhen Yu
TLTongtong Lu
Tongtong Lu