Recurrent neural network for combined economic and emission dispatch

Recently, the combined economic and emission dispatch (CEED) problem, which aims to simultaneously decrease fuel cost and reduce environmental emissions of power systems, has been a widespread concern. To improve the utilization efficiency of primary energy, combined heat and power (CHP) units are likely to play an important role in the future. The goal of this study is to propose an approach to solve the CEED problems in a CHP system which consists of eight power generators (PGs), two CHP units and one heat only unit. Owing to the existence of power loss in power transmission line and the non-convex feasible region of CHP units, the proposed problem is a nonlinear, multi-constraints, non-convex multi-objectives (MO) optimization problem. To deal with it, a recurrent neural network (RNN) combined with a novel technique is developed. It means that the feasible region is separated into two convex regions by using two binary variables to search for different regions. In the frame of the neurodynamic optimization, existence and convergence of the dynamic model are analyzed. It shows that the convergence solution obtained by RNN is the optimal solution of CEED problem. Numerical simulation results show that the proposed algorithm can generate solutions efficiently.     

An economic load dispatch and multiple environmental dispatch problem solution with microgrids using interior search algorithm

Microgrid is a novel small-scale system of the centralized electricity for a small-scale community such as villages and commercial area. Microgrid consists of micro-sources like distribution generator, solar and wind units. A microgrid is consummate specific purposes like reliability, cost reduction, emission reduction, efficiency improvement, use of renewable sources and continuous energy source. In the microgrid, the Energy Management System is having a problem of Economic Load Dispatch (ELD) and Combined Economic Emission Dispatch (CEED) and it is optimized by meta-heuristic techniques. The key objective of this paper is to solve the Combined Economic Emission Dispatch (CEED) problem to obtain optimal system cost. The CEED is the procedure to scheduling the generating units within their bounds together with minimizing the fuel cost and emission values. The newly introduced Interior Search Algorithm (ISA) is applied for the solution of ELD and CEED problem. The minimization of total cost and total emission is obtained for four different scenarios like all sources included all sources without solar energy, all sources without wind energy and all sources without solar and wind energy. In both scenarios, the result shows the comparison of ISA with the Reduced Gradient Method (RGM), Ant Colony Optimization (ACO) technique and Cuckoo Search Algorithm (CSA) for the two different cases which are ELD without emission and CEED with emission. The results are calculated for different Power Demand of 24 h. The results obtained to ISA give comparatively better cost reduction as compared with RGM, ACO and CSA which shows the effectiveness of the given algorithm.

     

基于动态惩罚因子的改进蚱蜢算法求解经济负荷调度和经济排放联合调度问题

电力生产装置运行中各种燃料的成本逐步增加,需要最小化成本函数以求解此类复杂经济负荷调度问题.鉴于此,提出一种基于动态惩罚因子的改进蚱蜢算法求解经济负荷调度(economic load dispatch, ELD)问题和经济排放联合调度(combined economic emission dispatch, CEED)问题.为了提高蚱蜢算法(grasshopper optimization algorithm, GOA)性能,提出一种改进的混合蚱蜢算法(hybrid grasshopper optimization algorithm, HGOA),将重力搜索算子和鸽群搜索算子-地标算子加入GOA中,增强算法的搜索能力,平衡算法的勘探和开发.同时,为了更好地解决ELD和CEED问题中的约束问题,提出6个惩罚函数,包括2个V型函数、反正切函数、反正弦函数、线性函数和二次函数,并使用动态惩罚策略代替传统的固定值惩罚策略.选取3个ELD问题案例和4个CEED问题案例验证所提出方法的有效性,实验结果表明, HGOA相较于其他元启发式算法在求解质量上表现更好,且动态惩罚策略比固定值惩罚策略效果更...     

Quantum-behaved bat algorithm for many-objective combined economic emission dispatch problem using cubic criterion function

