基于互联网产能共享平台的动态订单分配问题研究  

Research on Dynamic Order Allocation of Internet-based Capacity Sharing Platform

作　　者：董明[1,2] 郭书泮 DONG Ming;GUO Shupan(Data-Driven Management Decision Making Lab,Shanghai Jiao Tong University,Shanghai 200030,China;Antai College of Economics&Management,Shanghai Jiao Tong University,Shanghai 200030,China)

机构地区：[1]上海交通大学数字化管理决策教育部哲学社会科学实验室,上海200030 [2]上海交通大学安泰经济与管理学院,上海200030

出　　处：《工业工程与管理》2023年第1期199-206,共8页Industrial Engineering and Management

基　　金：国家自然科学基金重点项目(72271161,71632008)。

摘　　要：本文研究了在产能共享背景下基于互联网产能匹配平台的动态订单分配问题。在静态订单分配策略的基础上,考虑到实践中订单随机到达平台且可能出现紧急订单的情况,基于插单流程建立了以最小延期时间为目标函数的模型,并结合订单优先级思想和静态订单处理策略设计了闭环订单处理流程。对于闭环订单处理流程中出现的紧急订单,设计了自循环优化插单算法。最后通过数据仿真,验证了动态策略的优越性。The dynamic order allocation problem was studied in the context of the internet capacity sharing platform. Considering that orders arrived at the platform randomly and urgent orders might appear in real life,a dynamic strategy was proposed. Based on the insertion theory,a model was established with the minimum delay time as the objective function. A closed-loop order processing process was proposed,combining the idea of order priority and static order strategy. Aiming at the urgent orders appearing in the process,a self-circulating optimization order insertion algorithm was designed. Finally,through simulation experiments,the superiority of the dynamic strategy was verified.

关 键 词：产能共享 动态订单分配 紧急订单插单算法 

分 类 号：C935[经济管理—管理学]