| 全渠道零售场景下配送车辆路径问题 |
| 投稿时间：2019-03-17 修订日期：2019-05-14 点此下载全文 |
| 引用本文：施天娇,杨斌,朱小林.全渠道零售场景下配送车辆路径问题[J].上海海事大学学报,2020,41(2):51-57. |
| 摘要点击次数: 1601 |
| 全文下载次数: 335 |
|
|
| 基金项目:国家自然科学基金(71471109) |
|
| 中文摘要:为研究全渠道零售的配送系统对企业物流成本的影响，综合考虑时间窗、车型选择等因素，以运输成本最低为目标，建立高度协同的全渠道零售场景下的物流配送模型。该模型采用自适应遗传算法求解，利用MATLAB进行算例分析。结果显示：全渠道零售模式下的车辆调度方案能迅速响应消费者需求,与一般配送模式相比可以减少物流成本，优化车辆配置。与粒子群优化算法相比，自适应遗传算法的运行时间更短、优化结果更好，这验证了模型和算法的可行性和有效性。 |
| 中文关键词:车辆路径问题(VRP) 自适应遗传算法 全渠道零售 协同配送 多车型调度 |
| |
| Distribution vehicle routing problem in omni channel retailing |
|
|
| Abstract:In order to study the effect of the omni channel retailling distribution system on the logistics cost of enterprises, considering the factors of time window, vehicle type selection and so on, a highly coordinated logistics distribution model under the omni channel retailling is established with the objective of the minimum transportation cost. The model is solved by the adaptive genetic algorithm, and the example is analyzed by MATLAB. The results show that, the vehicle scheduling scheme under the omni channel retailing mode can quickly respond to consumer demand, and can reduce the logistics cost and optimize the vehicle configuration compared with the general distribution mode. Compared with the particle swarm optimization algorithm, the adaptive genetic algorithm is of shorter running time and better optimization results, which verifies the feasibility and effectiveness of the model and algorithm. |
| keywords:vehicle routing problem (VRP) adaptive genetic algorithm omni channel retailing joint distribution vehicle scheduling with multiple vehicle types |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| 关闭 |
