Xiang Shi

Xiang Shi

Auto-generated profile, based on publicly available information

Xiang Shi

Department of Automation, Tsinghua University, Beijing, 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
11 August 2023 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
BXBin Xin
Bin Xin
SLSai Lu
Sai Lu
QWQing Wang
Qing Wang
FDFang Deng
Fang Deng
XSXiang Shi
Xiang Shi
YKYuhang Kang
Yuhang Kang
The flexible job-shop co-scheduling problem (FJCSP) for processing machines and automated guided vehicles (AGVs) in a flexible manufacturing system (FMS) has attracted more attention with the aim of improving production efficiency. In FMS, AGVs in charge of transporting jobs realize the flexible linkage of operations between different processing machines. The added interdependence between transporting and processing tasks brings more difficulties than the traditional flexible job-shop scheduling problem (FJSP). In this paper, the mathematical model of FJCSP is formulated to minimize the makespan. Considering the feature similarity of FJCSP with FJSP and AGV-routing problem in different cases, a multi-view modeling-based hybrid algorithm consisting of an estimation of distribution algorithm (EDA) and an ant colony optimization (ACO) is proposed. In EDA, a probability model abstracts the information in superior solutions about the operation sequencing and the rule selection for scheduling machines and AGVs. In ACO, a job-path pheromone model and an AGV-path pheromone model are designed to jointly select the job-machine-AGV combination with shorter processing time and transportation time. In the proposed hybrid algorithm, EDA and ACO generate solutions independently and achieve cooperation by sharing elites. An adaptive parameter is designed to regulate the use of the two methods to adapt to the varying demands of multi-view modeling in different cases and search stages. Furthermore, a local search with a three-layer operator based on the critical path method is proposed to balance exploration and exploitation in solution space. Finally, computational experiments involving a case study verified the advantage of the multi-view modeling-based hybrid algorithm in comparison with the state-of-the-art approaches. Note to Practitioners —This paper was motivated by the optimization problem of scheduling machines and automated guided vehicles (AGVs) in flexible manufacturing system (FMS). In FMS with AGVs, the transportation stages for jobs by AGVs significantly impact the overall production efficiency of the FMS and cannot be overlooked. This paper suggested a hybrid evolutionary algorithm using an estimation of distribution algorithm (EDA), an ant colony optimization (ACO) and a local search algorithm based on the critical path method. In the proposed hybrid algorithm, an adaptive parameter is introduced to regulate the utilization of EDA and ACO in generating a new population. This paper presents a mathematical characterization of the scheduling problem and subsequently outlines the step-by-step design of the hybrid algorithm. Computational experiments, including a case study, demonstrate that the hybrid algorithm exhibits adaptability to various instances and outperforms state-of-the-art approaches.

9 August 2021 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
XSXiang Shi
Xiang Shi
FDFang Deng
Fang Deng
YFYunfeng Fan
Yunfeng Fan
LMLin Ma
Lin Ma
YWYong Wang
Yong Wang
JCJie Chen
Jie Chen
The problem of order and rack assignment to picking stations (ORAPS) is a key joint optimization problem in the order picking process of the robotic mobile fulfillment system (RMFS). Given a set of customer orders and a set of mobile racks, the goal of this problem is to simultaneously assign orders and racks to multiple picking stations so that the racks can provide products to meet the demand of orders by the minimal number of visits to all picking stations. In this article, we build a mathematical model for the ORAPS, which considers all orders assignment with the allocable capacity interval of the picking station and the rack product capacity limitation. To solve the ORAPS problem, we propose a two-stage hybrid heuristic algorithm (TS-HHA) consisting of the reducing stage and the assigning stage. In the reducing stage, a scheme of dynamic programming (DP) is introduced to find a critical rack set, which can focus attention on the most promising racks and increase the speed of problem-solving. In the assigning stage, we propose an optimization strategy that combines a constructive heuristic algorithm and adaptive neighborhood search (CH-ANS). It can generate a high-quality simultaneous assignment scheme and further improve its quality effectively. The computational results show that our proposed algorithm performs better than its competitors on both simulation and practical instances of the ORAPS problem. Note to Practitioners—This article investigates the order and rack assignment to picking stations (ORAPS) problem in the robotic mobile fulfillment system (RMFS) originated from a renowned Chinese logistics platform. We build a more comprehensive and reasonable mathematical programming model for this ORAPS problem and propose a two-stage hybrid heuristic algorithm (TS-HHA) strategy, which can simultaneously assign orders and racks to multiple picking stations so that all customer orders can be processed. The experimental results show that our TS-HHA performs at least 35% better than its competitors on all simulation and practical instances set. We believe that this research work can serve as a kind of generic framework for practical ORAPS problems and be very helpful for operating the RMFS efficiently.

