Two-edge disjoint survivable network design problem with relays

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)279-292
Number of pages14
JournalOperations Research/ Computer Science Interfaces Series
Volume47
DOIs
StatePublished - Dec 1 2009

Fingerprint

Telecommunication
Logistics
Costs
Network design
Logistics system
Destination
Heuristics
Node
Survivability
Commodities
Telecommunications
Metaheuristics

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Management Science and Operations Research

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",
month = "12",
day = "1",
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",

}

Two-edge disjoint survivable network design problem with relays. / Konak, Abdullah; Kulturel-Konak, Sadan; Smith, Alice E.

In: Operations Research/ Computer Science Interfaces Series, Vol. 47, 01.12.2009, p. 279-292.

Research output: Contribution to journalArticle

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/12/1

Y1 - 2009/12/1

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

VL - 47

SP - 279

EP - 292

JO - Operations Research/ Computer Science Interfaces Series

JF - Operations Research/ Computer Science Interfaces Series

SN - 1387-666X

ER -