Matching consumers and stage-stations on community group buying platforms:An approach with hierarchy algorithms  

社区团购平台中消费者与提货站点的匹配:一种利用分层算法的方法

作　　者：Liyuan Lin 林立远(中国科学技术大学管理学院,安徽合肥230026)

机构地区：[1]School of Management,University of Science and Technology of China,Hefei 230026,China

出　　处：《中国科学技术大学学报》2024年第11期55-65,54,67,共13页JUSTC

基　　金：supported by the National Natural Science Foundation of China(71991464,71921001);Fundamental Research Funds for the Central Universities,General Program(WK2040000053);Key Program(YD2040002027)。

摘　　要：Motivated by the business model called“community group buying”(CGB),which has emerged in China and some countries in Southeast Asia,such as Singapore and Indonesia,we develop algorithms that could help CGB platforms match consumers with stage-stations(the picking up center under the CGB mode).By altering the fundamental design of the existing hierarchy algorithms,improvements are achieved.It is proven that our method has a faster running speed and greater space efficiency.Our algorithms avoid traversal and compress the time complexities of matching a consumer with a stage-station and updating the storage information to O(logM)and O(MlogG),where M is the number of stage-stations and G is that of the platform’s stock-keeping units.Simulation comparisons of our algorithms with the current methods of CGB platforms show that our approaches can effectively reduce delivery costs.An interesting observation of the simula-tions is worthy of note:Increasing G may incur higher costs since it makes inventories more dispersed and delivery prob-lems more complicated.近年来,一种名为“社区团购”的商业模式在新加坡、印度尼西亚等东南亚国家和中国出现并高速发展。本文以已有的分层算法为基础,通过修改其基础设计结构,开发出了能够帮助社区团购平台匹配消费者和提货站点的算法,并且证明了该算法相较已有的分层算法有着更高的运算效率和计算机内存利用率。我们的算法避免了穷举和遍历,把匹配一个消费者和一个提货站点,以及更新货物存储信息的时间复杂度分别压缩到了O(logM)与O(MlogG),其中M是提货站点的总数,G是储存货物的仓库总数(在社区团购中被称为“网格仓”)。对比本文匹配算法和目前社区团购平台常用的匹配方法,数值模拟结果显示,发现本文算法可以有效地降低平台运输货物的成本。数值模拟中一个值得注意的有趣结果是:在平台货物总量保持不变的情况下,提高网格仓总数(G)有可能会导致运输成本增加。

关 键 词：spatial matching dynamic arrival platform business community group buying hierarchy algorithm 

分 类 号：F724.6[经济管理—产业经济] F252