8 November 2023 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
XSXiang Shi
Xiang Shi
FDFang Deng
Fang Deng
MGMiao Guo
Miao Guo
JZJiachen Zhao
Jiachen Zhao
LMLin Ma
Lin Ma
JCJie Chen
Jie Chen
The emergence of a robotic mobile fulfillment system (RMFS) provides an automated solution for e-commerce warehousing to improve productivity and reduce labor costs. This article studies the order picking optimization problem in RMFS, which simultaneously decides the assignment of orders and racks to multiple picking stations. Although this problem has been widely studied in recent years, it is still very challenging for existing methods to solve large-scale instances effectively (e.g., more than 200 orders and 500 racks). To overcome this difficulty to meet the real-world needs, we propose a fulfillment-focused simultaneous assignment (FFSA) method. The proposed FFSA comprises two stages: 1) compression and 2) simultaneous assignment. The compression stage employs a hybrid adaptive large neighborhood search (ALNS) strategy to establish a reduced set of critical racks that can fulfill the demand of all orders. In the simultaneous assignment stage, we develop a marginal-return-based assignment with candidate strategy (MRACS) to simultaneously assign orders and critical racks to picking stations. MRACS takes into account three fulfillment-focused measurements to depict the product supply relationship between the demand of orders and the inventory on critical racks. These measurements are further integrated into the effective heuristics with sufficient problem-specific knowledge to obtain a high-quality solution. Experimental results show that our method significantly outperforms representative algorithms on both synthetic data and large-scale real-world data.

19 June 2019 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
YYYinghua Yang
Yinghua Yang
XSXiang Shi
Xiang Shi
XLXiaozhi Liu
Xiaozhi Liu
HLHongru Li
Hongru Li

27 June 2022
Verified
Conference Paper
Closed access
XSXiang Shi
Xiang Shi
XZXuan Zhou
Xuan Zhou
YFYunfeng Fan
Yunfeng Fan
LZLeLe Zhang
LeLe Zhang
FDFang Deng
Fang Deng
In this paper, a three-phase hybrid heuristic algorithm based on product supply relationship (TP-HHA) is proposed to deal with the problem of order and rack assignment for picking stations (ORAPS). The ORAPS occurs in the order picking process of robotic mobile fulfillment system (RMFS). It is an NP-hard problem so that the optimal algorithm is difficult to effectively solve it with larger scale instances, which cannot meet the requirements of real applications. To overcome this difficulty, we propose the TP-HHA. It firstly uses a problem decomposition frame to divide the ORAPS into three subproblems. Then, in each stage, a meta-heuristic or constructive heuristic is designed to solve the corresponding subproblem. In addition, a post-optimization strategy is employed to find a better solution. The sufficient neighborhood search operators with problem-specific knowledge are designed for both subproblem optimization and post-optimization. The computational results are given to verify the effectiveness of our algorithm.

21 April 2026 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
XZXuan Zhou
Xuan Zhou
XSXiang Shi
Xiang Shi
LZLele Zhang
Lele Zhang
CCChen Chen
Chen Chen
HLHongbo Li
Hongbo Li
JCJie Chen
Jie Chen
Multi-robot task planning (MRTP) at scale in robotic mobile fulfillment systems (RMFS) remains a challenge due to the curse of dimensionality and complex dynamic properties. Aiming to solve these challenges, we construct an end-to-end scalable multi-robot task planner capable of scaling to large-scale systems by learning hierarchical planning policies. In this planner, we design a centralized hierarchical temporal task planning framework to mitigate the curse of dimensionality while ensuring timely dynamic response. Following this framework, we propose a novel cycle-constrained asynchronous temporal graph (CycATG) to provide foundation for modeling the system dynamics. Based on the graph representation, we formulate the MRTP problem as a semi-Markov decision process (SMDP) that focuses solely on critical interaction points to improve computational and sampling efficiency. The policies in SMDP are parameterized via a hierarchical temporal attention network with temporal embedding layers to enhance spatio-temporal feature extraction. Additionally, the decoder masks in this network naturally ensure that the generated actions strictly satisfy the required dynamic hard constraints. The above hierarchical policies are jointly optimized using an efficient hierarchical REINFORCE with rollout counterfactual baseline method. To further enhance generalization performance on unlearned instances while preventing catastrophic forgetting, we extend it with region expansion curricula. Experiments demonstrate that our planner outperforms state-of-the-art methods on different MRTP instances across simulated and real-world RMFS. It successfully scales to instances with up to 200 robots, 1000 retrieval racks on unlearned maps while maintaining performance advantages.