An implementation of improved harmony search algorithm for scenario-based transmission expansion planning

In this paper a new scenario-based framework is presented for transmission expansion planning (TEP) under normal and N–1 conditions. The proposed framework takes into account cost of network losses, cost of the transmission circuits and substations in the optimization process as objective functions, while considers short-term and also long-term constraints under normal and N–1 conditions as problem constraints. The proposed model is a non-convex optimization problem having a non-linear mixed-integer nature. A new improved harmony search algorithm (IHSA) is used in order to obtain the final optimal solution. The IHSA is a recently developed optimization algorithm which imitates the music improvisation process. In this process, the harmonists improvise their instrument pitches searching for the perfect state of harmony. The newly planning methodology has been demonstrated on the well-known Garver’s 6-bus test system and a real life network of south Brazilian electric power grid in order to demonstrate the feasibility and capabilities of the proposed algorithm. The detailed results of the case studies are presented and thoroughly analyzed. The obtained TEP results illustrate the sufficiency and profitableness of the newly developed method in expansion planning when compared with other methods.     

Multi-fingered robot hand optimal task force distribution: Neural inverse kinematics approach

Grasping and manipulation force distribution optimization of multi-fingered robotic hands can be formulated as a problem for minimizing an objective function subject to form-closure constraints, kinematics, and balance constraints of external force. In this paper we present a novel neural network for dexterous hand-grasping inverse kinematics mapping used in force optimization. The proposed optimization is shown to be globally convergent to the optimal grasping force. The approach followed here is to let an artificial neural network (ANN) learn the nonlinear inverse kinematics functional relating the hand joint positions and displacements to object displacement. This is done by considering the inverse hand Jacobian, in addition to the interaction between hand fingers and the object. The proposed neural-network approach has the advantages that the complexity for implementation is reduced, and the solution accuracy is increased, by avoiding the linearization of quadratic friction constraints. Simulation results show that the proposed neural network can achieve optimal grasping force.     

面向智慧教室的无线传感网边缘节点智能部署方法

摘 要: 为降低部署后的通信时延,提高智慧教室的数据发送与网络使用效率,提出面向智慧教室的无线传感网边缘节点智能部署方法。以智慧教室场景中良好的通信、最大限度降低部署边缘节点成本为优化目标,构建边缘节点智能部署的目标函数。针对目标函数设定流量约束条件、无线传感网数据流约束条件、节点计算能力约束条件。自适应调整粒子群优化算法的惯性权重、粒子更新速度、Pareto最优解保存策略,设计多目标改进粒子群优化算法求解目标函数,实现面向智慧教室的无线传感网边缘节点智能部署。测试结果表明,该方法的时延较低,网络计算能力较高,保证了智慧教室无线传感网通信和传输质量。     

Robustness of policies in constrained Markov decision processes

We consider the optimization of finite-state, finite-action Markov decision processes (MDPs), under constraints. Cost and constraints are discounted. We introduce a new method for investigating the continuity, and a certain type of robustness, of the optimal cost and the optimal policy under changes in the constraints. This method is also applicable for other cost criteria such as finite horizon and infinite horizon average cost.     

Big Data Based Self-optimization Networking: A Novel Approach Beyond Cognition

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation wireless networks. A self-optimization technique is introduced as the only viable solution for controlling and managing this type of huge data networks. This technique allows control of resources and key performance indicators without human intervention, based solely on the network intelligence. The present study proposes a big data based self optimization networking (BD-SON) model for wireless networks in which the KPI parameters affecting the QoS are assumed to be controlled through a multidimensional decision-making process. Also, Resource Management Center (RMC) was used to allocate the required resources to each part of the network based on made decision in SON engine, which can satisfy QoS constraints of a multicast session in which satisfying interference constraints is the main challenge. A load-balanced gradient power allocation (L-GPA) scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. Experimental results confirm that the proposed power allocation techniques considerably increase the chances of finding an optimal solution. Also, results confirm that proposed model achieves significant gain in terms of quality of service and capacity along with low complexity and load balancing optimality in the network.     

