Enhancing electric power communication network resilience via disintegration strategy based on adaptive tabu search under cascading failure

Vulnerability Analysis of Electric Power Communication Network

Tabu search has become acceptable worldwide as one of the most efficient intelligent searches applied to various real‐world problems. There have been different modifications made to the generic tabu search in recent years to achieve better performances. Among those reviewed in the introduction of this paper, the adaptive tabu search (ATS) has incorporated the backtracking and the adaptive search radius mechanisms that help accelerate the search and release it from a local solution lock. The paper explains an enhancement made to the ATS to accomplish multipath ATS (MATS) algorithms. Performances of the ATS and the MATS are evaluated using surface optimization problems, and results are presented in the paper. Finally, the MATS is applied to solve a real‐world vehicle control problem.

Enhancing Electric Power Communication Network Resilience via Disintegration Strategy based on Adaptive Tabu Search under Cascading Failure

An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem

In this study, we focus on the market clearing problem of Turkish day-ahead electricity market. We propose a mathematical model by extending the variety of bid types for different price regions. The commercial solvers may not find any feasible solution for the proposed problem in some instances within the given time limits. Hence, we design an adaptive tabu search (ATS) algorithm to solve the problem. ATS discretizes continuous search space arising from the flow variables. Our method has adaptive radius and it achieves backtracking by a commercial solver. Then, we compare the performance of ATS with a heuristic decomposition method from the literature by using synthetic data sets. We evaluate the performances of the algorithms with respect to their solution times and surplus differences. ATS performs better in most of the sets.

We propose an ATS, for a class of optimal allocation problems, that uses various types of memory to make the search effective. To improve efficiency, our tabu search (TS) uses a combination of objects, rather than moves, as memory elements, simplifying search constraints and improving search efficiency. The ATS is applied to optimal allocation of irregular shapes on a sheet to minimize waste. The effectiveness of the proposed method is compared to other metaheuristics in a simulation whose results show the ATS to be superior.

This paper aims at exploring the reliability model based on communication network that carries power grid control service information, it analyzes service type and feature of the power grid control information carried by electric power communication network and the communication network transmission requirements. It studies the method of abstracting reliability parameters of the communication link for power grid control service (i.e. constructing a mapping from error rate to reliability). It analyzes factors and types of faults of node devices and optical cables that affect network reliability. It puts forward several kinds of reliability models for the typical electric power communication network. It gives some suggestions on studying the reliability of the electric power communication network on the basis of relevant studies on the reliability of the electric power communication network. Finally, it introduces the progress and achievement of relevant studies. It can provide reference for researchers on the reliability of electric power communication.

All three, Discrete Wavelet Transform (DWT) - Singular Value Decomposition (SVD) and Adaptive Tabu Search (ATS) have been used as mathematical tools for embedding data into an audio signal. In this paper, we present a new robust audio watermarking scheme based on DWT-SVD and ATS. After applying the DWT to the cover audio signal, we map the DWT coefficients, and apply the SVD, we search for the optimal intensity of audio watermarking by using the ATS. Experimental results show that the watermarking method performs well in both security and robustness to many digital signals processing, such as filtering, cropping, mp3 and random noise.

Mapping and Placement still are big challenges in Networks-on-Chip (NoCs) design, due to the scalability, although several heuristics have been proposed to solve them. These problems belong to the class of Quadratic Assignment Problems (QAP). For NoC-based dynamically reconfigurable systems (NoC-DRSs), both mapping and placement problems present an additional complexity level due the reconfigurable layers/scenarios, being treated only by Genetic Algorithm meta-heuristics; however, several researches have described Tabu Search meta-heuristics as the best QAP solvers. This paper presents a formalization for the mapping and placement on 2D-Mesh FPGA NoC-DRSs, and provides as solver, a novel approach of adaptive Tabu Search, named Nav-adaTS. Results with a series of benchmarks are presented and compared to a basic adaptive Tabu Search and to the genetic algorithm implementation.

