Shuangchi He
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shuangchi He has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Jitendra Kumar Tugnait
Auburn University
17 shared publications - Jim G. Dai
School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853
4 shared publications Xiaohong Meng
Auburn Univ., Auburn
4 shared publications- Meilin Zhang
College of Earth Sciences, Northeast Petroleum University, Heilongjiang Province 163318, China
3 shared publications - Dacheng Yao
Chinese Academy of Sciences
2 shared publications - Dongling Rong
School of Management, Xi’an Jiaotong University, Shaanxi 710049, China
2 shared publications
Latest Publications
- Open Access
Randomized Routing to Remote Queues
We study load balancing for a queueing system where parallel stations are distant from customers. In the presence of traveling delays, the join-the-shortest-queue (JSQ) policy induces queue length oscillations and prolongs the mean waiting time. A variant of the JSQ policy, dubbed the randomized join-the-shortest-queue (RJSQ) policy, is devised to mitigate the oscillation phenomenon. By the RJSQ policy, customers are sent to each station with a probability approximately proportional to its service capacity; only a small fraction of customers are purposely routed to the shortest queue. The additional probability of routing a customer to the shortest queue, referred to as the balancing fraction, dictates the policy's performance. When the balancing fraction is within a certain range, load imbalance between the stations is negligible in heavy traffic, so that complete resource pooling is achieved. We specify the optimal order of magnitude for the balancing fraction, by which heuristic formulas are proposed to fine-tune the RJSQ policy. A joint problem of capacity planning and load balancing is considered for geographically separated stations. With well planned service capacities, the RJSQ policy sends all but a small fraction of customers to the nearest stations, rendering the system asymptotically equivalent to an aggregated single-server system with all customers having minimum traveling delays. If each customer's service requirement does not depend on the station, the RJSQ policy is asymptotically optimal for reducing workload.
Open AccessRandomized Routing to Remote Queues
We study load balancing for a queueing system where parallel stations are distant from customers. In the presence of traveling delays, the join-the-shortest-queue (JSQ) policy induces queue length oscillations and prolongs the mean waiting time. A variant of the JSQ policy, dubbed the randomized join-the-shortest-queue (RJSQ) policy, is devised to mitigate the oscillation phenomenon. By the RJSQ policy, customers are sent to each station with a probability approximately proportional to its service capacity; only a small fraction of customers are purposely routed to the shortest queue. The additional probability of routing a customer to the shortest queue, referred to as the balancing fraction, dictates the policy's performance. When the balancing fraction is within a certain range, load imbalance between the stations is negligible in heavy traffic, so that complete resource pooling is achieved. We specify the optimal order of magnitude for the balancing fraction, by which heuristic formulas are proposed to fine-tune the RJSQ policy. A joint problem of capacity planning and load balancing is considered for geographically separated stations. With well planned service capacities, the RJSQ policy sends all but a small fraction of customers to the nearest stations, rendering the system asymptotically equivalent to an aggregated single-server system with all customers having minimum traveling delays. If each customer's service requirement does not depend on the station, the RJSQ policy is asymptotically optimal for reducing workload.
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (2) , 413-427
Satisficing Approach to On-Demand Ride Matching
Online ride-hailing platforms have developed into an integral part of the transportation infrastructure in many countries. The primary task of a ride-hailing platform is to match trip requests to drivers in real time. Although both passengers and drivers prefer a prompt pickup to initiate the trips, it is often difficult to find a nearby driver for every passenger. If the driver is far from the pickup point, the passenger may cancel the trip while the driver is heading toward the pickup point. For the platform to be profitable, the trip cancellation rate must be maintained at a low level. We propose a computationally efficient data-driven approach to ride matching, in which a pickup time target is imposed on each trip request and an optimization problem is formulated to maximize the joint probability of all the pickup times meeting the targets. By adjusting pickup time targets individually, this approach may assign more high-value trip requests to nearby drivers, thus boosting the platform’s revenue while maintaining a low cancellation rate. In numerical experiments, the proposed approach outperforms several ride-matching policies used in practice. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Funding: This work of D. Rong and X. Sun was supported in part by the National Natural Science Foundation of China [Grant 71971165], the National Key Research and Development Program of China [Grant 2021YFB3301801], the MOE Project of Humanities and Social Science of China [Grant 19YJE630002], and the Soft Science Research Program of Shannxi [Grant 2018KRZ005]. The work of S. He was supported in part by the Singapore Ministry of Education Social Science Research Council [Grant MOE2022-SSRTG-029]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2021.0210 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2021.0210 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (2) , 413-427
Satisficing Approach to On-Demand Ride Matching
Online ride-hailing platforms have developed into an integral part of the transportation infrastructure in many countries. The primary task of a ride-hailing platform is to match trip requests to drivers in real time. Although both passengers and drivers prefer a prompt pickup to initiate the trips, it is often difficult to find a nearby driver for every passenger. If the driver is far from the pickup point, the passenger may cancel the trip while the driver is heading toward the pickup point. For the platform to be profitable, the trip cancellation rate must be maintained at a low level. We propose a computationally efficient data-driven approach to ride matching, in which a pickup time target is imposed on each trip request and an optimization problem is formulated to maximize the joint probability of all the pickup times meeting the targets. By adjusting pickup time targets individually, this approach may assign more high-value trip requests to nearby drivers, thus boosting the platform’s revenue while maintaining a low cancellation rate. In numerical experiments, the proposed approach outperforms several ride-matching policies used in practice. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Funding: This work of D. Rong and X. Sun was supported in part by the National Natural Science Foundation of China [Grant 71971165], the National Key Research and Development Program of China [Grant 2021YFB3301801], the MOE Project of Humanities and Social Science of China [Grant 19YJE630002], and the Soft Science Research Program of Shannxi [Grant 2018KRZ005]. The work of S. He was supported in part by the Singapore Ministry of Education Social Science Research Council [Grant MOE2022-SSRTG-029]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2021.0210 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2021.0210 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 25 June 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Satisficing Approach to On-Demand Ride Matching
Online ride-hailing platforms have developed into an integral part of the transportation infrastructure in many countries. The primary task of a ride-hailing platform is to match trip requests to drivers in real time. Although both passengers and drivers prefer a prompt pickup to initiate their trips, it is often difficult to find a nearby driver for every passenger. If the driver is far from the pickup point, the passenger may cancel the trip while the driver is heading toward the pickup point. In order for the platform to be profitable, the trip cancellation rate must be maintained at a low level. We propose a data-driven, computationally efficient approach to ride matching, in which a pickup time target is imposed on each trip request and an optimization problem is formulated to maximize the joint probability of all the pickup times meeting the targets. By adjusting pickup time targets individually, this approach may assign more high-value trip requests to nearby drivers, thus boosting the platform’s revenue while maintaining a low cancellation rate. In numerical experiments, the proposed approach outperforms several ride-matching policies used in practice.
- 25 June 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Satisficing Approach to On-Demand Ride Matching
Online ride-hailing platforms have developed into an integral part of the transportation infrastructure in many countries. The primary task of a ride-hailing platform is to match trip requests to drivers in real time. Although both passengers and drivers prefer a prompt pickup to initiate their trips, it is often difficult to find a nearby driver for every passenger. If the driver is far from the pickup point, the passenger may cancel the trip while the driver is heading toward the pickup point. In order for the platform to be profitable, the trip cancellation rate must be maintained at a low level. We propose a data-driven, computationally efficient approach to ride matching, in which a pickup time target is imposed on each trip request and an optimization problem is formulated to maximize the joint probability of all the pickup times meeting the targets. By adjusting pickup time targets individually, this approach may assign more high-value trip requests to nearby drivers, thus boosting the platform’s revenue while maintaining a low cancellation rate. In numerical experiments, the proposed approach outperforms several ride-matching policies used in practice.
- Open Access
Statistical Dependency Guided Contrastive Learning for Multiple Labeling in Prenatal Ultrasound
Standard plane recognition plays an important role in prenatal ultrasound (US) screening. Automatically recognizing the standard plane along with the corresponding anatomical structures in US image can not only facilitate US image interpretation but also improve diagnostic efficiency. In this study, we build a novel multi-label learning (MLL) scheme to identify multiple standard planes and corresponding anatomical structures of fetus simultaneously. Our contribution is three-fold. First, we represent the class correlation by word embeddings to capture the fine-grained semantic and latent statistical concurrency. Second, we equip the MLL with a graph convolutional network to explore the inner and outer relationship among categories. Third, we propose a novel cluster relabel-based contrastive learning algorithm to encourage the divergence among ambiguous classes. Extensive validation was performed on our large in-house dataset. Our approach reports the highest accuracy as 90.25% for standard planes labeling, 85.59% for planes and structures labeling and mAP as 94.63%. The proposed MLL scheme provides a novel perspective for standard plane recognition and can be easily extended to other medical image classification tasks.
Open AccessStatistical Dependency Guided Contrastive Learning for Multiple Labeling in Prenatal Ultrasound
Standard plane recognition plays an important role in prenatal ultrasound (US) screening. Automatically recognizing the standard plane along with the corresponding anatomical structures in US image can not only facilitate US image interpretation but also improve diagnostic efficiency. In this study, we build a novel multi-label learning (MLL) scheme to identify multiple standard planes and corresponding anatomical structures of fetus simultaneously. Our contribution is three-fold. First, we represent the class correlation by word embeddings to capture the fine-grained semantic and latent statistical concurrency. Second, we equip the MLL with a graph convolutional network to explore the inner and outer relationship among categories. Third, we propose a novel cluster relabel-based contrastive learning algorithm to encourage the divergence among ambiguous classes. Extensive validation was performed on our large in-house dataset. Our approach reports the highest accuracy as 90.25% for standard planes labeling, 85.59% for planes and structures labeling and mAP as 94.63%. The proposed MLL scheme provides a novel perspective for standard plane recognition and can be easily extended to other medical image classification tasks.
- 1 November 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 69 (6) , 1866-1885
To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems
In large-scale service systems, it is a common practice to organize customers with similar service requirements into a single queue served by a group of servers. This pooled queue structure is deemed highly efficient because the servers’ idleness will be minimized. In “To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems,” Cao, He, Huang, and Liu demonstrate that the dedicated queue structure, under which each server has her own queue, could be more advantageous for improving the system’s service level. Moreover, the servers’ additional idleness induced by the dedicated queue structure will be negligible when the system scale is large. By solving a staffing problem, this study also intends to help service system designers answer the following question: To achieve a specified service-level objective in a more efficient manner, should the servers have a common queue or separate queues?
- 1 November 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 69 (6) , 1866-1885
To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems
In large-scale service systems, it is a common practice to organize customers with similar service requirements into a single queue served by a group of servers. This pooled queue structure is deemed highly efficient because the servers’ idleness will be minimized. In “To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems,” Cao, He, Huang, and Liu demonstrate that the dedicated queue structure, under which each server has her own queue, could be more advantageous for improving the system’s service level. Moreover, the servers’ additional idleness induced by the dedicated queue structure will be negligible when the system scale is large. By solving a staffing problem, this study also intends to help service system designers answer the following question: To achieve a specified service-level objective in a more efficient manner, should the servers have a common queue or separate queues?
- 1 July 2020
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 68 (4) , 1265-1284
Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient
The analysis of queues with multiple servers is typically challenging when the service time distribution is general. Such analysis usually involves an infinite-dimensional process for tracking service ages or residual service times. In “Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient,” He demonstrates from a macroscopic perspective that, if customers are relatively patient and the system is overloaded, the dynamics of a many-server queue could be as simple as the dynamics of a single-server queue. In particular, the virtual waiting time process can be captured by a one-dimensional diffusion process, which enables us to obtain simple formulas for performance measures, such as service levels and effective abandonment fractions. To justify this diffusion model, a functional central limit theorem is established for the superposition of stationary renewal processes.
- 1 July 2020
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 68 (4) , 1265-1284
Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient
The analysis of queues with multiple servers is typically challenging when the service time distribution is general. Such analysis usually involves an infinite-dimensional process for tracking service ages or residual service times. In “Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient,” He demonstrates from a macroscopic perspective that, if customers are relatively patient and the system is overloaded, the dynamics of a many-server queue could be as simple as the dynamics of a single-server queue. In particular, the virtual waiting time process can be captured by a one-dimensional diffusion process, which enables us to obtain simple formulas for performance measures, such as service levels and effective abandonment fractions. To justify this diffusion model, a functional central limit theorem is established for the superposition of stationary renewal processes.
- 1 September 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 65 (9) , 4123-4140
Data-Driven Patient Scheduling in Emergency Departments: A Hybrid Robust-Stochastic Approach
Emergency care necessitates adequate and timely treatment, which has unfortunately been compromised by crowding in many emergency departments (EDs). To address this issue, we study patient scheduling in EDs so that mandatory targets imposed on each patient’s door-to-provider time and length of stay can be collectively met with the largest probability. Exploiting patient flow data from the ED, we propose a hybrid robust-stochastic approach to formulating the patient scheduling problem, which allows for practical features, such as a time-varying patient arrival process, general consultation time distributions, and multiple heterogeneous physicians. In contrast to the conventional formulation of maximizing the joint probability of target attainment, which is computationally excruciating, the hybrid approach provides a computationally amiable formulation that yields satisfactory solutions to the patient scheduling problem. This formulation enables us to develop a dynamic scheduling algorithm for making recommendations about the next patient to be seen by each available physician. In numerical experiments, the proposed hybrid approach outperforms both the sample average approximation method and an asymptotically optimal scheduling policy. This paper was accepted by Yinyu Ye, optimization.
- 1 September 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 65 (9) , 4123-4140
Data-Driven Patient Scheduling in Emergency Departments: A Hybrid Robust-Stochastic Approach
Emergency care necessitates adequate and timely treatment, which has unfortunately been compromised by crowding in many emergency departments (EDs). To address this issue, we study patient scheduling in EDs so that mandatory targets imposed on each patient’s door-to-provider time and length of stay can be collectively met with the largest probability. Exploiting patient flow data from the ED, we propose a hybrid robust-stochastic approach to formulating the patient scheduling problem, which allows for practical features, such as a time-varying patient arrival process, general consultation time distributions, and multiple heterogeneous physicians. In contrast to the conventional formulation of maximizing the joint probability of target attainment, which is computationally excruciating, the hybrid approach provides a computationally amiable formulation that yields satisfactory solutions to the patient scheduling problem. This formulation enables us to develop a dynamic scheduling algorithm for making recommendations about the next patient to be seen by each available physician. In numerical experiments, the proposed hybrid approach outperforms both the sample average approximation method and an asymptotically optimal scheduling policy. This paper was accepted by Yinyu Ye, optimization.
- 1 February 2019
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 120, 125-146
Vehicle assignment and relays for one-way electric car-sharing systems
- 1 February 2019
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 120, 125-146
Vehicle assignment and relays for one-way electric car-sharing systems
- 1 November 2017
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 42 (4) , 979-1006
Optimal Ordering Policy for Inventory Systems with Quantity-Dependent Setup Costs
We consider a continuous-review inventory system in which the setup cost of each order is a general function of the order quantity and the demand process is modeled as a Brownian motion with a positive drift. Assuming the holding and shortage cost to be a convex function of the inventory level, we obtain the optimal ordering policy that minimizes the long-run average cost by a lower bound approach. To tackle some technical issues in the lower bound approach under the quantity-dependent setup cost assumption, we establish a comparison theorem that enables one to prove the global optimality of a policy by examining a tractable subset of admissible policies. Since the smooth pasting technique does not apply to our Brownian inventory model, we also propose a selection procedure for computing optimal policy parameters when the setup cost is a step function.
- 1 November 2017
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 42 (4) , 979-1006
Optimal Ordering Policy for Inventory Systems with Quantity-Dependent Setup Costs
We consider a continuous-review inventory system in which the setup cost of each order is a general function of the order quantity and the demand process is modeled as a Brownian motion with a positive drift. Assuming the holding and shortage cost to be a convex function of the inventory level, we obtain the optimal ordering policy that minimizes the long-run average cost by a lower bound approach. To tackle some technical issues in the lower bound approach under the quantity-dependent setup cost assumption, we establish a comparison theorem that enables one to prove the global optimality of a policy by examining a tractable subset of admissible policies. Since the smooth pasting technique does not apply to our Brownian inventory model, we also propose a selection procedure for computing optimal policy parameters when the setup cost is a step function.
- Open Access
Optimal Ordering Policy for Inventory Systems with Quantity-Dependent Setup Costs
We consider a continuous-review inventory system in which the setup cost of each order is a general function of the order quantity and the demand process is modeled as a Brownian motion with a positive drift. Assuming the holding and shortage cost to be a convex function of the inventory level, we obtain the optimal ordering policy that minimizes the long-run average cost by a lower bound approach. To tackle some technical issues in the lower bound approach under the quantity-dependent setup cost assumption, we establish a comparison theorem that enables one to prove the global optimality of a policy by examining a tractable subset of admissible policies. Since the smooth pasting technique does not apply to our Brownian inventory model, we also propose a selection procedure for computing the optimal policy parameters when the setup cost is a step function.
Open AccessOptimal Ordering Policy for Inventory Systems with Quantity-Dependent Setup Costs
We consider a continuous-review inventory system in which the setup cost of each order is a general function of the order quantity and the demand process is modeled as a Brownian motion with a positive drift. Assuming the holding and shortage cost to be a convex function of the inventory level, we obtain the optimal ordering policy that minimizes the long-run average cost by a lower bound approach. To tackle some technical issues in the lower bound approach under the quantity-dependent setup cost assumption, we establish a comparison theorem that enables one to prove the global optimality of a policy by examining a tractable subset of admissible policies. Since the smooth pasting technique does not apply to our Brownian inventory model, we also propose a selection procedure for computing the optimal policy parameters when the setup cost is a step function.