### Abstract

This article presents a network design problem with relays considering the two-edge network connectivity. The problem arises in telecommunications and logistic networks where a constraint is imposed on the distance that a commodity can travel on a route without being processed by a relay, and the survivability of the network is critical in case of a component failure. The network design problem involves selecting two-edge disjoint paths between source and destination node pairs and determining the location of relays to minimize the network design cost. The formulated problem is solved by a hybrid approach of a genetic algorithm (GA) and a Lagrangian heuristic such that the GA searches for two-edge disjoint paths for each commodity, and the Lagrangian heuristic is used to determine relays on these paths. The performance of the proposed hybrid approach is compared to the previous approaches from the literature, with promising results.

Original language | English (US) |
---|---|

Pages (from-to) | 130-145 |

Number of pages | 16 |

Journal | Engineering Optimization |

Volume | 46 |

Issue number | 1 |

DOIs | |

State | Published - Jan 2 2014 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Science Applications
- Control and Optimization
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics

### Cite this

}

**Two-edge disjoint survivable network design problem with relays : A hybrid genetic algorithm and Lagrangian heuristic approach.** / Konak, Abdullah.

Research output: Contribution to journal › Article

TY - JOUR

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

T2 - A hybrid genetic algorithm and Lagrangian heuristic approach

AU - Konak, Abdullah

PY - 2014/1/2

Y1 - 2014/1/2

N2 - This article presents a network design problem with relays considering the two-edge network connectivity. The problem arises in telecommunications and logistic networks where a constraint is imposed on the distance that a commodity can travel on a route without being processed by a relay, and the survivability of the network is critical in case of a component failure. The network design problem involves selecting two-edge disjoint paths between source and destination node pairs and determining the location of relays to minimize the network design cost. The formulated problem is solved by a hybrid approach of a genetic algorithm (GA) and a Lagrangian heuristic such that the GA searches for two-edge disjoint paths for each commodity, and the Lagrangian heuristic is used to determine relays on these paths. The performance of the proposed hybrid approach is compared to the previous approaches from the literature, with promising results.

AB - This article presents a network design problem with relays considering the two-edge network connectivity. The problem arises in telecommunications and logistic networks where a constraint is imposed on the distance that a commodity can travel on a route without being processed by a relay, and the survivability of the network is critical in case of a component failure. The network design problem involves selecting two-edge disjoint paths between source and destination node pairs and determining the location of relays to minimize the network design cost. The formulated problem is solved by a hybrid approach of a genetic algorithm (GA) and a Lagrangian heuristic such that the GA searches for two-edge disjoint paths for each commodity, and the Lagrangian heuristic is used to determine relays on these paths. The performance of the proposed hybrid approach is compared to the previous approaches from the literature, with promising results.

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

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

U2 - 10.1080/0305215X.2012.753436

DO - 10.1080/0305215X.2012.753436

M3 - Article

AN - SCOPUS:84889887128

VL - 46

SP - 130

EP - 145

JO - Engineering Optimization

JF - Engineering Optimization

SN - 0305-215X

IS - 1

ER -