Xiaoshu Xiang

Xiaoshu Xiang

Auto-generated profile, based on publicly available information

Xiaoshu Xiang

Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Institutes of Physical Science and Information Technology, Anhui University, Hefei, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
28 January 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
XXXiaoshu Xiang
Xiaoshu Xiang
Ye TianYe Tian
Ye Tian
XZXingyi Zhang
Xingyi Zhang
JXJ H Xiao
J H Xiao
YJYaochu Jin
Yaochu Jin
Dynamic vehicle routing problems (DVRPs) have become a hot research topic due to their significance in logistics, although it is still very challenging for existing algorithms to solve DVRPs due to the dynamically changing customer requests during the optimization. In this paper, we propose a pairwise proximity learning-based ant colony algorithm, termed PPL-ACO, for tackling DVRPs. In PPL-ACO, a pairwise proximity learning method is suggested to predict the local visiting order of customers in the optimal route after the occurrence of changes, which is on the basis of learning from the optimal routes found before the changes occur. A radial basis function network is used to learn the local visiting order of customers based on the proximity between each pair of customer nodes, by which the optimal routes can be quickly tracked after changes occur. Experimental results on 22 popular DVRP instances show that the proposed PPL-ACO significantly outperforms four state-of-the-art approaches to DVRPs. More interestingly, the results on five large-scale DVRP instances demonstrate the superiority of the proposed PPL-ACO in solving large-scale DVPRs with up to 1000 customers. The results on a real case of Nankai Strict, Tianjin, China also verifies that the proposed PPL-ACO is more effective and efficient than the four compared approaches in solving real-world DVRPs.

25 December 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
XXXiaoshu Xiang
Xiaoshu Xiang
Ye TianYe Tian
Ye Tian
JXJ H Xiao
J H Xiao
XZXingyi Zhang
Xingyi Zhang
The shelter location is very important for evacuation planning in natural disasters, and evolutionary algorithms have demonstrated their effectiveness in solving this challenging problem. However, few evolutionary algorithms have been reported focusing on the shelter location under uncertainty of road networks due to the expensive cost of calculating the evacuation distance for individual evaluation. To address this issue, in this paper we propose a clustering-based surrogate-assisted multi-objective evolutionary algorithm, termed AR-MOEA+SA, in the framework of a recently developed evolutionary algorithm AR-MOEA. In AR-MOEA+SA, a surrogate model, the radial basis function (RBF), is adopted to approximately calculate the evacuation distance under uncertainty of road networks. Due to the fact that there often exist a large number of communities needing to be considered in shelter location, a clustering strategy is suggested to convert the surrogate of high-dimensional problem into the one of low-dimensional problem in the proposed AR-MOEA+SA for efficiently building the RBF network. A population initialization strategy is also suggested in AR-MOEA+SA to enhance the quality of training data in the early stages of evolution. Experimental results on a variety of test instances demonstrate the superiority of the proposed AR-MOEA+SA over the original version of AR-MOEA in terms of both computational efficiency and solution quality.

30 August 2024 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
CWChao Wang
Chao Wang
MCMengmeng Cao
Mengmeng Cao
HJHao Jiang
Hao Jiang
XXXiaoshu Xiang
Xiaoshu Xiang
XZXingyi Zhang
Xingyi Zhang
The Capacitated Electric Vehicle Routing Problem (CEVRP) poses a novel challenge within the field of vehicle routing optimization, as it requires consideration of both customer service requirements and electric vehicle recharging schedules. In addressing the CEVRP, Adaptive Large Neighborhood Search (ALNS) has garnered widespread acclaim due to its remarkable adaptability and versatility. However, the original ALNS, using a weight-based scoring method, relies solely on the past performances of operators to determine their weights, thereby failing to capture crucial information about the ongoing search process. Moreover, it often employs a fixed single charging strategy for the CEVRP, neglecting the potential impact of alternative charging strategies on solution improvement. Therefore, this study treats the selection of operators as a Markov Decision Process and introduces a novel approach based on Deep Reinforcement Learning (DRL) for operator selection. This approach enables adaptive selection of both destroy and repair operators, alongside charging strategies, based on the current state of the search process. More specifically, a state extraction method is devised to extract features not only from the problem itself but also from the solutions generated during the iterative process. Additionally, a novel reward function is designed to guide the DRL network in selecting an appropriate operator portfolio for the CEVRP. Experimental results demonstrate that the proposed algorithm excels in instances with fewer than 100 customers, achieving the best values in 7 out of 8 test instances. It also maintains competitive performance in instances with over 100 customers and requires less time compared to population-based methods.

