Abstract
This paper proposes an evolutionary approach for constructing 2-edge-connected minimal Steiner graphs spanning n points given in the rectilinear plane. The 1-edge-connected version of this problem is known as the rectilinear Steiner tree problem and has been widely studied. Despite the possible application areas, the 2-edge-connected problem has not received the same attention. In this paper, some properties of an optimal solution to the problem are used to develop an encoding scheme. The proposed evolutionary approach is compared on a test problem with the optimal TSP tour of the given points.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.