Um Algoritmo para o problema de roteirização de veículos com frota heterogênea

Abstract

In logistic distribution process is necessary deliver goods and services to geographically dispersed customers, in this process is found the Vehicle Routing Problem (VRP). The Vehicle Routing Problem (VRP), is the name of a problems class to define a sequence of visits to customers geographically dispersed with a finite set of vehicles from a common depot. To solve this problem, a algorithm was developed using the Variable Neighborhood Descent (VND) metaheuristic, comparing the results with some literature instances. The problem applies in practice on auto parts collection, industrial trash collection, residential trash collection, street cleaning, and other situations. The VRPs received many attention in the lasts years due to applicability and the economic importance in efficient strategies determination, with the objective of reduce the operational costs. The results of proposed algorithm were competitive to the algorithms studied. However, overcoming some of these algorithms in only one instance of the eight instances used.