Yugang Yu

Dr. Yugang Yu


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
1 July 2023 in Marketing Science
Verified
Journal Article
Closed access
YZYong Zha
Yong Zha
QLQuan Li
Quan Li
THTingliang Huang
Tingliang Huang
YYYugang Yu
Yugang Yu
We study an online platform’s demand information sharing strategy in a distribution channel where a manufacturer distributes products through both platform and seller channels.

1 August 2015 in Production and Operations Management
Verified
Journal Article
Closed access
PDF file
YYYugang Yu
Yugang Yu
RDRené B.M. Dekoster
René B.M. Dekoster
XGXiaolong Guo
Xiaolong Guo

1 November 2022 in Production and Operations Management
Verified
Journal Article
Closed access
XGXiaolong Guo
Xiaolong Guo
LCLihong Cheng
Lihong Cheng
YYYugang Yu
Yugang Yu

1 August 2015 in Production and Operations Management
Verified
Journal Article
Closed access
PDF file
NZNima Zaerpour
Nima Zaerpour
YYYugang Yu
Yugang Yu
RDRené B.M. Dekoster
René B.M. Dekoster

31 October 2013 in International Journal of Production Research
Verified
Journal Article
Closed access
AGAmir Gharehgozli
Amir Gharehgozli
YYYugang Yu
Yugang Yu
RKRené de Koster
René de Koster
JUJan Tijmen Udding
Jan Tijmen Udding
Reshuffling containers, one of the daily operations at a container terminal, is time consuming and increases a ship’s berthing time. We propose a decision-tree heuristic to minimise the expected number of reshuffles when arriving containers should be stacked in a block of containers with an arbitrary number of piles. The heuristic algorithm uses the optimal solutions of a stochastic dynamic programming model. Since the total number of states of the dynamic programming model increases exponentially, the model can only solve small-scale problems in a reasonable time. To solve large-scale problems, the heuristic uses the results of the exact model for small-scale problems to generate generalised decision trees. These trees can be used to solve problems with a realistic number of piles. The numerical experiments show the effectiveness of the algorithm. For small-scale problems, the trees can quickly make optimal decisions. For large-scale problems, the decision-tree heuristic significantly outperforms stacking policies commonly used in practice. Using the decision trees, we can compare the performance of a shared-stacking policy, which allows containers of multiple ships to be stacked on top of each other, with a dedicated-stacking policy. Shared-stacking appears to outperform dedicated-stacking.

24 February 2024 in Transportation Research Part B: Methodological
Verified
Journal Article
Closed access
YYYunqiang Yin
Yunqiang Yin
XXXinrui Xu
Xinrui Xu
DWDujuan Wang
Dujuan Wang
YYYugang Yu
Yugang Yu
T.C. Edwin ChengT.C. Edwin Cheng
T.C. Edwin Cheng