| Grant number: | 16/00315-0 |
| Support Opportunities: | Scholarships in Brazil - Doctorate |
| Start date: | July 01, 2016 |
| End date: | March 31, 2020 |
| Field of knowledge: | Engineering - Production Engineering - Operational Research |
| Principal Investigator: | Fábio Luiz Usberti |
| Grantee: | Rafael Kendy Arakaki |
| Host Institution: | Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil |
| Associated scholarship(s): | 19/00197-5 - Arc routing problems with scheduling and covering constraints, BE.EP.DR |
Abstract Arc routing problems aim at determining the lowest cost routes visiting a subset of edges from a graph, with one or more additional constraints. The solution of these problems leads to lower logistics costs, improving business competitiveness. The Open Capacitated Arc Routing Problem (OCARP) is an NP-hard combinatorial optimization problem with practical applications, such as the meter reading routing problem and the cutting path determination problem. This paper proposes the study of new mathematical formulations for OCARP, aiming the implementation of algorithms for the exact solution of this problem. The motivation, objectives and preliminary results that sustains the development of this work are presented. | |
| News published in Agência FAPESP Newsletter about the scholarship: | |
| More itemsLess items | |
| TITULO | |
| Articles published in other media outlets ( ): | |
| More itemsLess items | |
| VEICULO: TITULO (DATA) | |
| VEICULO: TITULO (DATA) | |