Aplicação da metaheurística GRASP na programação de caminhões para o transporte de aves domésticas

Abstract

 

This paper’s main objective is to minimize the weighted average waiting time of trucks loaded with weight as the number of birds on each charge carriers, so that time is as close to 25 minutes, what time is considered ideal the company expects to slaughter the birds. The company works on poultry integrated system, with about 390 farms scattered around the 38 cities that are distant from her 8 km to 109 km. The average daily slaughter of 90,000 birds is from three to twelve farms. The transportation of poultry to the slaughterhouse is done by an outside company, which has a fleet is about half the daily slaughter, was therefore required more than one trip per truck. The problem is to do the routing of trucks to the farms and set the time, satisfying the demand for slaughter and minimizing downtime. As this is a problem in the literature classified as NP-hard, this paper proposes the use of a heuristic method based on GRASP metaheuristic which seeks to determine an optimal solution to the problem.