O problema de agrupamento de tarefas em uma frota heterogênea de veículos

Abstract

In the face of globalization and high competition in the market, companies began to seek new competitive alternatives, so any gains from cost savings became important, thus came the planning of the distribution of goods in various types of modes. The cost of transporting products is about 60% of the total cost of all the logistics, from 4% to 25% of gross sales of the company (RIBEIRO & FERREIRA, 2002). Thus, determining the number of vehicles needed to transport a given amount of product is one of the main problems of logistics. This work will address the delivery clustering problem in a heterogeneous fleet of vehicles (Variable Size Bin Packing Problem - VSBPP). The VSBPP consists of, given a set of objects (deliveries), which determine the minimum number of bins (vehicle) necessary to move all the objects.