Yiqiao Cai

Prof. Dr. Yiqiao Cai


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
13 January 2017 in Sensors
Verified
Journal Article
Open access
PDF file
Tian WangTian Wang
Tian Wang
WQWu Qun
Wu Qun
VWVincent Sheng Wen
Vincent Sheng Wen
YCYiqiao Cai
Yiqiao Cai
Hui TianHui Tian
Hui Tian
BWBaowei Wang
Baowei Wang
WSANs (Wireless Sensor and Actuator Networks) are derived from traditional wireless sensor networks by introducing mobile actuator elements. Previous studies indicated that mobile actuators can improve network performance in terms of data collection, energy supplementation, etc. However, according to our experimental simulations, the actuator’s mobility also causes the sensor worm to spread faster if an attacker launches worm attacks on an actuator and compromises it successfully. Traditional worm propagation models and defense strategies did not consider the diffusion with a mobile worm carrier. To address this new problem, we first propose a microscopic mathematical model to describe the propagation dynamics of the sensor worm. Then, a two-step local defending strategy (LDS) with a mobile patcher (a mobile element which can distribute patches) is designed to recover the network. In LDS, all recovering operations are only taken in a restricted region to minimize the cost. Extensive experimental results demonstrate that our model estimations are rather accurate and consistent with the actual spreading scenario of the mobile sensor worm. Moreover, on average, the LDS outperforms other algorithms by approximately 50% in terms of the cost.

19 April 2015 in Soft Computing
Verified
Journal Article
Closed access
PDF file
JLJingliang Liao
Jingliang Liao
YCYiqiao Cai
Yiqiao Cai
TWTian Wang
Tian Wang
Hui TianHui Tian
Hui Tian
YCYonghong Chen
Yonghong Chen

12 February 2020 in IEEE Systems Journal
Verified
Journal Article
Closed access
YZYing Zhou
Ying Zhou
LKLingjing Kong
Lingjing Kong
YCYiqiao Cai
Yiqiao Cai
ZWZiyan Wu
Ziyan Wu
SLShaopeng Liu
Shaopeng Liu
KWKeke Wu
Keke Wu
Vehicle routing problem with simultaneous delivery and pickup and time windows (VRPSDPTW) is an important logistics problem in supply chain network optimization. However, at present, existing approaches are only applied to solve small-scale many-objective VRPSDPTW. For the large-scale problem, to obtain high-quality solutions (effectively) and solve the problem in a short running time (efficiently), we focus on two issues: 1) how to handle many-objective property and 2) how to tackle large-scale property of the problem. For the first issue, to enhance the convergence property, a novel local search algorithm utilizing seven neighborhood operators is proposed. Meanwhile, to maintain the diversity property, the concept of decomposition is adopted. The problem is first decomposed into multiple single-objective problems, then local search is utilized to optimize these subproblems. For the second issue, since optimizing a subproblem by local search is time consuming for large-scale problems, the key point is how to allocate the computational resources and balance the convergence and diversity. To handle this problem, a weight space partition strategy is introduced. Finally, a decomposition-based local search algorithm is proposed for many-objective VRPSDPTW. Experimental results on the large-scale instances provided by Chinese logistic company show the effectiveness of the proposed algorithm.

18 November 2014 in Soft Computing
Verified
Journal Article
Closed access
PDF file
YCYiqiao Cai
Yiqiao Cai
JWJiahai Wang
Jiahai Wang
YCYonghong Chen
Yonghong Chen
TWTian Wang
Tian Wang
Hui TianHui Tian
Hui Tian
WLWei Luo
Wei Luo

5 March 2016 in Soft Computing
Verified
Journal Article
Closed access
PDF file
YCYiqiao Cai
Yiqiao Cai
MZMeng Zhao
Meng Zhao
JLJingliang Liao
Jingliang Liao
TWTian Wang
Tian Wang
Hui TianHui Tian
Hui Tian
YCYonghong Chen
Yonghong Chen

12 August 2024 in Symmetry
Verified
Journal Article
Open access
PDF file
JDJianjun Deng
Jianjun Deng
JWJunjie Wang
Junjie Wang
XWXiaojun Wang
Xiaojun Wang
YCYiqiao Cai
Yiqiao Cai
PLPeizhong Liu
Peizhong Liu
The vehicle routing problem with time windows (VRPTW) is a widely studied combinatorial optimization problem in supply chains and logistics within the last decade. Recent research has explored the potential of deep reinforcement learning (DRL) as a promising solution for the VRPTW. However, the challenge of addressing the VRPTW with many conflicting objectives (MOVRPTW) still remains for DRL. The MOVRPTW considers five conflicting objectives simultaneously: minimizing the number of vehicles required, the total travel distance, the travel time of the longest route, the total waiting time for early arrivals, and the total delay time for late arrivals. To tackle the MOVRPTW, this study introduces the MTMO/DRP-AT, a multi-task multi-objective evolutionary search algorithm, by making full use of both DRL and the multitasking mechanism. In the MTMO/DRL-AT, a two-objective MOVRPTW is constructed as an assisted task, with the objectives being to minimize the total travel distance and the travel time of the longest route. Both the main task and the assisted task are simultaneously solved in a multitasking scenario. Each task is decomposed into scalar optimization subproblems, which are then solved by an attention model trained using DRL. The outputs of these trained models serve as the initial solutions for the MTMO/DRL-AT. Subsequently, the proposed algorithm incorporates knowledge transfer and multiple local search operators to further enhance the quality of these promising solutions. The simulation results on real-world benchmarks highlight the superior performance of the MTMO/DRL-AT compared to several other algorithms in solving the MOVRPTW.