Inventory Model in a CVRP Distribution Network with Uniformly Distributed Demand
At the present time, business and industrial organizations are given the task of good planning when determining any type of acquisition for their services. That is, identify and evaluate the different options of provision of inventory that allow the company to maintain and improve its offer. Within this evaluation, it can be noticed that the decision of the management and administration of resources, involves the problem of distribution (goods and services), being also of great importance within the supply chain. In this way, in this paper we analyze the Capacitated Vehicle Routing Problem with ellipsoidal distances, which includes an inventory model with uniformly distributed demands, so that inventory costs and distances are minimized. With this contribution, the way to minimize total costs in a distribution period can be refined. For validation, computational evaluations obtained from the mathematical model and backed by the software are presented (LINGO 18.0 - MATLAB).