Xueting He
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xueting He has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Lu Zhen
School of Management, Shanghai University, Shanghai, China
7 shared publications - Shuaian Wang
Faculty of Business, The Hong Kong Polytechnic University, Hung Hom 999077, Hong Kong
3 shared publications - Jingwen Wu
School of Management, Shanghai University
2 shared publications Linying Yang
School of Management, Shanghai University, Shanghai, China
2 shared publications- Binqi Zhang
Shanghai University
1 shared publication - Hao Quan
Shibei Hospital, Jing’an District, Shanghai, China
1 shared publication
Latest Publications
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 73 (00189391) , 2438-2455
Coal Procurement Optimization in Coastal Power Plants
Coal-fired power generation remains prominent in China, particularly at coastal power plants, which receive low-cost coal from international suppliers through their ports. Thus, optimizing the coal procurement and transportation strategies at such plants is crucial for improving their operations. Considering a coastal power plant in China, this study introduces a mixed-integer linear programming model integrating factors related to coal combustion, supplier selection, and coal transportation. A machine learning-accelerated column generation algorithm is designed to solve this model. Numerical experiments demonstrate the effectiveness and computational efficiency of this algorithm in solving large-scale problems. Furthermore, a sensitivity analysis provides valuable managerial insights for such power plants, particularly regarding how operators should adjust coal procurement strategies under uncertain electricity demand. The findings reveal that optimizing the inventory allocation for different coals and the selection of coal transport vessels can reduce procurement costs. Validated by real-world data from CHN Energy Quanzhou and extensive sensitivity analyses, this study ensures high research rigor and robust decision support.
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 73 (00189391) , 2438-2455
Coal Procurement Optimization in Coastal Power Plants
Coal-fired power generation remains prominent in China, particularly at coastal power plants, which receive low-cost coal from international suppliers through their ports. Thus, optimizing the coal procurement and transportation strategies at such plants is crucial for improving their operations. Considering a coastal power plant in China, this study introduces a mixed-integer linear programming model integrating factors related to coal combustion, supplier selection, and coal transportation. A machine learning-accelerated column generation algorithm is designed to solve this model. Numerical experiments demonstrate the effectiveness and computational efficiency of this algorithm in solving large-scale problems. Furthermore, a sensitivity analysis provides valuable managerial insights for such power plants, particularly regarding how operators should adjust coal procurement strategies under uncertain electricity demand. The findings reveal that optimizing the inventory allocation for different coals and the selection of coal transport vessels can reduce procurement costs. Validated by real-world data from CHN Energy Quanzhou and extensive sensitivity analyses, this study ensures high research rigor and robust decision support.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 73, 4131-4147
Optimizing Chiplet Production Under Quality Uncertainty With Downward Substitution
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 73, 4131-4147
Optimizing Chiplet Production Under Quality Uncertainty With Downward Substitution
- 1 September 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 59 (5) , 1130-1152
Optimizing Warehouse Operations with Autonomous Mobile Robots
Autonomous mobile robots (AMRs) can support human pickers in warehouse picking operations by reducing picker walking distance and increasing the warehouse’s throughput. AMR-assisted order picking is becoming popular as it can be conveniently implemented in conventional warehouses. This study proposes an integrated optimization model for scheduling the operations in AMR-assisted picker-to-parts warehouse systems. The model aims to minimize the makespan of all picking operations for a batch of orders by assigning batched orders to AMRs, selecting storage racks for AMRs and pickers to visit, and determining the routes of the AMRs and the pickers. A column- and row-generation algorithm is designed to solve the model using synchronization constraints between AMRs and pickers. Numerical experiments are conducted to validate the applicability of our proposed algorithm in a warehouse that handles 16,000 orders per day. Our algorithm can solve small-scale instances to optimality. Our algorithm can also obtain better solutions in less time than a column generation (CG)–based method. Extensive experiments are conducted to derive managerial insights. Funding: This research was supported by the National Natural Science Foundation of China [Grants 72025103, 72394360, 72394362, 72401179, 72361137001, and 72371221], the Project of Science and Technology Commission of Shanghai Municipality China [Grant 23JC1402200], and the Research Grants Council of the Hong Kong Special Administrative Region, China (Project number HKSAR RGC TRS T32-707/22-N). Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0800 .
- 1 September 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 59 (5) , 1130-1152
Optimizing Warehouse Operations with Autonomous Mobile Robots
Autonomous mobile robots (AMRs) can support human pickers in warehouse picking operations by reducing picker walking distance and increasing the warehouse’s throughput. AMR-assisted order picking is becoming popular as it can be conveniently implemented in conventional warehouses. This study proposes an integrated optimization model for scheduling the operations in AMR-assisted picker-to-parts warehouse systems. The model aims to minimize the makespan of all picking operations for a batch of orders by assigning batched orders to AMRs, selecting storage racks for AMRs and pickers to visit, and determining the routes of the AMRs and the pickers. A column- and row-generation algorithm is designed to solve the model using synchronization constraints between AMRs and pickers. Numerical experiments are conducted to validate the applicability of our proposed algorithm in a warehouse that handles 16,000 orders per day. Our algorithm can solve small-scale instances to optimality. Our algorithm can also obtain better solutions in less time than a column generation (CG)–based method. Extensive experiments are conducted to derive managerial insights. Funding: This research was supported by the National Natural Science Foundation of China [Grants 72025103, 72394360, 72394362, 72401179, 72361137001, and 72371221], the Project of Science and Technology Commission of Shanghai Municipality China [Grant 23JC1402200], and the Research Grants Council of the Hong Kong Special Administrative Region, China (Project number HKSAR RGC TRS T32-707/22-N). Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0800 .
- 25 April 2025
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 196
Column-and-row generation based exact algorithm for relay-based on-demand delivery systems
- 25 April 2025
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 196
Column-and-row generation based exact algorithm for relay-based on-demand delivery systems
- 25 July 2024
- Published by Taylor & Francis in IISE Transactions
- Vol. 57 (8) , 957-975
Courier routing for a new last-mile logistics service
- 25 July 2024
- Published by Taylor & Francis in IISE Transactions
- Vol. 57 (8) , 957-975
Courier routing for a new last-mile logistics service
- 30 January 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 165
Optimizing high-speed railway express system under uncertainty
- 30 January 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 165
Optimizing high-speed railway express system under uncertainty
- 21 March 2023
- Published by Taylor & Francis in IISE Transactions
- Vol. 55 (12) , 1277-1294
Vehicle routing for customized on-demand bus services
This study investigates a variant of the vehicle routing problem (VRP) for customized on-demand bus service platforms. In this problem, the platform plans customized bus routes upon receiving a batch of orders released by passengers and informs the passengers of the planned pick-up and drop-off locations. The related decision process takes into account some passenger-side time window-related requirements, walking limits, the availability and capacities of various types of buses. A mixed-integer linear programming model of this new VRP variant with floating targets (passengers) is formulated. To solve the model efficiently, a solution method is developed that combines the branch-and-bound and column generation algorithms and includes embedded acceleration techniques such as the multi-labeling algorithm. Experiments based on real data from Dalian, China are conducted to validate the effectiveness of the proposed model and efficiency of the algorithm; the small-scale experimental results demonstrate our algorithm can obtain optimal results in majority of instances. Additionally, sensitivity analysis is conducted and model extensions are investigated to provide customized bus service platform operators with potentially useful managerial insights; for example, a platform need not establish as many candidate stops as possible, a wide range of walking distance may not bring early arrival at destinations for customers, more mini-buses should be deployed than large buses in our real-world case. Moreover, the rolling horizon based context and zoning strategies are also investigated by extending our proposed methodology.
- 21 March 2023
- Published by Taylor & Francis in IISE Transactions
- Vol. 55 (12) , 1277-1294
Vehicle routing for customized on-demand bus services
This study investigates a variant of the vehicle routing problem (VRP) for customized on-demand bus service platforms. In this problem, the platform plans customized bus routes upon receiving a batch of orders released by passengers and informs the passengers of the planned pick-up and drop-off locations. The related decision process takes into account some passenger-side time window-related requirements, walking limits, the availability and capacities of various types of buses. A mixed-integer linear programming model of this new VRP variant with floating targets (passengers) is formulated. To solve the model efficiently, a solution method is developed that combines the branch-and-bound and column generation algorithms and includes embedded acceleration techniques such as the multi-labeling algorithm. Experiments based on real data from Dalian, China are conducted to validate the effectiveness of the proposed model and efficiency of the algorithm; the small-scale experimental results demonstrate our algorithm can obtain optimal results in majority of instances. Additionally, sensitivity analysis is conducted and model extensions are investigated to provide customized bus service platform operators with potentially useful managerial insights; for example, a platform need not establish as many candidate stops as possible, a wide range of walking distance may not bring early arrival at destinations for customers, more mini-buses should be deployed than large buses in our real-world case. Moreover, the rolling horizon based context and zoning strategies are also investigated by extending our proposed methodology.
- Open Access
- 14 June 2021
- Published by Wiley in Scientific Programming
- Vol. 2021, 1-12
AGV Scheduling Optimization for Medical Waste Sorting System
The dramatic increase in medical waste has put a severe strain on sorting operations. Traditional manual order picking is extremely susceptible to infection spread among workers and picking errors, while automated medical waste sorting systems can handle large volumes of medical waste efficiently and reliably. This paper investigates the optimization problem in the automated medical waste sorting system by considering the operational flow of medical waste. For this purpose, a mixed-integer programming model is developed to optimize the assignment among medical waste, presorting stations, and AGVs. An effective variable neighborhood search based on dynamic programming algorithm is proposed, and extensive numerical experiments are conducted. It is found that the proposed algorithm can efficiently solve the optimization problem, and the sensitivity analysis gives recommendations for the speed setting of the conveyor.
- 14 June 2021
- Published by Wiley in Scientific Programming
- Vol. 2021, 1-12
Open AccessAGV Scheduling Optimization for Medical Waste Sorting System
The dramatic increase in medical waste has put a severe strain on sorting operations. Traditional manual order picking is extremely susceptible to infection spread among workers and picking errors, while automated medical waste sorting systems can handle large volumes of medical waste efficiently and reliably. This paper investigates the optimization problem in the automated medical waste sorting system by considering the operational flow of medical waste. For this purpose, a mixed-integer programming model is developed to optimize the assignment among medical waste, presorting stations, and AGVs. An effective variable neighborhood search based on dynamic programming algorithm is proposed, and extensive numerical experiments are conducted. It is found that the proposed algorithm can efficiently solve the optimization problem, and the sensitivity analysis gives recommendations for the speed setting of the conveyor.