MODELING THE ROUTING PROBLEM FOR PLANNING THE FOREST INVENTORY
Name: ANTONIO ALMEIDA DE BARROS JUNIOR
Publication date: 11/09/2017
Advisor:
Name |
Role |
|---|---|
| GILSON FERNANDES DA SILVA | Advisor * |
Examining board:
| Name |
Role |
|---|---|
| ADRIANO RIBEIRO DE MENDONÇA | Internal Examiner * |
| GILSON FERNANDES DA SILVA | Advisor * |
Summary: Among the various activities related to timber production, the forest inventory activity stands out for promoting the collection of data for analysis and decision making. In forest projects with large planting areas, the number of installed plots becomes very large, requiring prior planning and inventory activities programming. The planning consists of defining which plots will be inventoried in what period of time. In this context, this thesis presents a new approach to represent and obtain solutions for the Vehicle Routing Problem in the planning of forest inventories (PRV-IF). An adapted model of the Periodic Vehicle Routing Problem with Time Windows (PRPVJT) was proposed for the problem. The exact brach-and-cut method using the CPLEX solver and the Iterated Local Search (ILS) and Simulated Annealing (SA) metaheuristics were used as solution methods. The performance of the applied methods was analyzed by creating instances for the PRV-IF with different sizes. The results show that the methods were satisfactory in solving the problem, especially for the larger instances. The Simulated Annealing metaheuristic obtained the best results when compared to the other methods.
Keywords: Forest inventory, Periodic vehicle routing problem with time window, Linear Programming.
