We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Heuristics for Synthesizing Robust Networks with a Diameter Constraint.
- Authors
Nagarajan, Harsha; Peng Wei; Rathinam, Sivakumar; Dengfeng Sun
- Abstract
Robustness of a network in the presence of node or link failures plays an important role in the design of the network. A key factor that quantifies this robustness is the algebraic connectivity of the network. In this paper, the authors address the problem of finding a network that maximizes the algebraic connectivity of the network while ensuring that the length of the shortest path joining any two nodes in the network is within a given bound. This paper presents k-opt and tabu search heuristics for finding feasible solutions for this network synthesis problem. Computational results are also presented to corroborate the performance of the proposed algorithms.
- Subjects
HEURISTIC algorithms; ROBUST control; PATH analysis (Statistics); TABU search algorithm; MATHEMATICAL bounds
- Publication
Mathematical Problems in Engineering, 2014, p1
- ISSN
1024-123X
- Publication type
Article
- DOI
10.1155/2014/326963