Guodong Lyu

Guodong Lyu

Auto-generated profile, based on publicly available information

Guodong Lyu

School of Business and Management, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 September 2022 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
GLGuodong Lyu
Guodong Lyu
CTChung-Piaw Teo
Chung-Piaw Teo
Problem definition: The Singapore government has recently proposed the concept of “Locker Alliance” (LA), an interoperable network of public lockers in residential areas and hot spots in community, to improve the efficiency of last mile parcel delivery operations. This is to complement the existing infrastructure, composed mainly of proprietary lockers and collection points in commercial areas set up by large delivery companies. How do we determine the density and coverage of the LA network to promote adoption of locker pickup in Singapore? What will be the impact on the delivery profile in the central business district, far from the residential areas? Academic/practical relevance: We discuss the operational challenges associated with the problem of public locker installation in a city, following a new smart nation initiative in Singapore. We used data analytics to address the following questions: What are the chances that a customer will choose to pick up the parcel from a locker, over home or office deliveries, based on walking distance (to lockers) and a variety of other features? Without knowing the transit routes of the customers, how do we design the LA network to ensure that the lockers will be well utilized? Methodology: We use a set of locker usage data from a commercial courier company to calibrate a locker choice model to determine the impact of walking distance on locker pickup intentions. We use the current (observed) parcel delivery profile to develop a facility location model for the LA network. We use this model to extrapolate and approximate the true adoption and new delivery profiles when the LA network is built. Results: Contrary to conventional wisdom, our model does not always place lockers near areas with peak parcel volume (in preexisting data) because the LA lockers provide another option for customers to pick up from lockers near residential areas. Furthermore, the model suggests that a coverage of 250 meters is appropriate for the LA network in Singapore. Managerial implications: Commercial parcel locker installation has traditionally focused on hot spots in the transit routes of the citizens in the city. The LA network is the first attempt in Singapore to allow public lockers in residential areas. This paper develops an analytical method to determine network density and coverage based on a locker choice model and argues how useful insights can be gleaned from the model, despite not having the full transit route information of all citizens in the city.

1 November 2019 in Management Science
Verified
Journal Article
Closed access
GLGuodong Lyu
Guodong Lyu
WCWang-Chi Cheung
Wang-Chi Cheung
Mabel C. ChouMabel C. Chou
Mabel C. Chou
CTChung-Piaw Teo
Chung-Piaw Teo
ZZZhichao Zheng
Zhichao Zheng
YZYuanguang Zhong
Yuanguang Zhong
In many production environments, a fixed network of capacity is shared flexibly between multiple products with random demands. What is the best way to configure the capacity of the production network and to allocate the available capacity to meet predetermined fill rate requirements? We develop a new approach for network capacity configuration and allocation and characterize the relationship between the capacity of the network and the attainable fill rate levels for the products, taking into account the flexibility structure of the network. This builds on a new randomized allocation mechanism to deliver the desired services. We use this theory to investigate the connection between the flexibility structure and capacity configuration. We provide a new perspective to the well-known phenomenon that “long chain is almost as good as the fully flexible network”: for given target fill rates, the required capacity level in a long-chain network is close to that in a fully flexible network and is much lower than a dedicated system. We apply these insights and techniques on problems arising in the design of last-mile delivery operations and in semiconductor production planning, using real data from two companies. This paper was accepted by Terry Taylor, operations management.

1 September 2021 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
LSLibo Sun
Libo Sun
GLGuodong Lyu
Guodong Lyu
YYYugang Yu
Yugang Yu
CTChung Piaw Teo
Chung Piaw Teo
We provide a set of data on cross-border e-commerce sales from a fast-fashion e-retailer, Babyonlinedress, which stocks wedding gowns and full dresses from China but sells to markets overseas through multiple cross-border platforms, including Amazon, AliExpress, DHgate, etc. The data set contains normalized weekly orders on Amazon Marketplace over a three-year period, from January 1, 2015 to December 31, 2017. In total, we have collected M = 13,719 weekly orders for N = 1,166 different stock keeping units (SKUs) in the two fulfillment channels facilitated by Amazon: (i) Fulfillment by Amazon (FBA) and (ii) Fulfillment by Seller (FBS, also known as Fulfillment by Merchant). The orders for some SKUs were fulfilled entirely by seller during their life cycles on Amazon, whereas the rest were first fulfilled by seller for several months (testing period) before being transferred to FBA. This data set serves to illuminate the impact of cross-border fulfillment options on sales and bottom line of e-retailers.

