考虑双重满意度的外卖配送路径优化
Takeaway Delivery Route Optimization Considering Double Satisfaction
魏子秋 1李孟晓1
作者信息
- 1. 河北科技大学 经济管理学院,河北 石家庄 050018
- 折叠
摘要
文中主要研究外卖配送路径优化问题,针对外卖配送过程中存在的成本高、配送延误等一系列问题,考虑配送车辆容量、配送里程和时间窗等约束条件,将顾客满意度最大化、员工满意度最大化以及配送成本最小化作为目标,建立了配送过程中车辆路径问题(VRP)模型.经过算例验证,发现通过遗传算法找到的路径能够有效地降低成本,提高顾客和员工的满意度,使配送时间更有保障,验证了算法的可行性和有效性.
Abstract
The main focus of this article is on the optimization of takeway delivery routes.In response to a series of issues such as high costs and delivery delays in the delivery process,a vehicle routing problem(VRP)model was established by considering constraints such as delivery vehicle capacity,delivery mileage,and time windows,with the goal of maximizing customer satisfaction and employee satisfaction,and minimizing delivery costs.Through example verification,it was found that the path found through genetic algorithm can effectively reduce costs,improve customer and employee satisfaction,and ensure delivery time more effectively,verifying the feasibility and effectiveness of the algorithm.
关键词
外卖/配送路径优化/遗传算法/员工满意度Key words
takeaway/delivery route optimization/genetic algorithm/employee satisfaction引用本文复制引用
出版年
2024
NETL
NSTL
维普
万方数据