期刊名称：Journal of Transport and Supply Chain Management
印刷版ISSN：2310-8789
电子版ISSN：1995-5235
出版年度：2018
卷号：12
页码：9-17
DOI：10.4102/jtscm.v12i0.345
摘要：Abstract 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.
其他摘要：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;OVRP;Homogeneous Capacity;Distribution Costs;Capacitated Vehicle Routing Problem Model for Carriers
