This paper presents a Vehicle Routing Problem (VRP) to be solved through heuristics procedures. The methodology used consisted in a two-phase process: 1) Defining clusters in order to divide the region into pieces and then 2) Develop the routes in each of these smaller regions. To solve the first part, we used the Facility Location Problem (FLP) mathematical model, the heuristics Genetic Algorithm (GA), Teitz and Bart (T and B) Algorithm and also a hybrid method, combining GA and T and B, comparatively. We have to emphasize that the T and B algorithm has hardly been used by the researchers, although it provides quite promising results. For the second part, we use the Chinese Postman Problem (CPP) to develop the routes. We applied those methods in order to find routes for employees of an electric energy company, located in Sao Jose dos Pinhais, Parana, Brazil. Two scenarios were developed and we found that in both scenarios the hybrid method (GA and T and B) presented the best result in order to create better routes for the employees.
[1]
Samuel J. Raff,et al.
Routing and scheduling of vehicles and crews : The state of the art
,
1983,
Comput. Oper. Res..
[2]
F. Glover,et al.
Handbook of Metaheuristics
,
2019,
International Series in Operations Research & Management Science.
[3]
Edson Luiz França Senne,et al.
Abordagens complementares para problemas de p-medianas
,
2003
.
[4]
C. Carnieri,et al.
Introducao a pesquisa operacional
,
1983
.
[5]
Levi Ribeiro Abreu,et al.
A Hybrid Genetic Algorithm for solving the Unrelated Parallel Machine Scheduling problem with Sequence Dependent Setup Times.
,
2018,
IEEE Latin America Transactions.