In this research, a quantum computing idea based bat algorithm (QBA) is proposed to solve many-objective combined economic emission dispatch (CEED) problem. Here, CEED is represented using cubic criterion function to reduce the nonlinearities of the system. Along with economic load dispatch, emissions of SO₂, NO_x, and CO₂ are considered as separate three objectives, thus making it a four-objective (many-objective) optimization problem. A unit-wise price penalty factor is considered here to convert all the objectives into a single objective in order to compare the final results with other previously used methods like Lagrangian relaxation (LR), particle swarm optimization, and simulated annealing. QBA is applied in six-unit power generation system for four different loads. The obtained results show QBA successfully solve many-objective CEED problem with greater superiority than other methods found in the literature in terms of quality results, robustness, and computational performance. In the end of this paper, a detailed future research direction is provided based on the simulation results and its analysis. The outcome of this research demonstrates that the inclusion of quantum computing idea in metaheuristic technique provides a useful and reliable tool for solving such many-objective optimization problem.

     

Adaptive Grey Wolf Optimization for Weightage-based Combined Economic Emission Dispatch in Hybrid Renewable Energy Systems

Nowadays, the electric power networks comprise diverse renewable energy resources, with the rapid development of technologies. In this scenario, the optimal Economic Dispatch is required by the power system due to the increment of power generation cost and ever growing demand of electrical energy. Thus, the reduction of power generation cost in terms of fuel cost and emission cost has become one of the main challenges in the power system. Accordingly, this article proposes the Grey Wolf Optimization-Extended Searching (GWO-ES) algorithm to provide the excellent solution for the problems regarding Combined Economic and Emission Dispatch (CEED). It validates the robustness of the proposed algorithm in seven Hybrid Renewable Energy Systems (HRES) test bus systems, which combines the wind turbine along with the thermal power plant. Furthermore, it compares the performance of the proposed GWO-ES algorithm with conventional algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), and GWO. Next, the article emulates a valuable convergence analysis and justification for the quality of CEED through the GWO-ES algorithm. Finally, the result was compared to four other conventional algorithms to assure the efficiency of the proposed algorithm in terms of fuel cost and emission cost reduction.     

A hybrid non-linear time-varying double-weighted particle swarm optimization for solving non-convex combined environmental economic dispatch problem

Fossil-fuel based power sources cause environmental pollution such as the degradation of air quality and climate change, which negatively impacts the life on the earth. Consequently, this demands that the power generation should consider the optimal management of thermal sources that are aimed at minimizing the emission of gasses in the generation mix. The production volume of multi-pollutant gasses (SO₂, NO_x, and CO₂) can be reduced through a combined environmental economic dispatch (CEED) approach. This study has proposed a hybrid algorithm based on a novel combination of a modified genetic algorithm and an improved version of particle swarm optimization abbreviated as MGAIPSO to solve CEED problem. The study utilizes three robust operators to enhance the performance of the proposed hybrid algorithm. In GA, a uniformly weighted arithmetic crossover and a normally distributed mutation operator have been implemented to produce elite off-springs in each iteration and diversify the solutions in the search space. In the case of PSO, a non-linear time-varying double-weighted (NLTVDW) technique is developed to obtain a substantial balance between exploration and exploitation. To further enhance the exploitation ability of the MGAIPSO, this study has implemented two movements correctional methods to continuously monitor and amend the position and velocity of the particles. Several numerical case studies ranging from small to large-scale are carried out to validate the practicality of the proposed algorithm.     

Modified neo-fuzzy neuron-based approach for economic and environmental optimal power dispatch

At the central energy management center in a power system, the real time controls continuously track the load changes and endeavor to match the total power demand with total generation in such a manner that the operating cost is minimized while all the operating constraints are satisfied. However, due to the strict government regulations on environmental protection, operation at minimum cost is no longer the only criterion for dispatching electrical power. The idea behind the environmentally constrained economic dispatch formulation is to estimate the optimal generation schedule of generating units in such a manner that fuel cost and harmful emission levels are both simultaneously minimized for a given load demand. Conventional optimization techniques become very time consuming and computationally extensive for such complex optimization tasks. These methods are hence not suitable for on-line use. Neural networks and fuzzy systems can be trained to generate accurate relations among variables in complex non-linear dynamical environment, as both are model-free estimators. The existing synergy between these two fields has been exploited in this paper for solving the economic and environmental dispatch problem on-line. A multi-output modified neo-fuzzy neuron (NFN), capable of real time training is proposed for economic and environmental power generation allocation.This model is found to achieve accurate results and the training is observed to be faster than other popular neural networks. The proposed method has been tested on medium-sized sample power systems with three and six generating units and found to be suitable for on-line combined environmental economic dispatch (CEED).     

基于HAGA的D2D-NOMA资源分配优化算法

针对无线系统带宽资源有限、基站负载压力大、传输时延长等问题,提出一种基于非正交多址接入技术的D2D系统吞吐量最大化资源分配算法。在不同用户的服务质量约束条件下,建立D2D系统吞吐量最大化资源分配模型。该模型的优化目标是一个混合整数非线性规划问题,将其解耦为信道匹配与功率分配2个子问题并分别进行处理,利用自适应惩罚函数法处理约束条件并提出一种基于爬山策略的自适应遗传算法以对问题进行求解。仿真结果表明,与GA、AGA算法相比,该算法能够有效提高D2D系统的吞吐量,且收敛性能更好。     

Optimal control of time-varying singular systems using the RK–Butcher algorithm

The problem of optimal control of time-varying linear singular systems with quadratic performance index has been studied using the Runge–Kutta–Butcher algorithm. The results obtained using the Runge–Kutta (RK) method based on the arithmetic mean (RKAM) and the RK–Butcher algorithms are compared with the exact solutions of the time-varying optimal control of linear singular systems. It is observed that the result obtained using the RK–Butcher algorithm is closer to the true solution of the problem. Stability regions for the RKAM algorithm, the single-term Walsh series method and the RK–Butcher algorithms are presented. Error graphs for the simulated results and exact solutions are presented in graphical form to highlight the efficiency of the RK–Butcher algorithm. This algorithm can easily be implemented using a digital computer. An additional advantage of this method is that the solution can be obtained for any length of time for this type of optimal control of time-varying linear singular systems.     

A hybrid hopfield network-simulated annealing approach for frequency assignment in satellite communications systems.

A hybrid Hopfield network-simulated annealing algorithm (HopSA) is presented for the frequency assignment problem (FAP) in satellite communications. The goal of this NP-complete problem is minimizing the cochannel interference between satellite communication systems by rearranging the frequency assignment, for the systems can accommodate the increasing demands. The HopSA algorithm consists of a fast digital Hopfield neural network which manages the problem constraints hybridized with a simulated annealing which improves the quality of the solutions obtained. We analyze the problem and its formulation, describing and discussing the HopSA algorithm and solving a set of benchmark problems. The results obtained are compared with other existing approaches in order to show the performance of the HopSA approach.     

Adaptive channel and power allocation of downlink multi-user MC-CDMA systems

The Multi-Carrier Code Division Multiple Access (MC-CDMA) is becoming a very attractive multiple access technique for high-rate data transmission in the future wireless communication systems. This paper is focused on the joint channel and power allocation in the downlink transmission of multi-user MC-CDMA systems and considers the throughput maximization problem as a mixed integer optimization problem. For simple analysis, the problem is divided into two less complex sub-problems: power allocation and channel allocation, which can be solved by a suboptimal Adaptive Power Allocation (APA) algorithm and an optimal Adaptive Channel Allocation (ACA) algorithm, respectively. By combining APA and ACA algorithms, an adaptive channel and power allocation scheme is proposed. The numerical results show that the proposed APA algorithm is more suitable for MC-CDMA systems than the conventional equal power allocation algorithm, and the proposed channel and power allocation scheme can significantly improve the system throughput performance.     

Optimal maintenance scheduling of generators using multiple swarms-MDPSO framework

In this paper, a challenging power system problem of effectively scheduling generating units for maintenance is presented and solved. The problem of generator maintenance scheduling (GMS) is solved in order to generate optimal preventive maintenance schedules of generators that guarantee improved economic benefits and reliable operation of a power system, subject to satisfying system load demand, allowable maintenance window, and crew and resource constraints. A multiple swarm concept is introduced for the modified discrete particle swarm optimization (MDPSO) algorithm to form a robust algorithm for solving the GMS problem. This algorithm is referred to by the authors as multiple swarms-modified particle swarm optimization (MS-MDPSO). The performance and effectiveness of the MS-MDPSO algorithm in solving the GMS problem is illustrated and compared with the MDPSO algorithm on two power systems, the 21-unit test system and 49-unit Nigerian hydrothermal power system. The GMS of the two power systems are considered and the results presented shows great potential for utility application in their area control centers for effective energy management, short and long term generation scheduling, system planning and operation.     

Symbiotic organisms search optimization algorithm for economic/emission dispatch problem in power systems

This paper presents symbiotic organisms search (SOS) algorithm to solve economic emission load dispatch (EELD) problem for thermal generators in power systems. The basic objective of the EELD is to minimize both minimum operating costs and emission levels, while satisfying the load demand and all equality–inequality constraints. In other research direction, this multi-objective problem is converted into single-objective function by using price penalty factor approach in order to solve it with SOS. The proposed algorithm has been implemented on various test cases, with different constraints and various cost curve nature. In order to see the effectiveness of the proposed algorithm, its results are compared to those reported in the recent literature. The results of the algorithms indicate that SOS gives good results in both systems and very competitive with the state of the art for the solution of the EELD problems.

     

Degree-of-Node Task Scheduling of Fine-Grained Parallel Programs on Heterogeneous Systems

Processor specialization has become the development trend of modern processor industry. It is quite possible that this will still be the main-stream in the next decades of semiconductor era. As the diversity of heterogeneous systems grows, organizing computation efficiently on systems with multiple kinds of heterogeneous processors is a challenging problem and will be a normality. In this paper, we analyze some state-of-the-art task scheduling algorithms of heterogeneous computing systems and propose a Degree of Node First (DONF) algorithm for task scheduling of fine-grained parallel programs on heterogeneous systems. The major innovations of DONF include:1) simplifying task priority calculation for directed acyclic graph (DAG) based fine-grained parallel programs which not only reduces the complexity of task selection but also enables the algorithm to solve the scheduling problem for dynamic DAGs; 2) building a novel communication model in the processor selection phase that makes the task scheduling much more efficient. They are achieved by exploring finegrained parallelism via a dataflow program execution model, and validated through experimental results with a selected set of benchmarks. The results on synthesized and real-world application DAGs show a very good performance. The proposed DONF algorithm significantly outperforms all the evaluated state-of-the-art heuristic algorithms in terms of scheduling length ratio (SLR) and efficiency.     

Approximately adaptive neural cooperative control for nonlinear multiagent systems with performance guarantee

This paper studies the cooperative control problem for a class of multiagent dynamical systems with partially unknown nonlinear system dynamics. In particular, the control objective is to solve the state consensus problem for multiagent systems based on the minimisation of certain cost functions for individual agents. Under the assumption that there exist admissible cooperative controls for such class of multiagent systems, the formulated problem is solved through finding the optimal cooperative control using the approximate dynamic programming and reinforcement learning approach. With the aid of neural network parameterisation and online adaptive learning, our method renders a practically implementable approximately adaptive neural cooperative control for multiagent systems. Specifically, based on the Bellman's principle of optimality, the Hamilton–Jacobi–Bellman (HJB) equation for multiagent systems is first derived. We then propose an approximately adaptive policy iteration algorithm for multiagent cooperative control based on neural network approximation of the value functions. The convergence of the proposed algorithm is rigorously proved using the contraction mapping method. The simulation results are included to validate the effectiveness of the proposed algorithm.     

面向管道系统的无线传感器网络三维节点部署算法

