Transmission system restoration with co-optimization of repairs,load pickups,and generation dispatch

This paper studies the restoration of a transmission system after a significant disruption such as a natural disaster. It considers the co-optimization of repairs, load pickups, and generation dispatch to produce a sequencing of the repairs that minimizes the size of the blackout over time. The core of this process is a Restoration Ordering Problem (ROP), a non-convex mixed-integer nonlinear program that is outside the capabilities of existing solver technologies. To address this computational barrier, the paper examines two approximations of the power flow equations: The DC model and the recently proposed LPAC model. Systematic, large-scale testing indicates that the DC model is not sufficiently accurate for solving the ROP. In contrast, the LPAC power flow model, which captures line losses, reactive power, and voltage magnitudes, is sufficiently accurate to obtain restoration plans that can be converted into AC-feasible power flows. An experimental study also suggests that the LPAC model provides a robust and appealing tradeoff between accuracy and computational performance for solving the ROP.     

A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

Optimal power flow by BAT search algorithm for generation reallocation with unified power flow controller

Optimal power flow with generation reallocation is a suitable method for better utilization of the existing system. In recent years, Flexible AC Transmission System (FACTS) devices, have led to the development of controllers that provide controllability and flexibility for power transmission. Out of the FACTS devices unified power flow controller (UPFC) is a versatile device, capable of controlling the power system parameters like voltage magnitude, phase angle and line impedance individually or simultaneously. The main aim of this paper is to minimize real power losses in a power system using BAT search algorithm without and with the presence of UPFC. Minimization of real power losses is done by considering the power generated by generator buses, voltage magnitudes at generator buses and reactive power injection from reactive power compensators. The proposed BAT algorithm based Optimal Power Flow (OPF) has been tested on a 5 bus test system and modified IEEE 30 bus system without and with UPFC. The results of the system with and without UPFC are compared in terms of active power losses in the transmission line using BAT algorithm. The obtained results are also compared with Genetic algorithm (GA).     

Hydrogen reduced graphene oxide/metal grid hybrid film: towards high performance transparent conductive electrode for flexible electrochromic devices

The metal grid and reduced graphene oxide (RGO) are both promising transparent conductive materials for replacing the indium tin oxide (ITO) in flexible optoelectronics. However, the large empty area that exists in the grid together with the relatively high sheet resistance of RGO hinder both the materials for practical applications. In this work, we report for the first time a novel strategy for efficient combination of the metal grid and RGO by using a newly developed room-temperature reduction technique. The obtained RGO/metal grid hybrid films not only overcome the shortcomings of individual components but exhibit enhanced optical and electrical performances (R_s = 18 Ω sq⁻¹ and T = 80%) and excellent flexural endurance. With this hybrid film as the window electrode, a highly flexible electrochromic device with excellent stability and ultra-fast response shorter than 60 ms has been successfully fabricated. Considering its high efficiency, high quality, low cost and large area, the strategy would be particularly useful for economically fabricating various metal grid/RGO films which are quite promising high performance transparent and conductive materials for next generation optoelectronic devices.     

Integrated circuit and system design for renewable energy inverters

This study proposes that a novel integrated circuit (IC) and system design for renewable energy inverters can harvest renewable energy to power direct current (DC) and alternating current (AC) loads. In addition, an intelligent synthesis and management tool is developed to design the proposed system and to judge the system’s operational maintenance decisions. Finally, a renewable energy inverter’s information is posted to an online system. Users can obtain the proposed system’s information at any time and place. The accurate and superior performance of the proposed IC and system is confirmed by computer simulations and experimental results.     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

An unsupervised approach to generating generic summaries of documents

We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.     

An adaptive image steganographic scheme based on Noise Visibility Function and an optimal chaotic based encryption method

Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks.     

Multiobjective PSO based adaption of neural network topology for pixel classification in satellite imagery

The proposed work involves the multiobjective PSO based adaption of optimal neural network topology for the classification of multispectral satellite images. It is per pixel supervised classification using spectral bands (original feature space). This paper also presents a thorough experimental analysis to investigate the behavior of neural network classifier for given problem. Based on 1050 number of experiments, we conclude that following two critical issues needs to be addressed: (1) selection of most discriminative spectral bands and (2) determination of optimal number of nodes in hidden layer. We propose new methodology based on multiobjective particle swarm optimization (MOPSO) technique to determine discriminative spectral bands and the number of hidden layer node simultaneously. The accuracy with neural network structure thus obtained is compared with that of traditional classifiers like MLC and Euclidean classifier. The performance of proposed classifier is evaluated quantitatively using Xie-Beni and β indexes. The result shows the superiority of the proposed method to the conventional one.