Tailong Yang

Tailong Yang

Auto-generated profile, based on publicly available information

Tailong Yang

School of Computer and Artificial Intelligence, ZhengZhou University, Zhengzhou, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
3 January 2021 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
TYTailong Yang
Tailong Yang
SZShuyan Zhang
Shuyan Zhang
CLCuixia Li
Cuixia Li
A variety of meta-heuristics have shown promising performance for solving multi-objective optimization problems (MOPs). However, existing meta-heuristics may have the best performance on particular MOPs, but may not perform well on the other MOPs. To improve the cross-domain ability, this paper presents a multi-objective hyper-heuristic algorithm based on adaptive epsilon-greedy selection (HH_EG) for solving MOPs. To select and combine low-level heuristics (LLHs) during the evolutionary procedure, this paper also proposes an adaptive epsilon-greedy selection strategy. The proposed hyper-heuristic can solve problems from varied domains by simply changing LLHs without redesigning the high-level strategy. Meanwhile, HH_EG does not need to tune parameters, and is easy to be integrated with various performance indicators. We test HH_EG on the classical DTLZ test suite, the IMOP test suite, the many-objective MaF test suite, and a test suite of a real-world multi-objective problem. Experimental results show the effectiveness of HH_EG in combining the advantages of each LLH and solving cross-domain problems.

17 August 2023 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
SZShuyan Zhang
Shuyan Zhang
TYTailong Yang
Tailong Yang
JLJing Liang
Jing Liang
CYCaitong Yue
Caitong Yue
Despite the success of meta-heuristics for many computationally hard optimization problems, the design of meta-heuristics is dependent on the problem domain and needs to be tailored by experts. In contrast, selection hyper-heuristics are emerging cross-domain search methodologies that perform the search over the space of a set of low-level heuristics. In this study, we introduce a novel selection hyper-heuristic to learn, select, and apply low-level heuristics to solve multiobjective optimization problems. The proposed selection hyper-heuristic is an iterative process that includes three main components: 1) the reward balance strategy; 2) the bandit-based learning strategy; and 3) the multistage selection strategy. The performance and behavior of the proposed selection hyper-heuristic are investigated on a range of benchmarks as well as several real-world problems. The empirical results demonstrate the effectiveness and the cross-domain ability of the proposed selection hyper-heuristic by comparing it with several state-of-the-art algorithms.