Minimum cost 2-edge-connected Steiner graphs in rectilinear space: An evolutionary approach

Research output: Contribution to conferencePaperpeer-review

3 Scopus citations

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.

Original languageEnglish (US)
Pages97-103
Number of pages7
DOIs
StatePublished - Jan 1 2000
Event2000 Congress on Evolutionary Computation, CEC 2000 - San Diego, CA, United States
Duration: Jul 16 2000Jul 19 2000

Other

Other2000 Congress on Evolutionary Computation, CEC 2000
CountryUnited States
CitySan Diego, CA
Period7/16/007/19/00

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'Minimum cost 2-edge-connected Steiner graphs in rectilinear space: An evolutionary approach'. Together they form a unique fingerprint.

Cite this