Distribution methodology in small brewery company to obtain profits in short time

Abstract

This paper presents a methodology oriented to obtain profits in the short-term and is applied to the brewery industry for distributing goods. It is composed of two models of Operations Research (OR), the Knapsack Problem (KP), and the Traveling Salesman Problem (TSP). Also, the Greedy Algorithm is used. In the first step, the KP modified model is used in the choice of the product to give priority to products, which maximize the profit of the Company, making the load assignments for each route respecting the constraints of volume and weight of vehicle capacity. The volume of the vehicle considers full boxes, and its weight and profit are calculated in bottles. As a result, the product loaded is prioritized, where the highest profit product is delivered first and then the low-profit product. Subsequently, the TSP model was used to select the best route for the distribution of the products. Finally, with the Greedy Algorithm and results obtained previously, the customers to be visited are determined.