Heuristics and metaheuristics for vehicle routing problems

Abstract

Vehicle Routing Problems, in general, involve decisions that minimize the costs of transporting products through different routes using several vehicles to serve a non-homogeneous and geographically dispersed demand. These problems have great impact for the three sectors of economy, since they aim to minimize costs and to model logistical systems that are present from the manufacturing of a product to its sale. This project aims to study heuristics and metaheuristics for vehicle routing problems. We are also interested in variants of this problem, such as the Vehicle Routing Problem with Pickup and Delivery, in which goods must be moved from pickup to delivery points, and the variant with fleet sizing, where vehicles must be purchased at a cost. As a scientific initiation, this project aims to introduce the candidate in the research area and to complement his studies in Computer Science. Moreover, we intend to compile the results obtained in an article. (AU)