Huan Zheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Huan Zheng has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Chung-Piaw Teo
National University of Singapore
3 shared publications - Ying Rong
The Chinese University of Hong Kong Shanghai Jiao Tong University Shanghai Jiao Tong University The Chinese University of Hong Kong
3 shared publications Liu Ming
School of Management and Economics The Chinese University of Hong Kong Shenzhen China
2 shared publications- Mabel C. Chou
National University of Singapore
2 shared publications Wenzheng Mao
Advanced Institute of Business, School of Economics and Management Tongji University Shanghai China
2 shared publications- Yating Zhang
Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, China
2 shared publications
Latest Publications
- 1 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (5) , 2672-2693
Assortment Optimization Under History-Dependent Effects
Curing Consumer Fatigue: A Data-Driven Approach to Dynamic Assortment Have you ever grown tired of seeing the same lunch options at your corporate cafeteria every day? This phenomenon, known as customer satiation, poses a major challenge for businesses serving repeat customers, such as dining services and online flash-sale platforms. When customer utility depends on historical offerings, traditional assortment planning methods often fail, sacrificing either overall revenue or product variety. In the paper “Assortment Optimization Under History-Dependent Effects,” the authors develop a new optimization framework to capture how past assortments influence future customer preferences. By reformulating this challenging nonlinear problem into tractable mixed-integer programs, they derive optimal assortment policies over time. Using real-world corporate cafeteria data, the study demonstrates revenue improvements of up to 10.4% over static assortment policies while maintaining product variety and reducing customer fatigue.
- 1 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (5) , 2672-2693
Assortment Optimization Under History-Dependent Effects
Curing Consumer Fatigue: A Data-Driven Approach to Dynamic Assortment Have you ever grown tired of seeing the same lunch options at your corporate cafeteria every day? This phenomenon, known as customer satiation, poses a major challenge for businesses serving repeat customers, such as dining services and online flash-sale platforms. When customer utility depends on historical offerings, traditional assortment planning methods often fail, sacrificing either overall revenue or product variety. In the paper “Assortment Optimization Under History-Dependent Effects,” the authors develop a new optimization framework to capture how past assortments influence future customer preferences. By reformulating this challenging nonlinear problem into tractable mixed-integer programs, they derive optimal assortment policies over time. Using real-world corporate cafeteria data, the study demonstrates revenue improvements of up to 10.4% over static assortment policies while maintaining product variety and reducing customer fatigue.
- Open Access
- 1 June 2025
- Published by KEAI Publishing in Fundamental Research
- Vol. 6 (4) , 2612-2620
Data-driven and people-centric operations: Research opportunities in retail operations
- 1 June 2025
- Published by KEAI Publishing in Fundamental Research
- Vol. 6 (4) , 2612-2620
Open AccessData-driven and people-centric operations: Research opportunities in retail operations
- Top Cited Papers
- 20 February 2025
- Published by Wiley in Journal of Operations Management
- Vol. 71 (2) , 220-245
Faster Deliveries and Smarter Order Assignments for an On‐Demand Meal Delivery Platform
The rapid growth of on‐demand meal delivery platforms has heightened competition, making customer retention a critical priority. While prior research on order dispatch algorithms has largely focused on minimizing delivery time or delay, the direct impact of delivery performance on repeat purchases remains underexplored. Using transactional data from an online meal delivery platform in China, we empirically investigate the asymmetric effects of early and late deliveries on customer repurchasing behavior. To address potential endogeneity, we introduce driver experience and local knowledge, two previously overlooked factors in platform algorithms, as novel instrumental variables. The survival analysis shows that late deliveries significantly reduce future orders, while early deliveries provide only limited benefits. Guided by these empirical insights, we develop a simulation‐based evaluation of different order dispatch algorithms, revealing that maximizing future orders, rather than minimizing delivery time or delays, yields the highest future orders. These insights offer actionable recommendations for platform managers, stressing the importance of strategic adjustments in dispatch algorithms and integrating heterogeneous treatment effects into algorithmic design. By merging operational delivery performance with consumer behavior insights through causal inference and optimization, this study provides a novel end‐to‐end framework for creating data‐driven dispatch algorithms that enhance both service efficiency and customer retention.
- 20 February 2025
- Published by Wiley in Journal of Operations Management
- Vol. 71 (2) , 220-245
Top Cited PapersFaster Deliveries and Smarter Order Assignments for an On‐Demand Meal Delivery Platform
The rapid growth of on‐demand meal delivery platforms has heightened competition, making customer retention a critical priority. While prior research on order dispatch algorithms has largely focused on minimizing delivery time or delay, the direct impact of delivery performance on repeat purchases remains underexplored. Using transactional data from an online meal delivery platform in China, we empirically investigate the asymmetric effects of early and late deliveries on customer repurchasing behavior. To address potential endogeneity, we introduce driver experience and local knowledge, two previously overlooked factors in platform algorithms, as novel instrumental variables. The survival analysis shows that late deliveries significantly reduce future orders, while early deliveries provide only limited benefits. Guided by these empirical insights, we develop a simulation‐based evaluation of different order dispatch algorithms, revealing that maximizing future orders, rather than minimizing delivery time or delays, yields the highest future orders. These insights offer actionable recommendations for platform managers, stressing the importance of strategic adjustments in dispatch algorithms and integrating heterogeneous treatment effects into algorithmic design. By merging operational delivery performance with consumer behavior insights through causal inference and optimization, this study provides a novel end‐to‐end framework for creating data‐driven dispatch algorithms that enhance both service efficiency and customer retention.
- 24 April 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 71 (1)
Online Advertisement Allocation Under Customer Choices and Algorithmic Fairness
Advertising is a crucial revenue source for e-commerce platforms and a vital online marketing tool for their sellers. In this paper, we explore dynamic ad allocation with limited slots upon each customer’s arrival for an e-commerce platform, where customers follow a choice model when clicking the ads. Motivated by the recent advocacy for the algorithmic fairness of online ad delivery, we adjust the value from advertising by a general fairness metric evaluated with the click-throughs of different ads and customer types. The original online ad-allocation problem is intractable, so we propose a novel stochastic program framework (called two-stage target-debt) that first decides the click-through targets and then devises an ad-allocation policy to satisfy these targets in the second stage. We show the asymptotic equivalence between the original problem, the relaxed click-through target optimization, and the fluid-approximation ( Fluid ) convex program. We also design a debt-weighted offer-set algorithm and demonstrate that, as long as the problem size scales to infinity, this algorithm is (asymptotically) optimal under the optimal first-stage click-through target. Compared with the Fluid heuristic and its resolving variants, our approach has better scalability and can deplete the ad budgets more smoothly throughout the horizon, which is highly desirable for the online advertising business in practice. Finally, our proposed model and algorithm help substantially improve the fairness of ad allocation for an online e-commerce platform without significantly compromising efficiency. This paper was accepted by Jeannette Song, operations management. Funding: Y. Rong is supported by the National Natural Science Foundation of China [Grants 72025201, 72331006, and 72221001]. R. Zhang is grateful for the financial support from the Hong Kong Research Grants Council General Research Fund [Grants 14502722 and 14504123] and the National Natural Science Foundation of China [Grants 72293560 and 72293565]. H. Zheng is supported by the National Natural Science Foundation of China [Grants 72231003, 72325003, and 72221001]. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2021.04091 .
- 24 April 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 71 (1)
Online Advertisement Allocation Under Customer Choices and Algorithmic Fairness
Advertising is a crucial revenue source for e-commerce platforms and a vital online marketing tool for their sellers. In this paper, we explore dynamic ad allocation with limited slots upon each customer’s arrival for an e-commerce platform, where customers follow a choice model when clicking the ads. Motivated by the recent advocacy for the algorithmic fairness of online ad delivery, we adjust the value from advertising by a general fairness metric evaluated with the click-throughs of different ads and customer types. The original online ad-allocation problem is intractable, so we propose a novel stochastic program framework (called two-stage target-debt) that first decides the click-through targets and then devises an ad-allocation policy to satisfy these targets in the second stage. We show the asymptotic equivalence between the original problem, the relaxed click-through target optimization, and the fluid-approximation ( Fluid ) convex program. We also design a debt-weighted offer-set algorithm and demonstrate that, as long as the problem size scales to infinity, this algorithm is (asymptotically) optimal under the optimal first-stage click-through target. Compared with the Fluid heuristic and its resolving variants, our approach has better scalability and can deplete the ad budgets more smoothly throughout the horizon, which is highly desirable for the online advertising business in practice. Finally, our proposed model and algorithm help substantially improve the fairness of ad allocation for an online e-commerce platform without significantly compromising efficiency. This paper was accepted by Jeannette Song, operations management. Funding: Y. Rong is supported by the National Natural Science Foundation of China [Grants 72025201, 72331006, and 72221001]. R. Zhang is grateful for the financial support from the Hong Kong Research Grants Council General Research Fund [Grants 14502722 and 14504123] and the National Natural Science Foundation of China [Grants 72293560 and 72293565]. H. Zheng is supported by the National Natural Science Foundation of China [Grants 72231003, 72325003, and 72221001]. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2021.04091 .
- 1 June 2023
- Published by SAGE Publications in Production and Operations Management
- Vol. 32 (6) , 1778-1792
On fairness and efficiency in nonprofit operations: Dynamic resource allocations
We study a sequential resource allocation problem balancing fairness and efficiency for nonprofit operations. (Un)fairness is measured by the expected maximum demand shortfall among all communities, and (in)efficiency is measured by the expected remaining resources after allocation. We characterize the optimal allocation policy as a two‐threshold policy in which the optimal allocation quantities are spoon‐shaped in terms of the current maximum demand shortfall. We further show that the thresholds and optimal allocation quantity for each community are nondecreasing in resource levels, realized demand from the current community, and weight of the efficiency objective. Based on these results, we propose a simple heuristic policy and numerically show that it performs well and generates fair allocations in a stochastic majorization order. The numerical results show that adding a small weight to the fairness objective significantly improves the system's fairness at a small efficiency cost. Moreover, the optimal initial capacity level is increasing (decreasing) in demand variance if the efficiency weight is small (large). Our theoretical analysis can be extended to the fill rate–based fairness metric.
- 1 June 2023
- Published by SAGE Publications in Production and Operations Management
- Vol. 32 (6) , 1778-1792
On fairness and efficiency in nonprofit operations: Dynamic resource allocations
We study a sequential resource allocation problem balancing fairness and efficiency for nonprofit operations. (Un)fairness is measured by the expected maximum demand shortfall among all communities, and (in)efficiency is measured by the expected remaining resources after allocation. We characterize the optimal allocation policy as a two‐threshold policy in which the optimal allocation quantities are spoon‐shaped in terms of the current maximum demand shortfall. We further show that the thresholds and optimal allocation quantity for each community are nondecreasing in resource levels, realized demand from the current community, and weight of the efficiency objective. Based on these results, we propose a simple heuristic policy and numerically show that it performs well and generates fair allocations in a stochastic majorization order. The numerical results show that adding a small weight to the fairness objective significantly improves the system's fairness at a small efficiency cost. Moreover, the optimal initial capacity level is increasing (decreasing) in demand variance if the efficiency weight is small (large). Our theoretical analysis can be extended to the fill rate–based fairness metric.
- 1 November 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 24 (6) , 2901-2924
From Targeting to Transfer: Design of Allocation Rules in Cash Transfer Programs
Problem definition: Cash transfer programs (CTPs) have spread in the last decade to help fight extreme poverty in different parts of the world. A key issue here is to ensure that the cash is distributed to the targeted beneficiaries in an appropriate manner to meet the goals of the programs. How do we design efficient and egalitarian allocation rules for these programs? Academic/practical relevance: Big data and machine learning have been used recently by several CTPs to target the right beneficiaries (those living in extreme poverty). We demonstrate how these targeting methods can be integrated into the cash allocation problem to synthesize the impact of targeting errors on the design of the allocation rules. In particular, when the targeting errors are “well calibrated,” a simple predictive allocation rule is already optimal. Finally, although we only focus on the problem of poverty reduction (efficiency), the optimality conditions ensure that these allocation rules provide a common ex ante service guarantee for each beneficiary in the allocation outcome (egalitarian). Methodology: We design allocation rules to minimize a key indicator in poverty reduction—the squared gap of the shortfall between the income/consumption and the poverty line. The rules differ in how the targeting error distribution is being utilized. Robust and online convex optimization are applied for the analysis. We also modify our allocation rules to ensure that the cash is spread more evenly across the pool of beneficiaries to reduce the (potential) negative effect on nonbeneficiary households living close to the poverty line but missing the benefits of the CTPs because of imperfect targeting. Results: Given a targeting method, we compare and contrast the performance of different allocation rules—predictive, stochastic, and robust. We derive closed-form solutions to predictive and stochastic allocation models and use robust allocation to mitigate the negative impact of imperfect targeting. Moreover, we show that the robust allocation decision can be efficiently computed using online convex optimization. Managerial implications: Using real data from a CTP in Malawi, we demonstrate how a suitable choice of allocation rule can improve both the efficiency and egalitarian objectives of the CTP. The technique can be suitably modified to ensure that the wealth distribution after allocation is “smoother,” reducing the bunching effect that may be undesirable in some circumstances. History: This paper has been accepted for the Manufacturing & Service Operations Management Special Section on Responsible Research in Operations Management. Funding: H. Zheng is supported by the National Natural Science Foundation of China [Grant 71871139]. G. Lyu and C.-P. Teo are supported by the 2019 Academic Research Fund Tier 3, the Ministry of Education, Singapore [Grant MOE-2019-T3-1-010]. J. Ke is supported by the National Natural Science Foundation of China [Grant 72101191]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.1101 .
- 1 November 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 24 (6) , 2901-2924
From Targeting to Transfer: Design of Allocation Rules in Cash Transfer Programs
Problem definition: Cash transfer programs (CTPs) have spread in the last decade to help fight extreme poverty in different parts of the world. A key issue here is to ensure that the cash is distributed to the targeted beneficiaries in an appropriate manner to meet the goals of the programs. How do we design efficient and egalitarian allocation rules for these programs? Academic/practical relevance: Big data and machine learning have been used recently by several CTPs to target the right beneficiaries (those living in extreme poverty). We demonstrate how these targeting methods can be integrated into the cash allocation problem to synthesize the impact of targeting errors on the design of the allocation rules. In particular, when the targeting errors are “well calibrated,” a simple predictive allocation rule is already optimal. Finally, although we only focus on the problem of poverty reduction (efficiency), the optimality conditions ensure that these allocation rules provide a common ex ante service guarantee for each beneficiary in the allocation outcome (egalitarian). Methodology: We design allocation rules to minimize a key indicator in poverty reduction—the squared gap of the shortfall between the income/consumption and the poverty line. The rules differ in how the targeting error distribution is being utilized. Robust and online convex optimization are applied for the analysis. We also modify our allocation rules to ensure that the cash is spread more evenly across the pool of beneficiaries to reduce the (potential) negative effect on nonbeneficiary households living close to the poverty line but missing the benefits of the CTPs because of imperfect targeting. Results: Given a targeting method, we compare and contrast the performance of different allocation rules—predictive, stochastic, and robust. We derive closed-form solutions to predictive and stochastic allocation models and use robust allocation to mitigate the negative impact of imperfect targeting. Moreover, we show that the robust allocation decision can be efficiently computed using online convex optimization. Managerial implications: Using real data from a CTP in Malawi, we demonstrate how a suitable choice of allocation rule can improve both the efficiency and egalitarian objectives of the CTP. The technique can be suitably modified to ensure that the wealth distribution after allocation is “smoother,” reducing the bunching effect that may be undesirable in some circumstances. History: This paper has been accepted for the Manufacturing & Service Operations Management Special Section on Responsible Research in Operations Management. Funding: H. Zheng is supported by the National Natural Science Foundation of China [Grant 71871139]. G. Lyu and C.-P. Teo are supported by the 2019 Academic Research Fund Tier 3, the Ministry of Education, Singapore [Grant MOE-2019-T3-1-010]. J. Ke is supported by the National Natural Science Foundation of China [Grant 72101191]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.1101 .
- 1 September 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 24 (5) , 2535-2542
On-Demand Meal Delivery Platforms: Operational Level Data and Research Opportunities
This paper describes the operations of most on-demand meal delivery platforms and discusses how empirical research can improve the operational performance of these platforms. To support and encourage more studies on the operations of on-demand delivery platforms, we provide a unique data set obtained from a meal delivery platform in China. This data set contains operational level data sampled from July 1 to August 31, 2015, in Hangzhou, China. The data set includes information about order placements, order deliveries, restaurants, drivers, weather and traffic conditions, and so on. We also review recent studies on meal delivery platforms and suggest research opportunities for improving delivery performance.
- 1 September 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 24 (5) , 2535-2542
On-Demand Meal Delivery Platforms: Operational Level Data and Research Opportunities
This paper describes the operations of most on-demand meal delivery platforms and discusses how empirical research can improve the operational performance of these platforms. To support and encourage more studies on the operations of on-demand delivery platforms, we provide a unique data set obtained from a meal delivery platform in China. This data set contains operational level data sampled from July 1 to August 31, 2015, in Hangzhou, China. The data set includes information about order placements, order deliveries, restaurants, drivers, weather and traffic conditions, and so on. We also review recent studies on meal delivery platforms and suggest research opportunities for improving delivery performance.
- 1 May 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 70 (3) , 1410-1427
The Strategic Benefit of Request for Proposal/Quotation
The Design of the Procurement Process
- 1 May 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 70 (3) , 1410-1427
The Strategic Benefit of Request for Proposal/Quotation
The Design of the Procurement Process
- 10 January 2020
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 67 (8) , 646-669
Impacts of logistics information on sales: Evidence from Alibaba
Facing fierce competition from rivals, sellers in online marketplaces are eager to improve their sales by delivering items faster and more reliably. Because logistics quality can be known only after a transaction, sellers must identify effective ways to communicate logistics information to consumers. Drawing on the accessibility‐diagnosticity framework, we theorize that the sales impacts of logistics information depend on its relative diagnostic value. Using data on 1493 items with 505,785 consumer reviews from an online marketplace, we examine how sales are affected by three information sources for logistics services: online word of mouth (WOM) about logistics, self‐reported logistics services, and expected delivery time. We use an instrumental variable method to address the endogeneity issue between sales and WOM. We find that, ceteris paribus, consumers give more weight to WOM about logistics and delivery time when they make purchase decisions but less weight to self‐reported logistics service. The effects of logistics information on sales are asymmetric for large and small sellers.
- 10 January 2020
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 67 (8) , 646-669
Impacts of logistics information on sales: Evidence from Alibaba
Facing fierce competition from rivals, sellers in online marketplaces are eager to improve their sales by delivering items faster and more reliably. Because logistics quality can be known only after a transaction, sellers must identify effective ways to communicate logistics information to consumers. Drawing on the accessibility‐diagnosticity framework, we theorize that the sales impacts of logistics information depend on its relative diagnostic value. Using data on 1493 items with 505,785 consumer reviews from an online marketplace, we examine how sales are affected by three information sources for logistics services: online word of mouth (WOM) about logistics, self‐reported logistics services, and expected delivery time. We use an instrumental variable method to address the endogeneity issue between sales and WOM. We find that, ceteris paribus, consumers give more weight to WOM about logistics and delivery time when they make purchase decisions but less weight to self‐reported logistics service. The effects of logistics information on sales are asymmetric for large and small sellers.
- 10 July 2019
- Published by SAGE Publications in Production and Operations Management
- Vol. 28 (11) , 2719-2737
An Approximate Dynamic Programming Approach to Dynamic Pricing for Network Revenue Management
Much of the network revenue management (NRM) literature considers capacity control problems where product prices are fixed and the product availability is controlled over time. However, for industries with imperfect competition, firms typically retain some pricing power and dynamic pricing models are more realistic than capacity control models. Dynamic pricing problems are more challenging to solve; even the deterministic version is typically nonlinear. In this study, we consider a dynamic programming model and use approximate linear programs (ALPs) to solve the problem. Unlike capacity control problems, the ALPs are semi‐infinite linear programs, for which we propose a column generation algorithm. Furthermore, for the affine approximation under a linear independent demand model, we show that the ALPs can be reformulated as compact second order cone programs (SOCPs). The size of the SOCP formulation is linear in model primitives, including the number of resources, the number of products, and the number of periods. In addition, we consider a version of the model with discrete price sets and show that the resulting ALPs admit compact reformulations. We report numerical results on computational and policy performance on a set of hub‐and‐spoke problem instances.
- 10 July 2019
- Published by SAGE Publications in Production and Operations Management
- Vol. 28 (11) , 2719-2737
An Approximate Dynamic Programming Approach to Dynamic Pricing for Network Revenue Management
Much of the network revenue management (NRM) literature considers capacity control problems where product prices are fixed and the product availability is controlled over time. However, for industries with imperfect competition, firms typically retain some pricing power and dynamic pricing models are more realistic than capacity control models. Dynamic pricing problems are more challenging to solve; even the deterministic version is typically nonlinear. In this study, we consider a dynamic programming model and use approximate linear programs (ALPs) to solve the problem. Unlike capacity control problems, the ALPs are semi‐infinite linear programs, for which we propose a column generation algorithm. Furthermore, for the affine approximation under a linear independent demand model, we show that the ALPs can be reformulated as compact second order cone programs (SOCPs). The size of the SOCP formulation is linear in model primitives, including the number of resources, the number of products, and the number of periods. In addition, we consider a version of the model with discrete price sets and show that the resulting ALPs admit compact reformulations. We report numerical results on computational and policy performance on a set of hub‐and‐spoke problem instances.