Rafael Martinelli

Exact Algorithms for Arc and Node Routing Problems

  • Rafael Martinelli
    • Categories Branch and Cut Algorithms, Cutting Plane Approaches, Dynamic Programming

    Routing problems stand among the hardest combinatorial problems to find high quality bounds or to prove new optimal solutions. In this thesis, we tackle the Capacitated Arc Routing Problem (CARP) and the Generalized Vehicle Routing Problem (GVRP). For both problems, there are a set of customers spread over a given graph, where each customer has … Read more

    Improved Bounds for Large Scale Capacitated Arc Routing Problem

  • Rafael Martinelli
  • Marcus Poggi de Aragão
  • Anand Subramanian
    • Categories Combinatorial Optimization, Cutting Plane Approaches, Meta Heuristics Tags , , , ,

    The Capacitated Arc Routing Problem (CARP) stands among the hardest combinatorial problems to solve or to find high quality solutions. This becomes even more true when dealing with large instances. This paper investigates methods to improve on lower and upper bounds of instances on graphs with over two hundred vertices and three hundred edges, dimensions … Read more