Solving capacitated arc routing problems using a transformation to the CVRP

A well known transformation by Pearn, Assad and Golden reduces a Capacitated Arc Routing Problem (CARP) into an equivalent Capacitated Vehicle Routing Problem (CVRP). However, that transformation is regarded as unpractical, since an original instance with r required edges is turned into a CVRP over a complete graph with 3r + 1 vertices. We propose a similar transformation that reduces this graph to 2r + 1 vertices, with the

• Type: Journal
• Year: 2006
• Where: COR
• Authors: Humberto Longo, Marcus Poggi de Aragão, Eduardo Uchoa
• Keywords: Capacitated Arc, COR 2006, Equivalent Capacitated Vehicle, Routing