Shortest Path Passing All Routes
Construct the line graph of $G$, then solve the Travelling Salesman Problem on the resulting line graph.  This yields the optimal solution to your problem, assuming you want to visit every edge in your graph exactly once.

See also the route inspection problem (also known as the Chinese postman problem).