Heuristics for Synthesizing Robust Networks with a Diameter Constraint
Joint Authors
Sun, Dengfeng
Wei, Peng
Nagarajan, Harsha
Rathinam, Sivakumar
Source
Mathematical Problems in Engineering
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-11, 11 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-01-05
Country of Publication
Egypt
No. of Pages
11
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Nagarajan, Harsha& Wei, Peng& Rathinam, Sivakumar& Sun, Dengfeng. 2014. Heuristics for Synthesizing Robust Networks with a Diameter Constraint. Mathematical Problems in Engineering،Vol. 2014, no. 2014, pp.1-11.
https://search.emarefa.net/detail/BIM-463778
Modern Language Association (MLA)
Nagarajan, Harsha…[et al.]. Heuristics for Synthesizing Robust Networks with a Diameter Constraint. Mathematical Problems in Engineering No. 2014 (2014), pp.1-11.
https://search.emarefa.net/detail/BIM-463778
American Medical Association (AMA)
Nagarajan, Harsha& Wei, Peng& Rathinam, Sivakumar& Sun, Dengfeng. Heuristics for Synthesizing Robust Networks with a Diameter Constraint. Mathematical Problems in Engineering. 2014. Vol. 2014, no. 2014, pp.1-11.
https://search.emarefa.net/detail/BIM-463778
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-463778