管道系统是事关国民经济发展的基础设施,而节点的三维部署问题是基于无线传感器网络的管道监控系统的基础性技术问题.首先把三维管道结构映射为XY和XZ 2个二维平面结构,分别对其进行传感器节点部署优化分析.然后在此基础上,设计了面向管道系统的三维传感器节点的部署算法.最后对算法进行了覆盖性能、连通性能以及能耗性能的评价,结果表明,该算法能有效解决管道系统节点三维部署问题,为超长油气管道、城市自来水管网及污水管网监测提供理论指导和实践依据.     

群智感知中基于时空关联性的用户激励机制

为在群智感知系统中实现有效的用户激励,提出基于显性与隐性时空关联的两种用户激励算法。将显性时空关联的用户激励问题转化为集合覆盖问题并利用贪心算法对其进行求解,同时结合显性时空关联算法和马尔科夫模型求解隐性时空关联的用户激励问题。在仿真数据和真实数据集上的实验结果表明,与传统最小化花费算法、最大化覆盖算法和最小化花费覆盖数比值算法相比,显性时空关联算法和隐性时空关联算法有效解决了感知任务完成率低且花费高的问题,能在实现用户激励的情况下最大化社会收益。     

An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups

In many real-world production systems, it requires an explicit consideration of sequence-dependent setup times when scheduling jobs. As for the scheduling criterion, the weighted tardiness is always regarded as one of the most important criteria in practical systems. While the importance of the weighted tardiness problem with sequence-dependent setup times has been recognized, the problem has received little attention in the scheduling literature. In this paper, we present an ant colony optimization (ACO) algorithm for such a problem in a single-machine environment. The proposed ACO algorithm has several features, including introducing a new parameter for the initial pheromone trail and adjusting the timing of applying local search, among others. The proposed algorithm is experimented on the benchmark problem instances and shows its advantage over existing algorithms. As a further investigation, the algorithm is applied to the unweighted version of the problem. Experimental results show that it is very competitive with the existing best-performing algorithms.     

Weighted residual methods and the suboptimal control of distributed parameter systems†

A suboptimal control algorithm for distributed parameter systems is developed in a framework which synthesizes weighted residual methods and mathematical programming. The heat exchanger example of Koppel et al. (1968) is employed for introducing the algorithm. First, the Galerkin procedure with polynomial modes is applied to obtain a lumped ODE model for the distributed parameter system. Then the state and control variables of the lumped control problem are approximated by cubic splines on a uniform mesh. Through collocation at the knots, the ODE model is reduced to a sot of linear algebraic equations and the suboptimal control is determined from the solution of a quadratic programming problem with sparse matrices.

Numerical results for the heat exchanger example are presented and compared with those obtained by the authors (Neuman and Sen 1972) using the Ritz-Trefftz algorithm (Bosarge and Johnson 1970) for the lumped control problem. For this example, the two algorithms yield essentially identical results with comparable computational requirements. Application of the Ritz-Trefftz algorithm, however, is limited to lumped, linear-quadratic control problems without constraints on the state or control. The approach advocated in this paper, therefore, offers a viable approach to control problems in distributed parameter systems.     

Robust PI controller design for nonlinear systems via fuzzymodeling approach

The design problem of proportional and proportional-plus-integral (PI) controllers for nonlinear systems is studied. First, the Takagi-Sugeno (T-S) fuzzy model with parameter uncertainties is used to approximate the nonlinear systems. Then a numerically tractable algorithm based on the technique of iterative linear matrix inequalities is developed to design a proportional (static output feedback) controller for the robust stabilization of the system in T-S fuzzy model. Next, we transform the problem of PI controller design to that of proportional controller design for an augmented system and thus bring the solution of the former problem into the configuration of the developed algorithm. Finally, the proposed method is applied to the design of robust stabilizing controllers for the excitation control of power systems. Simulation results show that the transient stability can be improved by using a fuzzy PI controller when large faults appear in the system, compared to the conventional PI controller designed by using linearization method around the steady state