1 June 2022 in IEEE Transactions on Cognitive and Developmental Systems
Verified
Journal Article
Closed access
SYShangshang Yang
Shangshang Yang
Ye TianYe Tian
Ye Tian
XXXiaoshu Xiang
Xiaoshu Xiang
SPShichen Peng
Shichen Peng
XZXingyi Zhang
Xingyi Zhang
Evolutionary neural architecture search (ENAS) has recently received increasing attention by effectively finding high-quality neural architectures, which however consumes high computational cost by training the architecture encoded by each individual for complete epochs in individual evaluation. Numerous ENAS approaches have been developed to reduce the evaluation cost, but it is often difficult for most of these approaches to achieve high evaluation accuracy. To address this issue, in this paper we propose an accelerated ENAS via multi-fidelity evaluation termed MFENAS, where the individual evaluation cost is significantly reduced by training the architecture encoded by each individual for only a small number of epochs. The balance between evaluation cost and evaluation accuracy is well maintained by suggesting a multi-fidelity evaluation, which identifies the potentially good individuals that cannot survive from previous generations by integrating multiple evaluations under different numbers of training epochs. Besides, a population initialization strategy is devised to produce diverse neural architectures varying from ResNet-like architectures to Inception-like ones. As shown by experiments, the proposed MFENAS takes only 0.6 GPU days to find the best architecture holding a 2.39% test error rate, which is superior to most state-of-the-art NAS approaches. And the architectures transferred to CIFAR-100 and ImageNet also exhibit competitive performance.

12 July 2023 in IEEE Transactions on Transportation Electrification
Verified
Journal Article
Closed access
CWChao Wang
Chao Wang
FQFang Qin
Fang Qin
XXXiaoshu Xiang
Xiaoshu Xiang
HJHao Jiang
Hao Jiang
XZXingyi Zhang
Xingyi Zhang
The capacitated electric vehicle routing problem is a challenging non-deterministic polynomial hard (NP-hard) problem consisting of two interdependent sub-problems, the routing optimization problem and the charging decision problem. The routing optimization for electric vehicles with limited driving range is dependent on the available charging stations, while the charging decision is based on the charging demand that is estimated on the fixed route in return. Taking this coupling relationship into consideration, this paper proposes a dual-population based co-evolutionary algorithm that uses two evolution populations to collaboratively optimize these two sub-problems. In routing population, the charging station is regarded as a kind of customer with no demand, and an improved ant colony optimization algorithm is designed to generate routes that involve the position information of charging stations. In charging population, a binary genetic algorithm is used to generate a population of charging schemes whose qualities are evaluated based on the best ant obtained from the routing population, and then the resultant solution by inserting the best charging scheme is used to update the pheromone for the routing generation. Through the information interaction during the evolution, these two populations collaboratively search for the optimal solution of the problem. Experimental results demonstrate that the proposed algorithm can be able to avoid falling into the local optimum and has a reduction of about 4% in route distance averaged over two test suites. Additionally, it also has a high computational efficiency, which is faster than the advanced ant colony optimization method by about 2 times.

23 June 2021 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
YSYansen Su
Yansen Su
JLJia Liu
Jia Liu
XXXiaoshu Xiang
Xiaoshu Xiang
XZXingyi Zhang
Xingyi Zhang
Large-scale dynamic vehicle routing problem (LSDVRP) is exhibiting extensive application prospect with the rapid growth of online logistics, whereas a few approaches have been developed to address LSDVRPs. The difficulty in solving LSDVRPs lies in that it requires quick response and high adaptability to numerous newly appeared customers in LSDVRPs. To overcome this difficulty, in this paper, we propose a responsive ant colony optimization algorithm, termed as RACO, for efficiently addressing LSDVRPs. In the proposed RACO, a pheromone diversity enhancing method is suggested to generate diverse pheromone matrices for quickly responding to newly appeared customer requests in solving LSDVRPs. A pheromone ensemble technique is further designed to produce a high-quality initial population that well adapts to the new customer requests by making use of diverse pheromone matrices. Empirical results on a set of 12 LSDVRP test instances demonstrate the effectiveness of the suggested pheromone diversity enhancing method in quickly responding to newly appeared customer requests for solving LSDVRPs. Moreover, we investigate the computational cost and the traveling cost obtained by the proposed RACO to evaluate responsiveness and adaptability of the proposed RACO, respectively. Comparison with four state-of-the-art approaches to DVRPs validates the superiority of the proposed RACO in addressing LSDVRPs in terms of responsiveness and adaptability.