The Open Capacitated Arc Routing Problem (OCARP) is a new NP-hard combinatorial optimization problem where we must find a set of minimum cost paths which covers all required edges from an undirected graph under capacity constraints. This problem is based upon the Capacitated Arc Routing Problem (CARP) but differs from it since OCARP does not comply a depot and routes are not constrained to form cycles. An integer linear programming formulation followed by some usefull properties are given. The… CONTINUE READING