Lei Yang

Lei Yang

Auto-generated profile, based on publicly available information

Lei Yang

South China Agricultural University

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
12 February 2024 in Applied Soft Computing
Verified
Journal Article
Closed access
LYLei Yang
Lei Yang
YZYuanye Zhang
Yuanye Zhang
JCJiale Cao
Jiale Cao
KLKangshun Li
Kangshun Li
DWDongya Wang
Dongya Wang

26 April 2016 in Soft Computing
Verified
Journal Article
Closed access
PDF file
LYLei Yang
Lei Yang
KLKangshun Li
Kangshun Li
WZWensheng Zhang
Wensheng Zhang
ZKZhenxu Ke
Zhenxu Ke

16 April 2016 in Soft Computing
Verified
Journal Article
Closed access
PDF file
WLWei Li
Wei Li
KLKangshun Li
Kangshun Li
YHYing Huang
Ying Huang
SYShuling Yang
Shuling Yang
LYLei Yang
Lei Yang

31 March 2021 in IEEE Access
Verified
Journal Article
Open access
ZZZitong Zhang
Zitong Zhang
LYLei Yang
Lei Yang
PKPeipei Kang
Peipei Kang
XJXiaotian Jia
Xiaotian Jia
WZWensheng Zhang
Wensheng Zhang
The traveling thief problem (TTP) is a challenging combinatorial optimization problem that has attracted many scholars, the problem interconnects two well-known NP-hard problems: the traveling salesman problem and the 0-1 knapsack problem. Various approaches have increasingly been proposed to solve this novel problem that combines two interdependent subproblems. In this paper, the TTP is investigated theoretically and empirically. This paper proposed an approach based on item selection weight and reverse-order allocation. A novel method to calculate the score value of each item for item selection, which expands the effect of the item's weight, was introduced. Furthermore, the approach adopted reverse-order allocation, which selects items in an inverse order according to the traveling route. Different approaches for solving the TTP are compared and analyzed. The experimental investigations suggest that our proposed approach is competitive for many instances of various sizes and types compared to other heuristics.

28 November 2025 in Applied Soft Computing
Verified
Journal Article
Closed access
KDKaixi Deng
Kaixi Deng
LYLei Yang
Lei Yang
HYHaiqin Yao
Haiqin Yao
DZDongbin Zheng
Dongbin Zheng
KLKangshun Li
Kangshun Li
Ke LiKe Li
Ke Li

26 May 2020
Verified
Book Chapter
Closed access
PDF file
LYLei Yang
Lei Yang
XHXin Hu
Xin Hu
KLKangshun Li
Kangshun Li
WJWeijia Ji
Weijia Ji
QHQiongdan Hu
Qiongdan Hu
DWDongya Wang
Dongya Wang