A genetic algorithm for distributed system topology design

Kumar, Anup; Pathak, Rakesh M.; Gupta, Yash P.; Parsaei, Hamid R.

doi:10.1016/0360-8352(94)00218-c

Cited by 67 publications

(25 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For R min =0.87, Fig. 1 (b) shows the optimal network topology, G min , whose links form a set of spanning trees{ (2,5,4), (1,4,5), (2, 1, 4), (1, 2, 5)} with Rel(G min )=0.88 and Cost(G min )=18; G min does not contain spanning trees (1,3,4), (1,3,5), (2,3,5) and (2, 3, 4) because link 3 is not selected.…”

Section: Network Design Problem and Solutionmentioning

confidence: 99%

“…For critical applications (e.g., emergency system, rescue and military operations) it is important that the communication network topology is as reliable as possible since in practice network components (e.g., links) are failure-prone. A more reliable topology will make the communication network operate effectively and without interruption, even in the presence of the component failures [1].Further, some applications may need to run on a topology with a guaranteed minimum reliability, R min , to properly operate. However, constructing a reliable topology incurs higher installation cost.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Programming for Minimal Cost Topology with Reliability Constraint

Elshqeirat¹,

Soh²,

Rai³

et al. 2014

JACN

View full text Add to dashboard Cite

Abstract-This paper addresses an NP-hard problem, called NTD-CR, to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint. Since reliability is always a major issue in the network design, the problem is practical for critical applications requiring minimized cost. The paper formulates a dynamic programming (DP) scheme to solve NTD-CR problem. DP approach, called DPCR-ST, generates the topology using a selected set of spanning trees of the network, STX min . We propose three greedy heuristics to generate and order only k spanning trees of the network. Each heuristic allows DPCR-ST to enumerate STX min using only k spanning trees, which improves the time complexity while producing near optimal topology. Simulations based on fully connected networks that contain up to 2.3×10 9 spanning trees show the merits of ordering methods and the effectiveness of our algorithm vis-à-vis four existing state-of-the-art techniques; DPCR-ST produces 81.5% optimal results, while using only 0.77%of the spanning trees contained in network.Index Terms-Dynamic programing, network optimization, network reliability, network topology design.

show abstract

Section: Network Design Problem and Solutionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Dynamic Programming for Minimal Cost Topology with Reliability Constraint

Elshqeirat¹,

Soh²,

Rai³

et al. 2014

JACN

View full text Add to dashboard Cite

show abstract

“…In recent years, TS has emerged as a highly efficient, search paradigm for finding high quality solutions quickly to combinative problems [10]. However, GAs often takes a lot of time in order to find the global optimum [11][12][13][14][15], and some studies have utilized a hybrid genetic algorithm to improve its performance. The drawback of TS is that its effectiveness depends very much on the strategy for manipulation of the tabu list.…”

Section: Introductionmentioning

confidence: 99%

A Hybrid GA-TS Algorithm for Optimizing Networked Manufacturing Resources Configuration

Zhan¹,

Lu²,

Li³

2013

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

Abstract:In recent years, more and more researchers have focused on various significant issues of resource configuration, such as maximum computing performance and minimum response time, especially taking existing resource utilization into account. The goal of this research is to design a resource configuration optimization system under networked manufacturing environment. A prediction mechanism is realized by using support vector regression (SVR) to estimate resource utilization according to network protocol of each manufacturing process, while redistributing resources based on the current status of existing resources pool. A resource configuration mechanism applying genetic algorithm working along with the tabu search process (GA-TS) is proposed in this study to determine the redistribution of resources. The experimental results show that the proposed scheme achieves an effective configuration via reaching the balance between the utilization of resources within existing resources and network protocol of each manufacturing process between potential resource requirements and the network resource providers.

show abstract

“…Heuristic algorithms were proposed in [4,5,6]. Genetic algorithms for network optimisation were proposed in [9,10,11]. In [11] a Monte-Carlo method it was used to evaluate the reliability of networks coded by the individuals in population.…”

Section: Introductionmentioning

confidence: 99%

“…In [11] a Monte-Carlo method it was used to evaluate the reliability of networks coded by the individuals in population. In [10,11] the reliability estimation it was done by computing the sum of maximum distance between nodes. The author of this paper also designed a genetic algorithm for this problem in [12].…”

Section: Introductionmentioning

confidence: 99%

Reliability and cost optimisation of complex electric power networks using ant colony algorithm

Piątek

2017

ITM Web Conf.

View full text Add to dashboard Cite

Abstract. The article presents a new approach towards reducing an overall cost of electric power network with maintaining its reliability. Goals are achieved by implementing an ant colony algorithm with a cut-set method as a method for reliability evaluation. The algorithm solves the problem of multi-objective optimisation, where both the network cost and network reliability index, known as unavailability, should be minimalised. The network cost is considered as a linear function of overall length of network's connections. For reliability evaluation in the cut-set method, real empiric data of hazard rate for overhead power lines are used. Parallel-series network structure, equivalent by means of reliability to analysed network, is generated through the cut-set method to compute unavailability of trial solutions. Sections of the structure are generated on the basis of minimum cut set, found by the algorithm for finding one-and two-minimum cuts. As used algorithm for finding minimum cuts has linear complexity, the evaluation of trial solutions is computationally effective. An example, presented in this article, provides figure of optimal network configurations found by the algorithm.

show abstract

A genetic algorithm for distributed system topology design

Cited by 67 publications

References 8 publications

Dynamic Programming for Minimal Cost Topology with Reliability Constraint

Dynamic Programming for Minimal Cost Topology with Reliability Constraint

A Hybrid GA-TS Algorithm for Optimizing Networked Manufacturing Resources Configuration

Reliability and cost optimisation of complex electric power networks using ant colony algorithm

Contact Info

Product

Resources

About