Fábio Luiz Usberti

• Abstract

  This research project intends to investigate the Green Vehicle Routing Problem (G-VRP), an NP-hard problem that generalizes the Vehicle Routing Problem (VRP), with the premiss that vehicles use alternative fuels which may have an impact on the vehicle autonomy. This research project has the objective to propose mathematical formulations with Mixed Integer Linear Programming (MILP) and a s…

  An algorithm for the electrical vehicle routin problem, BP.MS

• Abstract

  This research project proposes methodologies to solve the Prize Collecting Dominanting Cycle Problem (PCDCP). This problem is the composition of two NP-hard problems: the Dominating Set Problem and the Traveling Salesman Problem. Briefly, the aim of the PCDCP is to find a minimum cost cycle in an undirected graph. A traveler who needs to visit a set of customers (dominant vertices) traver…

  A computational study for the Prize-Collecting dominating cycle problem, BP.IC

• 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 re…

  Formulations and Algorithms for Arc Routing Problems, BP.DR

(Only some records are available in English at this moment)

• 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. This project concerns the study of two problems of the arc routing class: (1) arc routing with covering constraints; (2) arc routing with time-wind…

  Arc routing problems with scheduling and covering constraints, BE.EP.DR