This study proposes a cooperative rich vehicle routing problem (CoRVRP) among three typical logistics providers in the last-mile logistics industry in rural areas. The problem is formulated based on the information fusion system and the ordering interface system, and it is solved by a proposed branch-price-and-cut algorithm. Based on the optimized cooperation scheme, the core and Shapley value are used to fairly allocate the cost savings. The numerical results show that a long-term grand coalition will be beneficial to all the participators. The proposed information-merging-and-algorithm-driven cooperative optimization model will be practicable for intelligent logistics systems.

这项研究提出了农村地区最后一英里物流行业中三个典型的物流提供商之间的合作式富车辆路径问题（CoRVRP）。该问题是基于信息融合系统和订购接口系统提出的，并通过提出的分支价格削减算法来解决。在优化的合作方案的基础上，核心价值和Shapley价值被用来公平地分配成本节省。数值结果表明，一个长期的大联盟将对所有参与者有利。所提出的信息融合与算法驱动的协同优化模型对于智能物流系统是可行的。