考虑顾客满意度的社区团购配送路径优化  

Optimization of Community Group Purchase Scheduling Path Considering Customer Satisfaction

作　　者：汪勇[1] 邱伟 WANG Yong;QIU Wei(Evergrande School of Management,Wuhan University of Science and Technology,Wuhan 430065,China)

机构地区：[1]武汉科技大学恒大管理学院,湖北武汉430065

出　　处：《物流工程与管理》2021年第6期38-41,共4页Logistics Engineering and Management

摘　　要：针对社区团购企业在物流调度中存在效率低、成本高、顾客满意度低等问题,文中建立了在调度时间窗满意度函数的约束下包含固定成本、运输成本和惩罚成本的总成本最小的VRP模型。设计遗传算法对模型进行求解,通过算例验证,文中设计的总成本函数能够有效地降低成本,获得了良好的满意度,算法具有可行性和有效性,为社区团购企业物流调度决策提供了参考。Aiming at the problems of low efficiency,high cost and low customer satisfaction in the logistics scheduling of community group-buying enterprises,this paper establishes a VRP model with the minimum total cost of fixed cost,transportation cost and penalty cost under the constraint of the satisfaction function of scheduling time windows.The design genetic algorithm is used to solve the model.Through example verification,the total cost function designed in this paper can effectively reduce the cost and obtain good satisfaction.The algorithm is feasible and effective,which provides a reference for community group purchase enterprises to make logistics scheduling decisions.

关 键 词：社区团购 车辆路径问题(VRP) 遗传算法 满意度 

分 类 号：F252[经济管理—国民经济]