Summary. This work describes a subproblem in connexion with a newly developed optimization model for dynamic expansion planning of ring networks serving for electric power distribution in urban supply areas. This subproblem is the exact solution of a Travelling-salesman-problem by a continuous linear optimization model. A short survey over the complete planning model is given too. The model is created by a problem specific, flexibly applicable matrix generator and solved by a powerful commercial standard programming package. The symmetric Travelling-salesman-problems under consideration are characterized as follows: The set of potential ways is determined by the public streets of a city and the nodes to be connected are distributed uniformly over the supply area.