Multiple Tabu Search Algorithm for Solving the Topology Network Design

Watcharasitthiwat, Kanyapat; Pothiya, S.; Wardkein, P.

doi:10.5772/5587

Cited by 2 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Gs=R)+R3+8xR4+Rs+R2 (8) G9=R)+R3+8xR4+Rs+R2 (9) G lO =30x(G) xG2xG3xG4xGSxG6xG7xG S xG9) (10) G ll = J )+ J 2+ J 3 (II) G)2=G ll +G lO (12) The number of 30 is for lED equipments, and each lED equipment has 9 same transmission links. …”

Section: (7)mentioning

confidence: 99%

The research on reliability and real-time of the scheme of process layer GOOSE network in smart substation based on artificial cobweb topology structure

Liu

Zhu

et al. 2014

2014 International Power Electronics Conference (IPEC-Hiroshima 2014 - ECCE ASIA)

View full text Add to dashboard Cite

According to GOOSE defined in the IEC61850 in the smart substation, it explicitly stipulates the requirements for the transmission in reliability and real time of the process layer network scheme. The cobweb structure is an artificial communication network topology based on cobweb as it occurs in nature. On the basis of the cobweb in the nature, a novel cobweb topology structure, based on process layer GOOSE network in smart substation is proposed in this paper. With the method of fault tree analysis, this paper demonstrates the reliability of the network scheme in one certain smart substation. Industrial Ethernet transmission analysis on delay and OPNET Modeler are also employed to proof the cobweb topology performs well in reliability and real-time. The results of the theoretical analysis and simulation indicate that the cobweb topology structure exhibits excellent reliability and real time in smart substation GOOSE communication network.

show abstract

Section: (7)mentioning

confidence: 99%

The research on reliability and real-time of the scheme of process layer GOOSE network in smart substation based on artificial cobweb topology structure

Liu

Zhu

et al. 2014

2014 International Power Electronics Conference (IPEC-Hiroshima 2014 - ECCE ASIA)

View full text Add to dashboard Cite

show abstract

“…There are many proposed techniques [4]- [22] that find optimal or approximately optimal solutions for the NTD-CR problem. Branch & Bound (B&B) techniques [5], [6], used to generate optimal solutions, are applicable only for designing small topologies due to the difficult nature of the problem.…”

Section: Acronyms and Abbreviationsmentioning

confidence: 99%

“…Recently, a new metaheuristic called Cross-Entropy method [11] was developed for the NTD-CR problem. In addition, the Multiple TS algorithm [22] was used to solve the NTD-CR problem with 19 nodes; however, the algorithm may not reach the global optimum solution in a reasonable computation time when the initial solution is far away from the region where the optimum solution exists. In [14], a Binary Decision Diagram (BDD) is used to solve the same design problem for networks containing up to 81 nodes.…”

Section: B Related Workmentioning

confidence: 99%

Topology Design with Minimal Cost Subject to Network Reliability Constraint

et al. 2015

View full text Add to dashboard Cite

This paper addresses an NP-hard problem, refered to as Network Topology Design with minimum Cost subject to a Reliability constraint (NTD-CR), to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint. The paper describes a dynamic programming (DP) scheme to solve the NTD-CR problem, and proposes a DP approach, called Dynamic Programming Algorithm to solve NTD-CR (DPCR-ST), to generate the topology using a selected sequence of spanning trees of the network, . The paper shows that our DPCR-ST approach always provides a feasible solution, and produces an optimal topology given an optimal order of spanning trees. The paper proves that the problem of optimally ordering the spanning trees is NP-complete, and proposes three greedy heuristics to generate and order only spanning trees of the network. Each heuristic allows the DPCR-ST approach to generate using only spanning trees, which improves the time complexity while producing a near optimal topology. Simulations based on fully connected networks that contain up to spanning trees show the merits of using the ordering methods and the effectiveness of our algorithm vis-à-vis to four existing state-of-the-art techniques. Our DPCR-ST approach is able to generate 81.5% optimal results, while using only 0.77% of the spanning trees contained in networks. Further, for a typical 2 100 grid network that contains up to spanning trees, DPCR-ST approach requires only spanning trees to generate a topology with a reliability no larger than 5.05% off from optimal.Index Terms-Dynamic programming, network optimization, network reliability, network topology design. 0018-9529

show abstract

Multiple Tabu Search Algorithm for Solving the Topology Network Design

Cited by 2 publications

References 23 publications

The research on reliability and real-time of the scheme of process layer GOOSE network in smart substation based on artificial cobweb topology structure

The research on reliability and real-time of the scheme of process layer GOOSE network in smart substation based on artificial cobweb topology structure

Topology Design with Minimal Cost Subject to Network Reliability Constraint

Contact Info

Product

Resources

About