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

Sadan Kulturel-Konak; Abdullah Konak; Alice E. Smith

doi:10.1109/CEC.2000.870281

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

Sadan Kulturel-Konak, Abdullah Konak, Alice E. Smith

Division of Engineering, Business & Computing (Berks)

Research output: Contribution to conference › Paper › peer-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 language	English (US)
Pages	97-103
Number of pages	7
DOIs	https://doi.org/10.1109/CEC.2000.870281
State	Published - Jan 1 2000
Event	2000 Congress on Evolutionary Computation, CEC 2000 - San Diego, CA, United States Duration: Jul 16 2000 → Jul 19 2000

Other

Other	2000 Congress on Evolutionary Computation, CEC 2000
Country/Territory	United States
City	San Diego, CA
Period	7/16/00 → 7/19/00

All Science Journal Classification (ASJC) codes

Computational Theory and Mathematics
General Computer Science
General Engineering

Access to Document

10.1109/CEC.2000.870281

Cite this

@conference{26a2ac303b954c0ba6c97ad4dab8dc83,

title = "Minimum cost 2-edge-connected Steiner graphs in rectilinear space: An evolutionary approach",

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.",

author = "Sadan Kulturel-Konak and Abdullah Konak and Smith, {Alice E.}",

year = "2000",

month = jan,

day = "1",

doi = "10.1109/CEC.2000.870281",

language = "English (US)",

pages = "97--103",

note = "2000 Congress on Evolutionary Computation, CEC 2000 ; Conference date: 16-07-2000 Through 19-07-2000",

}

TY - CONF

T1 - Minimum cost 2-edge-connected Steiner graphs in rectilinear space

T2 - 2000 Congress on Evolutionary Computation, CEC 2000

AU - Kulturel-Konak, Sadan

AU - Konak, Abdullah

AU - Smith, Alice E.

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033672414&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033672414&partnerID=8YFLogxK

U2 - 10.1109/CEC.2000.870281

DO - 10.1109/CEC.2000.870281

M3 - Paper

AN - SCOPUS:0033672414

SP - 97

EP - 103

Y2 - 16 July 2000 through 19 July 2000

ER -

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

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this