Reliability based optimization: A safety index approach

An alternative approach to the classical chance constraint optimization technique is presented. The proposed method employs an advanced second-moment method in evaluating the probabilities of violating the constraints. The approach is applied to the optimal design of a simple structure. The results are compared to those obtained using the classical chance constraint optimization technique. Using the proposed optimization approach the basic drawbacks of the classical chance constraint optimization technique are shown to be overcome. The improved accuracy of the new optimazation method is verified using Monte-Carlo simulation.     

Demand response scheduling to support distribution networks operation using rolling multi-period optimization

This paper presents an approach of demand response (DR) scheduling with thermostatically controlled loads (TCL) in a distribution grid with high penetration of distributed generations (DG). In this approach, household TCL are employed as flexibility resources to support the distribution network for mitigating voltage or congestion constraints. A two-stage rolling optimization based control scheme is proposed to determine the optimal operating status of flexible loads using the forecast of generation and demand in the distribution system. The proposed methodology is conducted in a distribution test feeder with realistic scenarios. The simulation results have shown the usefulness and efficiency of the proposed method in improving the network operation and increasing the hosting capacity of DG.     

Multi-objective optimal power flow using quasi-oppositional teaching learning based optimization

This paper describes teaching learning based optimization (TLBO) algorithm to solve multi-objective optimal power flow (MOOPF) problems while satisfying various operational constraints. To improve the convergence speed and quality of solution, quasi-oppositional based learning (QOBL) is incorporated in original TLBO algorithm. The proposed quasi-oppositional teaching learning based optimization (QOTLBO) approach is implemented on IEEE 30-bus system, Indian utility 62-bus system and IEEE 118-bus system to solve four different single objectives, namely fuel cost minimization, system power loss minimization and voltage stability index minimization and emission minimization; three bi-objectives optimization namely minimization of fuel cost and transmission loss; minimization of fuel cost and L-index and minimization of fuel cost and emission and one tri-objective optimization namely fuel cost, minimization of transmission losses and improvement of voltage stability simultaneously. In this article, the results obtained using the QOTLBO algorithm, is comparable with those of TLBO and other algorithms reported in the literature. The numerical results demonstrate the capabilities of the proposed approach to generate true and well-distributed Pareto optimal non-dominated solutions of the multi-objective OPF problem. The simulation results also show that the proposed approach produces better quality of the individual as well as compromising solutions than other algorithms.     

基于能效的多天线中继网络波束形成设计

为了提高放大转发多天线中继网络的能量效率,提出了一种基于能量效率的波束形成算法,在满足中继功率约束条件的同时,最大化系统归一化信噪比.最终得到的优化问题是一个非凸的优化问题,难以求解.将其简化为一个一维的优化问题,可以利用求导的方法进行求解.仿真结果表明:与基于信噪比的波束形成算法和未使用波束形成的放大转发方式相比,所提算法可显著提高系统的能量效率.     

Real-time optimization flow control

In this paper, we propose a dynamic optimization approach to end-to-end flow control in data networks. The objective is to maximize the aggregate utilities of the data sources over soft transmission rate bounds and delay constraints. The network links and data sources are considered as processors of a distributed computational system that has a global objective function. The presented model works with different shapes of utility curves under the proposition of elastic data traffic. The approach relies on real-time observations of the delay as a measure of the data network congestion at the routers (network nodes). A primal–dual algorithm carried out by the data sources is used to solve the optimization problem in a decentralized manner. The calculated transmission rates are bounded and the sources are subjected to a maximum number of data packets that can be queued downstream of each transmission session. The algorithm solves for the rates without the access to any network global information while each source calculates its transmission rate that should maximize the global objective function. The calculated optimal rates conform to rate-to-queue proportionality. Finally, we present an extensive simulation results to demonstrate the reliability of the algorithm.     

A game theoretic approach for power allocation with QoS constraints in wireless multimedia sensor networks

The distinctive features of wireless multimedia sensor networks (WMSNs) include application-specific quality-of-service (QoS) requirements and limited energy supply, with which each node makes its own decisions selfishly. Therefore this paper presents a power control game theoretic approach for WMSNs by studying the effect of transmission power on QoS and energy efficiency. The game approach determines the transmission strategy using utility optimization according to the fluctuation of channel states. Here, the utility function is defined by effective throughput per unit power while satisfying the user’s delay QoS constraints. The existence and uniqueness of Nash equilibrium for the proposed game are proved. Finally, the simulation results show that each user chooses the optimal transmission power to maximize its utility based on other constant parameters and the effects of delay constraints on the user’s utility are quantified as well.     

认知中继网络中的功率分配算法

无人机（Unmanned aerial vehicle, UAV）通信是当前无线通信领域的研究热点。为了保证地面移动端与UAV通信的可靠性,提出了基于空时块码（Space-time block code, STBC）的协作中继传输方案。为了提升频谱效率,本文利用认知无线电技术,于协作中继处分别采用放大转发(Amplify-and-forward, AF)和解码转发(Decode-and-forward, DF)两种协议进行传输,在主用户通信服务质量得到保证和认知用户传输功率受限的条件下,建立以认知中继网络的吞吐量最大化为目标函数的优化问题。采取拉格朗日乘子法与Karush-Kuhn-Tucker (KKT)条件相结合的方案来实现优化问题中最优功率的分配。最后,仿真结果不仅验证了所提方案的有效性,还表明了DF中继协议下认知中继网络的吞吐量优于AF中继协议。     

针对不确定流量的多收发机无线网络资源优化研究

多收发机无线网络具有多接口多信道多跳的特点,是今后无线网络发展的趋势。该网络中信道与链路的资源分配,涉及路由、信道分配以及链路调度的联合优化。在以往的研究中通常对网络流量模型进行简化,假设其是确定且相对稳定的。考虑到实际网络中流量不确定性的特征,以网络吞吐量最大化为目标,提出传输流约束、信道资源约束以及干扰约束条件下的资源分配联合优化模型,以及基于不确定流量条件下资源分配最优解的链路调度策略。仿真实验结果证明所提出的路由、信道分配及链路调度方案能够更好地适应变化的网络流量需求。     

Sequential approximate multi-objective optimization using radial basis function network

In industrial design optimization, objectives and constraints are generally given as implicit form of the design variables, and are evaluated through computationally intensive numerical simulation. Under this situation, response surface methodology is one of helpful approaches to design optimization. One of these approaches, known as sequential approximate optimization (SAO), has gained its popularity in recent years. In SAO, the sampling strategy for obtaining a highly accurate global minimum remains a critical issue. In this paper, we propose a new sampling strategy using sequential approximate multi-objective optimization (SAMOO) in radial basis function (RBF) network. To identify a part of the pareto-optimal solutions with a small number of function evaluations, our proposed sampling strategy consists of three phases: (1) a pareto-optimal solution of the response surfaces is taken as a new sampling point; (2) new points are added in and around the unexplored region; and (3) other parts of the pareto-optimal solutions are identified using a new function called the pareto-fitness function. The optimal solution of this pareto-fitness function is then taken as a new sampling point. The upshot of this approach is that phases (2) and (3) add sampling points without solving the multi-objective optimization problem. The detailed procedure to construct the pareto-fitness function with the RBF network is described. Through numerical examples, the validity of the proposed sampling strategy is discussed.     

Deadline division-based heuristic for cost optimization in workflow scheduling

Cost optimization for workflow applications described by Directed Acyclic Graph (DAG) with deadline constraints is a fundamental and intractable problem on Grids. In this paper, an effective and efficient heuristic called DET (Deadline Early Tree) is proposed. An early feasible schedule for a workflow application is defined as an Early Tree. According to the Early Tree, all tasks are grouped and the Critical Path is given. For critical activities, the optimal cost solution under the deadline constraint can be obtained by a dynamic programming strategy, and the whole deadline is segmented into time windows according to the slack time float. For non-critical activities, an iterative procedure is proposed to maximize time windows while maintaining the precedence constraints among activities. In terms of the time window allocations, a local optimization method is developed to minimize execution costs. The two local cost optimization methods can lead to a global near-optimal solution. Experimental results show that DET outperforms two other recent leveling algorithms. Moreover, the deadline division strategy adopted by DET can be applied to all feasible deadlines.     

基于深度强化学习的微电网在线优化调度

提出一种基于深度强化学习的微电网在线优化调度策略.针对可再生能源的随机性及复杂的潮流约束对微电网经济安全运行带来的挑战,以成本最小为目标,考虑微电网运行状态及调度动作的约束,将微电网在线调度问题建模为一个约束马尔可夫决策过程.为避免求解复杂的非线性潮流优化、降低对高精度预测信息及系统模型的依赖,设计一个卷积神经网络结构学习最优的调度策略.所提出的神经网络结构可以从微电网原始观测数据中提取高质量的特征,并基于提取到的特征直接产生调度决策.为了确保该神经网络产生的调度决策能够满足复杂的网络潮流约束,结合拉格朗日乘子法与soft actor-critic,提出一种新的深度强化学习算法来训练该神经网络.最后,为验证所提出方法的有效性,利用真实的电力系统数据进行仿真.仿真结果表明,所提出的在线优化调度方法可以有效地从数据中学习到满足潮流约束且具有成本效益的调度策略,降低随机性对微电网运行的影响.     

Software defect prediction using cost-sensitive neural network

The software development life cycle generally includes analysis, design, implementation, test and release phases. The testing phase should be operated effectively in order to release bug-free software to end users. In the last two decades, academicians have taken an increasing interest in the software defect prediction problem, several machine learning techniques have been applied for more robust prediction. A different classification approach for this problem is proposed in this paper. A combination of traditional Artificial Neural Network (ANN) and the novel Artificial Bee Colony (ABC) algorithm are used in this study. Training the neural network is performed by ABC algorithm in order to find optimal weights. The False Positive Rate (FPR) and False Negative Rate (FNR) multiplied by parametric cost coefficients are the optimization task of the ABC algorithm. Software defect data in nature have a class imbalance because of the skewed distribution of defective and non-defective modules, so that conventional error functions of the neural network produce unbalanced FPR and FNR results. The proposed approach was applied to five publicly available datasets from the NASA Metrics Data Program repository. Accuracy, probability of detection, probability of false alarm, balance, Area Under Curve (AUC), and Normalized Expected Cost of Misclassification (NECM) are the main performance indicators of our classification approach. In order to prevent random results, the dataset was shuffled and the algorithm was executed 10 times with the use of n-fold cross-validation in each iteration. Our experimental results showed that a cost-sensitive neural network can be created successfully by using the ABC optimization algorithm for the purpose of software defect prediction.     

组网中基于AODV协议的QoS延伸及优化*

为了提高自组网的性能并满足多媒体数据传输等应用的需要,提出了一种基于AODV协议的QoS延伸及优化算法。该算法以AODV为基础,采用限制路由请求分组转发的机制并获取稳定的路由,并满足QoS约束条件。仿真实验结果表明,该算法降低了网络负载,减少了开销和提高了数据包传输成功率。     

Interior point methods for power flow optimization with security constraints

This paper deals with power flow optimization with security constraints, focusing on the problem of short‐term hydroelectric scheduling, called predispatch. Since the energy demand varies throughout the day, the generation must satisfy daily targets, established by long‐term scheduling models. This study considers that the hydroelectric plants and transmission systems must provide an optimal flow of energy under security constraints that allow meeting energy demands for normal operating conditions and when disturbances happen. Algebraic techniques are used to exploit the sparse structure of the problem, targeting the design of an interior point algorithm, efficient in terms of robustness and computational time. Case studies compare the proposed approach with a general purpose optimization solver for quadratic problems and an algorithm for the predispatch problem that does not consider security constraints. The results show the benefits of using the method proposed in the paper, obtaining optimal power flow that is suitable to consider contingencies, with numerical stability and appropriate computational time.