1 March 2024 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
GLGuodong Lyu
Guodong Lyu
WCWang Chi Cheung
Wang Chi Cheung
CTChung-Piaw Teo
Chung-Piaw Teo
HWHai Wang
Hai Wang
Problem definition: The job of any marketplace is to facilitate the matching of supply with demand in real time. Success is often measured using various metrics. The challenge is to design matching algorithms to balance the tradeoffs among multiple objectives in a stochastic environment, to arrive at a “compromise” solution, which minimizes say the [ ]-norm–based distance function between the attained performance metrics and the target performances. Methodology/results: We observe that the sample average approximation formulation of this multiobjective stochastic optimization problem can be solved by an online algorithm that uses only gradient information from “historical” (i.e., past) sample information and not on the current state of the system. The online algorithm relies on a set of weight functions, which are updated adaptively over time, based on real-time tracking of the gaps in attained performance and the performance target. This allows us to recast the online algorithm as a randomized algorithm to solve the original stochastic problem. When the predetermined performance targets are attainable, our randomized policy achieves the targets with a near-optimal performance guarantee (measured by regret, or deviation away from the optimal performance). When the targets are not attainable, our policy generates a compromise solution to the multiobjective stochastic optimization problem, even when the efficient frontier for this stochastic optimization problem cannot be explicitly characterized a priori. We implement our model to address a challenge faced by a ride-sourcing platform that matches passengers and drivers in real time. Four performance metrics—platform revenue, driver service score, pick-up distance, and number of matched pairs—are simultaneously considered in the design of ride-matching algorithm, without prespecifying the weight on each performance metric. This mechanism has been extensively tested using synthetic and real data. Managerial implications: We show that, under appropriate conditions, all parties in the ride-sourcing ecosystem, from drivers, passengers, to the platform, can be better off under our compromise matching policy compared with other popular policies currently in use. In particular, the platform can obtain higher revenue and ensure better drivers (with higher service scores) are assigned more orders, and passengers are more likely to be matched to better drivers (albeit with a slight increase in the waiting time) compared with existing policies that focus on pick-up distance minimization. The ability to balance the conflicting goals in multiple objectives in a stochastic operating environment has the potential to contribute to the long-term sustainable growth of ride-sourcing platforms. Funding: This work was supported by the Singapore Ministry of Education AcRF Tier 3 [Grant MOE-2019-T3-1-010], the Hong Kong University of Science and Technology [Grant R9827], the Singapore Management University [Lee Kong Chian Fellowship], and the Singapore Ministry of Education AcRF Tier 2 [Grant T2EP20121-0035]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2020.0247 .

1 March 2023 in Operations Research
Verified
Journal Article
Closed access
JLJinpeng Liang
Jinpeng Liang
GLGuodong Lyu
Guodong Lyu
CTChung-Piaw Teo
Chung-Piaw Teo
ZGZiyou Gao
Ziyou Gao
Crowds management during peak commuting hours is a key challenge facing metro systems worldwide, which results in serious safety concerns and unfair public transit service for commuters on different origin-destination (o-d) pairs. In “Online Passenger Flow Control in Metro Lines,” the authors investigate the impact of online decision making on the value of passenger flow control solution methodologies. The authors formulate the problem as a stochastic dynamic program with a fairness (fill rate) constraint and exploit Blackwell's approachability theorem and Fenchel duality to characterize the attainable service level of each o-d pair. They use these insights to develop online policies that can enable more passengers boarding a train (efficiency) as well as ensure equitable service level (fairness) provided to each o-d pair. Numerical experiments on a set of transit data from Beijing show that this approach performs well compared with existing benchmarks in the literature.

21 March 2020 in Naval Research Logistics (NRL)
Verified
Journal Article
Closed access
PDF file
LSLibo Sun
Libo Sun
GLGuodong Lyu
Guodong Lyu
YYYugang Yu
Yugang Yu
CTChung‐Piaw Teo
Chung‐Piaw Teo