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. This project concerns the study of two problems of the arc routing class: (1) arc routing with covering constraints; (2) arc routing with time-windows (scheduling constraints). Both are NP-hard combinatorial optimization problems. The objective of this project is the development of mathematical formulations and efficient metaheuristics in order to obtain exact and approximate solutions for these problems.
News published in Agência FAPESP Newsletter about the scholarship: