Two-edge disjoint survivable network design problem with relays

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

doi:10.1007/978-0-387-88843-9_14

Two-edge disjoint survivable network design problem with relays

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

Division of Engineering, Business & Computing (Berks)

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

In this paper, we study the network design problem with relays considering network survivability. This problem arises in telecommunications and logistic systems. The design problem involves selecting two edge-disjoint paths between source and destination node pairs and determining the location of the relays in the network to minimize the network cost. A constraint is imposed on the distance that a signal or commodity can travel in the network without being processed by a relay. An efficient and effective meta-heuristic approach is proposed to solve large sized problems and compared with construction heuristics and an exact approach run for up to 24 hours using CPLEX.

Original language	English (US)
Pages (from-to)	279-292
Number of pages	14
Journal	Operations Research/ Computer Science Interfaces Series
Volume	47
DOIs	https://doi.org/10.1007/978-0-387-88843-9_14
State	Published - 2009

All Science Journal Classification (ASJC) codes

General Computer Science
Management Science and Operations Research

Access to Document

10.1007/978-0-387-88843-9_14

Cite this

@article{cc37c0effa414477a3e2bc621c77e49e,

title = "Two-edge disjoint survivable network design problem with relays",

abstract = "In this paper, we study the network design problem with relays considering network survivability. This problem arises in telecommunications and logistic systems. The design problem involves selecting two edge-disjoint paths between source and destination node pairs and determining the location of the relays in the network to minimize the network cost. A constraint is imposed on the distance that a signal or commodity can travel in the network without being processed by a relay. An efficient and effective meta-heuristic approach is proposed to solve large sized problems and compared with construction heuristics and an exact approach run for up to 24 hours using CPLEX.",

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

year = "2009",

doi = "10.1007/978-0-387-88843-9_14",

language = "English (US)",

volume = "47",

pages = "279--292",

journal = "Operations Research/ Computer Science Interfaces Series",

issn = "1387-666X",

publisher = "Springer Science + Business Media",

}

TY - JOUR

T1 - Two-edge disjoint survivable network design problem with relays

AU - Konak, Abdullah

AU - Kulturel-Konak, Sadan

AU - Smith, Alice E.

PY - 2009

Y1 - 2009

N2 - In this paper, we study the network design problem with relays considering network survivability. This problem arises in telecommunications and logistic systems. The design problem involves selecting two edge-disjoint paths between source and destination node pairs and determining the location of the relays in the network to minimize the network cost. A constraint is imposed on the distance that a signal or commodity can travel in the network without being processed by a relay. An efficient and effective meta-heuristic approach is proposed to solve large sized problems and compared with construction heuristics and an exact approach run for up to 24 hours using CPLEX.

AB - In this paper, we study the network design problem with relays considering network survivability. This problem arises in telecommunications and logistic systems. The design problem involves selecting two edge-disjoint paths between source and destination node pairs and determining the location of the relays in the network to minimize the network cost. A constraint is imposed on the distance that a signal or commodity can travel in the network without being processed by a relay. An efficient and effective meta-heuristic approach is proposed to solve large sized problems and compared with construction heuristics and an exact approach run for up to 24 hours using CPLEX.

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

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

U2 - 10.1007/978-0-387-88843-9_14

DO - 10.1007/978-0-387-88843-9_14

M3 - Article

AN - SCOPUS:84862784503

SN - 1387-666X

VL - 47

SP - 279

EP - 292

JO - Operations Research/ Computer Science Interfaces Series

JF - Operations Research/ Computer Science Interfaces Series

ER -

Two-edge disjoint survivable network design problem with relays

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this