主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2019, Vol. 27 ›› Issue (6): 41-52.doi: 10.16381/j.cnki.issn1003-207x.2019.06.005

• 论文 • 上一篇    下一篇

数据驱动下收货方质量偏好与电商配送服务质量优化

孙琦1,2, 戢守峰1, 董明2   

  1. 1. 东北大学工商管理学院, 辽宁 沈阳 110169;
    2. 上海交通大学安泰经济与管理学院, 上海 200030
  • 收稿日期:2017-03-01 修回日期:2017-09-15 出版日期:2019-06-20 发布日期:2019-07-01
  • 通讯作者: 孙琦(1986-),女(汉族),江苏淮安人,上海交通大学安泰经济与管理学院,博士后,研究方向:物流系统建模与优化、物流与供应链管理,E-mail:sunqi19860726@foxmail.com. E-mail:sunqi19860726@foxmail.com
  • 基金资助:
    国家自然科学基金资助项目(71632008,71572031,70872019);辽宁省哲学社会科学规划基金资助项目(L16AZY032)

Optimization of Distribution Service Quality with Constraints of Quality Preference for Data-driven Model

SUN Qi1,2, JI Shou-feng1, DONG Ming2   

  1. 1. School of Business Administration, Northeastern University, Shenyang 110169, China;
    2. Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200030, China
  • Received:2017-03-01 Revised:2017-09-15 Online:2019-06-20 Published:2019-07-01

摘要: 针对"互联网+大数据"优化电商配送服务质量问题,明确不同收货方的质量需求稳定性,引导电商根据收货方不同质量敏感性提供相对精准服务,提升配送服务质量。模拟投票结果的形成过程聚类得到收货方对服务质量偏好的记忆性特征:(1)"无记忆"型收货方;(2)"记忆"型收货方;(3)"不确定"型收货方;(4)收货方总体。进一步推导不同规划类型求解空间,设计得到"无记忆"型收货方动态规划精确求解方法,及其他三种类型近似求解粒子群算法。研究过程中,配送资源质量感知度被嵌入到模型约束;"无记忆"型收货方的质量需求规划问题转化为零库存策略最优解问题,进而证明存在精确解;"记忆"型收货方呈现出对质量感知的累积;"不确定"型收货方模型通过赋值即可得总体收货方表达式。结果表明:数据驱动研究框架借助大数据资源,使得电商更易通过收货方的质量偏好设计更加匹配的配送方案;不确定服务需求得到有效满足,投入成本的利用率更高;通过特征分类的方式,尽可能地抽取能够精确最优化的部分,缩小NP范围,提高整体求解的精确度。

关键词: 质量敏感聚类, 质量偏好约束, 配送服务质量优化, 数据驱动

Abstract: The purpose of this paper is to take advantage of "Internet plus" and big data resources for logistics optimization problem. The data value of e-commerce platform accumulated over the years needs to be further explored to promote e-business decision makers to provide meticulous service according to the different quality of the recipients. The degree of service quality preference of the receiving party is summarized:(1) "no memory" type of receiving party; (2) "memory" type of receiving party; (3) "uncertain" type of receiving party (4) the whole receiving party. In addition, four types of programming solution space are deduced, and then the cost linear function of "no memory" type has an accurate solution for dynamic planning, and the other three types are designed to approximate the particle swarm optimization algorithm. The detailed research idea of dissertation is as following:the perceived quality is embedded into model constraints and used to describe the memory attribute of the data; the problem of distribution resource planning with "no memory" is equivalent to the optimal solution of zero inventory strategy, which is indirectly proved existence of accurate solution by the transformation; "memory" type of receiving party for k times delivery service, there is tolerance for the quality of the delivery service for each purchase, which the total amount of weight accumulation per time does not exceed a limit ensuring this type consumer's loyalty; the overall model of the consignee is a special case of the model of the "uncertain" type of receiving party. The recipient's historical data are clustered by simulation of the results of the formation process to form data memory characteristics and analyzed to obtain the quality requirements of different receiving parties. The e-commercial enterprises are guided to provide the relative precision service according to the different quality sensitivities of the receiving party to enhance the last-kilometers distribution service quality, so as to optimize the quality of the delivery service quality of the decision. The sources of case study come from the fresh supermarkets in the city of Shenyang in China, for cooperating to construct a convenient fresh O2O platform. The experimental data is collected from January 31st, 2014 to January 31st, 2016, with the 10 stores of the company as the receiving party sets containing 35 groups of consignee attributes and 8200 historical data, which are used to verify the performance of the model. One the one hand, by virtue of data-driven research framework, it is easier for operators to provide a relatively accurate delivery service through big data resources from the consignee's quality preferences. Since the uncertain demands for service are satisfied effectively, the utilization rate of quality input costs is higher. One the other hand, an optimization idea is provided to deal with the NP-hard problem by extracting the parts that can be precisely optimized, reducing the NP range and improving the accuracy of the overall solution by the method of feature classification.

Key words: quality sensitive clustering, constraints of quality preference, distribution service quality optimization, data-driven

中图分类号: