Abstract
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. The new optimization model allows the exact solution of problems up to about 60 nodes. The practical application is demonstrated by two examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
