scholarly journals TaBooN Boolean Network Synthesis Based on Tabu Search

2021 ◽  
pp. 1-1
Author(s):  
Sara Sadat Aghamiri ◽  
Franck Delaplace
Keyword(s):  
Tabu Search ◽  
Boolean Network ◽  
Network Synthesis

Tabu search algorithm for network synthesis

2000 ◽  
Vol 15 (2) ◽  
pp. 490-495 ◽  
Author(s):  
R.A. Gallego ◽  
R. Romero ◽  
A.J. Monticelli
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Network Synthesis ◽  
Tabu Search Algorithm

scholarly journals Heuristics for Synthesizing Robust Networks with a Diameter Constraint

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Harsha Nagarajan ◽  
Peng Wei ◽  
Sivakumar Rathinam ◽  
Dengfeng Sun
Keyword(s):  
Tabu Search ◽  
Shortest Path ◽  
Synthesis Problem ◽  
Network Synthesis ◽  
Algebraic Connectivity ◽  
Computational Results ◽  
Link Failures ◽  
Search Heuristics ◽  
Key Factor ◽  
Feasible Solutions

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 presentsk-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.

Sign in / Sign up

Export Citation Format

Share Document