This paper illustrates an application of adaptive tabu search (ATS) to optimal power flow (OPF) problems in comparison with some effective mathematical and evolutionaryoptimization methods. Although, the ATS was originally developed for solving a combinatorial optimization problem whose parameters are discrete, it has the ability to handle continuous variables by treating them as discrete ones with a very small variable step-size to gain accuracy. The proposed algorithm was tested with 9-bus and 300-bustest systems to represent a small-scale and a comparatively large-scale power system, respectively. Each test power system was challenged by performing three test cases. The first test case was given by applying a quadratic function to generators’ fuel-cost curve, whereas a non-smooth fuel-cost function was assigned to the second. In addition, the system voltage profile was considered and set as the objective function to be minimized in the last test case. The comparisons among solutions obtained by sequential quadratic programming (SQP), evolutionary programming (EP) and the ATS were carried out, from which satisfactory results and the selection of solution methods to OPF problems were summarized. Key words: Optimal power flow problem, sequential quadratic programming, evolutionary programming, adaptive tabu search, quadratic fuel cost, non-smooth fuel cost.

This paper presents an intelligent method for designing PIDA controller using an adaptive tabu search (ATS) algorithm, one of the most efficient artificial intelligent techniques. The target is considered as a metaheuristic approach with flexible, optimum, and robustness effectiveness for engineering problem applications. The ATS can be used to fimd the design of optimum PIDA controller’s parameters search for AC motor position control system. As results, the optimum PIDA controller is successfully obtained by the ATS at rise time $=0.118\mathrm{s}\mathrm{e}\mathrm{c}$, settling time $=1.53\mathrm{s}\mathrm{e}\mathrm{c}$, overshoot $=3.47$%, peak amplitude $=1.03$, peak time $=0.72\sec$ and the responses of controlled systems are very satisfactory as compared to Ziegler-Nichols method, Jung-Dorf approach and Kitti’s method.

This paper proposes a novel intelligent approach for solving the assembly line balancing (ALB) problems. The adaptive tabu search (ATS) method and the partial random permutation (PRP) technique are combined to provide optimal solutions for the ALB problems. In this work, the ATS is used to address the number of tasks assigned for each workstation, while the PRP is conducted to assign the sequence of tasks for each workstation according to precedence constraints. The multiple objectives including the workload variance, the idle time, and the line efficiency, are proposed and set as the objective function. The proposed approach is tested against three benchmark ALB problems and one real-world ALB problem. Obtained results are compared with results obtained from the single-objective approach. As results, the proposed multiple-objective approach based on the ATS and the PRP is capable of producing solutions superior to the single-objective.

Cascading failures are catastrophic processes that can destroy the functionality of a system, thus, understanding their development in real infrastructures is of vital importance. This may lead to a better management of everyday complex infrastructures relevant to modern societies, e.g., electrical power grids, communication and traffic networks. In this paper we examine the Motter–Lai model (2002 Phys. Rev. E 66 065102) of cascading failures induced by overloads in both isotropic and anisotropic spatial networks, generated by placing nodes in a square lattice and using various distributions of link lengths and angles. Anisotropy has not been earlier considered in the Motter–Lai model and is a real feature that may affect the cascading failures. This could reflect the existence of a preferred direction in which a given attribute of the system manifests, such as power lines that follow a city built parallel to the coast. We analyze the evolution of the cascading failures for systems with different strengths of anisotropy and show that the anisotropy causes a greater spread of damage along the preferential direction of links. We identify the critical linear size, l c, for a square shaped localized attack, which satisfies with high probability that above l c the cascading disrupts the giant component of functional nodes, while below l c the damage does not spread. We find that, for networks with any characteristic link length, their robustness decreases with the strength of the anisotropy. We show that the value of l c is finite and independent of the system size (for large systems), both for isotropic and anisotropic networks. Thus, in contrast to random attacks, where the critical fraction of nodes that survive the initial attack, p c, is usually below 1, here p c = 1. Note that the analogy to p c = 1 is also found for localized attacks in interdependent spatial networks (Berezin et al 2015 Sci. Rep. 5 8934). Finally, we measure the final distribution of functional cluster sizes and find a power-law behavior, with exponents similar to regular percolation. This indicates that, after the cascade which destroys the giant component, the system is at a percolation critical point. Additionally, we observe a crossover in the value of the distribution exponent, from critical percolation in a two-dimensional lattice for strong spatial embedding, to mean-field percolation for weak embedding.

Adaptive Tabu search and variable neighborhood descent for packing unequal circles into a square

Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables