Improved lower bounds and exact algorithm for the capacitated arc routing problem

@article{Bartolini2013ImprovedLB,
  title={Improved lower bounds and exact algorithm for the capacitated arc routing problem},
  author={Enrico Bartolini and Jean-François Cordeau and Gilbert Laporte},
  journal={Math. Program.},
  year={2013},
  volume={137},
  pages={409-452}
}
In the Capacitated Arc Routing Problem (CARP), a subset of the edges of an undirected graph has to be serviced at least cost by a fleet of identical vehicles in such a way that the total demand of the edges serviced by each vehicle does not exceed its capacity. This paper describes a new lower bounding method for the CARP based on a set partitioning-like formulation of the problem with additional cuts. This method uses cutand-column generation to solve different relaxations of the problem, and… CONTINUE READING