Revenue optimisation approach for auction logistics centre: an investigation of Chinese flower market

被引:2
|
作者
Kong, Xiang T. R. [1 ]
Wang, Xuejiao [1 ]
Fu, Yelin [2 ]
Luo, Hao [1 ]
机构
[1] Shenzhen Univ, Coll Econ, Collaborat Res Ctr Supply Chain Innovat, Dept Transportat Econ & Logist Management, Shenzhen, Peoples R China
[2] Jinan Univ, Sch Intelligent Syst Sci & Engn, Zhuhai Campus, Zhuhai, Peoples R China
基金
中国国家自然科学基金;
关键词
Auction logistics; revenue management; demand forecasting; robust control; SELF-STORAGE WAREHOUSES; ON-DEMAND LOGISTICS; ROBUST OPTIMIZATION; THROUGHPUT; MECHANISM;
D O I
10.1080/13675567.2022.2057937
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This research is motivated by China's second largest flower auction market. Its existing auction logistics plan is to group the auction trolleys in a fixed order of 'same category and same grade'. The auction logistics centre cannot respond to demand fluctuations by dynamically optimising the order of participation, resulting in overall trading revenue decline. This paper proposes an integrated decision-making framework based on the theory of revenue optimisation. Through effective demand forecasting, the demand curves of different types of auction lots in multi-period are obtained. In the face of the reserved order of a limited auction trolley, order acceptance strategy is adopted to flexibly allocate auction trolleys, with the goal of revenue maximisation. Considering the impact of demand uncertainty and forecast errors on system performance, a robust control is employed. Through designing a genetic-variable neighbourhood algorithm, the solving of this large-scale practical problem can be controlled within acceptable computation time. Numerical experiments verify that the proposed approaches are superior to the traditional first-come-first-served rule. Sensitivity analyses provide significant implications for the scientific decision-making of managers, including the allocation ratio of group orders to individual orders, discounts on entry fees for group orders, and the division of auction time periods.
引用
收藏
页码:1359 / 1383
页数:25
相关论文
empty
未找到相关数据