Algoritmos Genéticos Aplicado ao Problema de Roteamento de Veículos

Abstract

Routing problems are often faced by companies who serve costumers through vehicles. Such problems have a challenging structure to optimize, despite the recent advances in combinatorial optimization. The goal of this project is to study and propose optimization algorithms to the vehicle routing problems (VRP). Focus will be on the problem variant in which the length of the route is restricted by a constant. A real problem will be tackled: optimization of postmen routes. Such problem was modeled as multi-objective in a roadmap with 25 vehicles and 30,000 deliveries per day.

Tasks

Reproductions