当前位置: X-MOL 学术Journal of Transport and Supply Chain Management › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Capacitated vehicle routing problem model for carriers
Journal of Transport and Supply Chain Management Pub Date : 2018-07-02 , DOI: 10.4102/jtscm.v12i0.345
Irma-Delia Rojas-Cuevas , Santiago-Omar Caballero-Morales , Jose-Luis Martinez-Flores , Jose-Rafael Mendoza-Vazquez

Background: The Capacitated Vehicle Routing Problem (CVRP) is one of the most important transportation problems in logistics and supply chain management. The standard CVRP considers a fleet of vehicles with homogeneous capacity that depart from a warehouse, collect products from (or deliver products to) a set of customer locations (points) and return to the same warehouse. However, the operation of carrier companies and third-party transportation providers may follow a different network flow for collection and delivery. This may lead to non-optimal route planning through the use of the standard CVRP. Objective: To propose a model for carrier companies to obtain optimal route planning. Method: A Capacitated Vehicle Routing Problem for Carriers (CVRPfC) model is used to consider the distribution scenario where a fleet of vehicles depart from a vehicle storage depot, collect products from a set of customer points and deliver them to a specific warehouse before returning to the vehicle storage depot. Validation of the model’s functionality was performed with adapted CVRP test problems from the Vehicle Routing Problem LIBrary. Following this, an assessment of the model’s economic impact was performed and validated with data from a real carrier (real instance) with the previously described distribution scenario. Results: The route planning obtained through the CVRPfC model accurately described the network flow of the real instance and significantly reduced its distribution costs. Conclusion: The CVRPfC model can thus improve the competitiveness of the carriers by providing better fares to their customers, reducing their distribution costs in the process.

中文翻译:

承运人的容量车辆路径问题模型

背景:车辆限制行车路线问题(CVRP)是物流和供应链管理中最重要的运输问题之一。标准CVRP考虑从仓库出发,从一组客户位置(点)收集产品(或将产品交付到)并返回同一仓库的具有同等容量的车辆。但是,承运公司和第三方运输提供商的运营可能会遵循不同的网络流程进行收集和交付。通过使用标准CVRP,这可能会导致路线规划不理想。目的:为承运人公司提供一种最优路线规划模型。方法:承运人的容量限制的车辆路线问题(CVRPfC)模型用于考虑以下分配方案:车队从车辆存放场出发,从一组客户点收集产品,然后将其运送到特定仓库,然后再返回车辆仓库。使用来自车辆路径问题库的改编的CVRP测试问题对模型的功能进行验证。此后,对模型的经济影响进行了评估,并使用了真实的承运人(真实实例)的数据通过上述分配方案进行了验证。结果:通过CVRPfC模型获得的路由规划准确地描述了真实实例的网络流,并大大降低了其分发成本。结论:
更新日期:2018-07-02
down
wechat
bug