Improved bounds for large scale capacitated arc routing problem

  • Authors:

  • Rafael Martinelli;Marcus Poggi;Anand Subramanian

  • Affiliations:

  • Pontifícia Universidade Católica do Rio de Janeiro (PUC-Rio) - Departamento de Informática - Rua Marquês de São Vicente, 225 - RDC, 4o andar - Gávea - Rio de Janeiro, ...;Pontifícia Universidade Católica do Rio de Janeiro (PUC-Rio) - Departamento de Informática - Rua Marquês de São Vicente, 225 - RDC, 4o andar - Gávea - Rio de Janeiro, ...;Universidade Federal da Paraíba (UFPB) - Departamento de Engenharia de Produção - Centro de Tecnologia, Campus I - Bloco G,Cidade Universitária - João Pessoa, PB 58051-970 ...

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2013

Quantified Score

Hi-index 0.01

Visualization

Abstract

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 200 vertices and 300 edges, dimensions that, today, can be considered of large scale. On the lower bound side, we propose to explore the speed of a dual ascent heuristic to generate capacity cuts. These cuts are next improved with a new exact separation enchained to the linear program resolution that follows the dual heuristic. On the upper bound, we implement a modified Iterated Local Search procedure to Capacitated Vehicle Routing Problem (CVRP) instances obtained by applying a transformation from the CARP original instances. Computational experiments were carried out on the set of large instances generated by Brandao and Eglese and also on the regular size sets. The experiments on the latter allow for evaluating the quality of the proposed solution approaches, while those on the former present improved lower and upper bounds for all instances of the corresponding set.