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)|
|Number of pages||14|
|Journal||Operations Research/ Computer Science Interfaces Series|
|State||Published - Dec 1 2009|
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Management Science and Operations Research