Advanced search
Start date
Betweenand

Formulations and Algorithms for Arc Routing Problems

Grant number: 16/00315-0
Support type:Scholarships in Brazil - Doctorate
Effective date (Start): July 01, 2016
Effective date (End): March 31, 2020
Field of knowledge:Engineering - Production Engineering - Operational Research
Principal researcher:Fábio Luiz Usberti
Grantee:Rafael Kendy Arakaki
Home 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:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Scientific publications
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
ARAKAKI, RAFAEL KENDY; USBERTI, FABIO LUIZ. An efficiency-based path-scanning heuristic for the capacitated arc routing problem. Computers & Operations Research, v. 103, p. 288-295, MAR 2019. Web of Science Citations: 1.
ARAKAKI, RAFAEL KENDY; USBERTI, FABIO LUIZ. Hybrid genetic algorithm for the open capacitated arc routing problem. Computers & Operations Research, v. 90, p. 221-231, FEB 2018. Web of Science Citations: 8.

Please report errors in scientific publications list by writing to: cdi@fapesp.br.