Heuristics for Synthesizing Robust Networks with a Diameter Constraint | Zendy

Harsha Nagarajan | Zendy; Peng Wei | Zendy; Sivakumar Rathinam | Zendy; Dengfeng Sun | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Heuristics for Synthesizing Robust Networks with a Diameter Constraint

Author(s) -

Harsha Nagarajan,

Peng Wei,

Sivakumar Rathinam,

Dengfeng Sun

Publication year - 2014

Publication title -

mathematical problems in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.262

H-Index - 62

eISSN - 1026-7077

pISSN - 1024-123X

DOI - 10.1155/2014/326963

Subject(s) - heuristics , robustness (evolution) , tabu search , computer science , algebraic number , node (physics) , mathematical optimization , algorithm , theoretical computer science , mathematics , engineering , mathematical analysis , biochemistry , chemistry , structural engineering , gene

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research