检索结果-内蒙古大学图书馆

High-performance hybrid genetic algorithm to solve transmission network expansion planning

IET GENERATION TRANSMISSION & DISTRIBUTION 2017年第5期11卷 1111-1118页

作者： Gallego, Luis A. Garces, Lina P. Rahmani, Mohsen Romero, Ruben A. Univ Estadual Londrina Dept Elect Engn Londrina Brazil Univ Fed Goias Elect Mech & Comp Engn Sch Goiania Go Brazil Carnegie Mellon Univ Engn & Publ Policy Dept Pittsburgh PA 15213 USA Univ Estadual Paulista Dept Elect Engn Ilha Solteira Brazil

In this study, a high-performance hybrid genetic algorithm (HGA) is proposed to solve static and multistage transmission network expansion planning (TNEP) problem. The main features of the HGA are: (i) it avoids homogenised solutions by using a special genetic algorithm as the backbone of the procedure, (ii) uses a powerful path-relinking algorithm for the deep exploration of local solutions, (iii) employs an efficient constructive heuristic algorithm for finding high-quality initial solutions and for improving solution qualities and (iv) uses a fast relaxation strategy for solving the linear programming problems required for calculating the fitness functions. This procedure will result in an intelligent exploration of a large search space in less amount of time. The proposed methodology is tested with three electrical systems: South Brazilian 46-bus, Colombian 93-bus and the North-Northeast Brazilian 87-bus.

关键词： power transmission planning genetic algorithms linear programming high-performance hybrid genetic algorithm transmission network expansion planning static transmission network expansion planning problem multistage TNEP problem high-performance HGA path-relinking algorithm constructive heuristic algorithm fast relaxation strategy linear programming problem fitness function South Brazilian 46-bus electrical system Colombian 93-bus electrical system North-Northeast Brazilian 87-bus electrical system

来源：评论

学校读者我要写书评

暂无评论

Simulation model for sizing of stand-alone solar PV system with interconnected array

引用

SOLAR ENERGY MATERIALS AND SOLAR CELLS 2005年第4期85卷 499-519页

作者： Kaushika, ND Gautam, NK Kaushik, K Bharti Vidyepeeth Coll Engn Sch Res & Dev New Delhi 110063 India

Solar PV arrays made of interconnected modules are comparatively less susceptible to shadow problem and power degradation resulting from the aging of solar cells. This paper presents a simulation model for the sizing of stand-alone solar PV systems with interconnected arrays. It considers the electricity generation in the array and its storage in the battery bank-serving the fluctuating load demand. The loss of power supply probability (LPSP) is used to connote the risk of not satisfying the load demand. The non-tracking (e.g.. fixed and tilted) and sin-le-axis tracking aperture arrays having cross-connected modules of single crystalline silicon solar cells in a (6 x 6) modular configuration are considered. The simulation results are illustrated with the help of a numerical example wherein the load demand is assumed to follow uniform probabilistic distribution. For a given load, the numbers of solar PV modules and batteries corresponding to zero values of LPSP on diurnal basis during the year round cycle of operation are presented. The results corresponding to the surplus and deficit of energy as a function of LPSP are also presented and discussed to assess the engineering design trade offs in the system components. Furthermore, a simple cost analysis has also been carried out, which indicates that for Delhi the stand-alone solar PV systems with fixed and tilted aperture arrays are better option than those with single-axis tracking aperture (with north-south oriented tracking axis) arrays. (C) 2004 Elsevier B.V. All rights reserved.

关键词： loss of power supply probability linear programming problem sizing stand-alone PV system interconnected arrays

来源：评论

学校读者我要写书评

暂无评论

Shape optimization of an airfoil in the presence of compressible and viscous flows

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2011年第1期50卷 147-162页

作者： Farhadinia, B. Univ Mohaghegh Ardabili Dept Math Ardebil Iran

The objective of this article is to present a step-by-step problem-solving procedure of shape optimization. The procedure is carried out to design an airfoil in the presence of compressible and viscous flows using a control theory approach based on measure theory. An optimal shape design (OSD) problem governed by full Navier-Stokes equations is given. Then, a weak variational form is derived from the linearized governing equations. During the procedure, because the measure theory (MT) approach is implemented using fixed geometry versus moving geometry, a proper bijective transformation is introduced. Finally, an approximating linear programming (LP) problem of the original shape optimization problem is obtained by means of MT approach that is not iterative and does not need any initial guess to proceed. Illustrative examples are provided to demonstrate efficiency of the proposed procedure.

关键词： Optimal shape design problem Full Navier-Stokes equations Measure theory linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Joint relay selection and power allocation for NOMA-based multicast cognitive radio networks

引用

IET COMMUNICATIONS 2020年第13期14卷 2027-2037页

作者： Baidas, Mohammed W. Alsusa, Emad Hamdi, Khairi A. Kuwait Univ Coll Engn & Petr Dept Elect Engn Kuwait Kuwait Univ Manchester Sch Elect & Elect Engn Manchester Lancs England

In this study, the problem of joint relay selection and power allocation (J-RS-PA) for NOMA-based multicast cognitive radio networks is considered. In particular, the aim is to simultaneously maximise the end-to-end SINR/SNR of the primary and secondary transmitter-receiver (TR) pairs, subject to quality-of-service (QoS) constraints. Communication between the primary and secondary TR pairs is performed over two-phases, namely, the broadcasting phase, and the cooperation phase. In the broadcasting phase, the primary and secondary transmitters broadcast their data symbols;while in the cooperation phase, the selected relay forwards the decoded symbols to their intended receivers. However, the formulated J-RS-PA problem happens to be non-convex, resulting in computationally-prohibitive complexity. Consequently, an optimal low-complexity two-stage relay selection and power allocation (TS-RS-PA) algorithm is devised, which is based on the solution of linear programming problem reformulations. Simulation results are presented to validate the proposed TS-RS-PA algorithm, which is shown to yield the optimal SINR/SNR values in comparison to the J-RS-PA scheme, but with lower computational complexity, while satisfying QoS constraints.

关键词： multicast communication linear programming quality of service cognitive radio computational complexity radio receivers radio transmitters concave programming cooperative communication multi-access systems relay networks (telecommunication) telecommunication power management joint relay selection and power allocation NOMA-based multicast cognitive radio networks quality-of-service constraints primary TR pairs secondary TR pairs broadcasting phase cooperation phase primary transmitters secondary transmitters J-RS-PA problem optimal low-complexity two-stage relay selection and power allocation algorithm TS-RS-PA algorithm end-to-end SINR maximisation end-to-end SNR maximisation QoS constraints nonconvex problem computationally-prohibitive complexity linear programming problem transmitter-receiver pairs

来源：评论

学校读者我要写书评

暂无评论

On Sufficient Optimality Conditions for a Guaranteed Control in the Speed problem for a linear Time-Varying Discrete-Time System with Bounded Control

引用

AUTOMATION AND REMOTE CONTROL 2021年第12期82卷 2076-2096页

作者： Ibragimov, D. N. Novozhilin, N. M. Portseva, E. Yu Moscow Inst Aviat Technol Moscow 125993 Russia

We consider the solution of the speed problem for linear time-varying discrete-time systems with convex control constraints. A method is proposed for reducing the general case of the speed problem to the case of linear control constraints using polyhedral approximation algorithms. Sufficient optimality conditions for the guaranteed solution are stated and proved. Examples are given. Based on the methods obtained, the speed-optimal damping problem for a high-rise structure located in a seismic activity zone is solved.

关键词： discrete-time control system speed problem optimal positional control linear programming problem controllability set convex polyhedron polyhedral approximation

来源：评论

学校读者我要写书评

暂无评论

Mega-Solar Optimal Allocation Using Data Envelopment Analysis

引用

ELECTRICAL ENGINEERING IN JAPAN 2013年第4期183卷 24-32页

作者： Yokota, Shinya Kumano, Teruhisa Meiji Univ Tokyo 101 Japan

In this paper, the optimal allocation of mega-solar is examined using data envelopment analysis (DEA). A great deal of attention is paid to photovoltaic power generation in Japan. Because such power generation can be freely used, it is attractive in Japan, which has few natural resources. The allocation of mega-solar, a large-scale photovoltaic power generation method, is an important problem for meeting the hope of efficient operation. We tried to apply DEA in Shizuoka Prefecture and to solve this issue. In this type of DEA application, some analyses often result in zero weighting factors in the parameters of some items to be studied, which implies that the corresponding items are not appropriately evaluated. The existing studies do not give special consideration to this situation. In this study, a new calculation scheme is proposed, the above-stated problems are successfully resolved, and the optimal candidate sites have been selected for the mega-solar allocation. (C) 2013 Wiley Periodicals, Inc. Electr Eng Jpn, 183(4): 24-32, 2013;Published online in Wiley Online Library (***). DOI 10.1002/eej.22322

关键词： data envelopment analysis (DEA) mega-solar location optimization linear programming problem decision-making unit sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

V-bar and R-bar Glideslope Guidance Algorithms for Fixed-Time Rendezvous: A linear programming Approach

引用

IFAC-PapersOnLine 2016年第17期49卷 385-390页

作者： Ariba, Yassine Arzelier, Denis Urbina, Laura Sofia Louembet, Christophe ICAM 75 avenue de Grande Bretagne Toulouse31300 France CNRS LAAS Univ de Toulouse 7 avenue du colonel Roche ToulouseF-31400 France CNRS LAAS Univ de Toulouse UPS 7 avenue du colonel Roche ToulouseF-31400 France

This paper presents minimum-fuel glideslope autonomous guidance algorithms for approaching a target evolving on a circular orbit. In the context of a chemical propulsion, the classical multipulse glideslope algorithm of Hablani is revisited and it is shown that when considering specific common directions for the glideslope such as V-bar and R-bar directions, a linear formulation of the circular minimum-fuel linearized rendezvous problem may be deduced. Unlike the classical glideslope algorithm for which there is no direct control on the fuel consumption, additional degrees of freedom and relevant decision variables may be identified by combining an analytical expression for the maximal guidance error and Hill-Clohessy-Wiltshire relative equations of motion. For a fixed-time rendezvous with a pre-assigned number of maneuvers, a fuel-optimal solution with a bounded guidance error is obtained by solving a linear programming problem. Numerical examples demonstrate the usefulness of the approach with respect to the classical ones when the approach corridor has to fulfill stringent geometrical restrictions such as line-of-sight constraints. © 2016

关键词： Air navigation Degrees of freedom (mechanics) Equations of motion Fuels linear programming Analytical expressions Chemical propulsion circular rendezvous Glideslope Hill Clohessy Wiltshire equations Impulsive controls Line of sight constraints linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Generalized Newton Method for linear Optimization problems with Inequality Constraints

引用

PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS 2014年第1-Sup期284卷 S96-S107页

作者： Golikov, A. I. Evtushenko, Yu G. Russian Acad Sci Dorodnitsyn Comp Ctr Moscow 119333 Russia

A dual problem of linear programming is reduced to the unconstrained maximization of a concave piecewise quadratic function for sufficiently large values of a certain parameter. An estimate is given for the threshold value of the parameter starting from which the projection of a given point to the set of solutions of the dual linear programming problem in dual and auxiliary variables is easily found by means of a single solution of the unconstrained maximization problem. The unconstrained maximization is carried out by the generalized Newton method, which is globally convergent in an a finite number of steps. The results of numerical experiments are presented for randomly generated large-scale linear programming problems.

关键词： linear programming problem piecewise quadratic function unconstrained maximization generalized Newton method

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Control Strategy for Maximising Power Conversion in Heaving Wave Energy Converters

引用

IFAC-PapersOnLine 2017年第1期50卷 14711-14716页

作者： Wahyudie, Addy Saeed, Omsalama Jama, Mohammed Electrical Engineering Department United Arab Emirates University F1 Building PO Box 15551 United Arab Emirates

This paper considers hierarchical control strategy (HCS) for maximising power conversion between mechanical and electrical powers in heaving wave energy converters. The maximisation conversion were obtained by designing the optimum reference for the buoy This reference were found by relating the mechanical and electrical models of the power-takeoff (PTO) device. A simple look-up table of the intrinsic resistance constant was obtained as function of wave's significant height and peak frequency. A Robust PID controller was used to track this reference. The PID controller was tuned using complex polynomial stabilisation method to convert the robust performance specification into a set of linear programming problem. The interesting feature of the method is all (not only one) set of PID parameters, which satisfies the robust performance, were found. Finally, the simulation results were presented to verify the control objectives. © 2017

关键词： Wave energy conversion Control engineering Controllers Electric control equipment linear control systems linear programming Power takeoffs Proportional control systems Robust control Table lookup Three term control systems Wave power Complex polynomials Hierarchical control strategies Intrinsic resistance linear programming problem Mechanical and electrical Ocean energy PID controllers Wave energy converters

来源：评论

学校读者我要写书评

暂无评论

Modifications of the Two-Stage Transportation problem and Their Applications

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2022年第6期58卷 898-913页

作者： Stetsyuk, P., I Stovba, V. O. Tregubenko, S. S. Khomiak, O. M. Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine Cent Sci Res Inst Armed Forces Ukraine Kiev Ukraine

Mathematical models of linear and Boolean linear programming for the balanced two-stage transportation problem and its two modifications are analyzed. The first modification takes into account the upper limits on the capacity of intermediate points, and the second modification allows choosing a fixed number of intermediate points, less than their total number. For all the cases, the necessary and sufficient conditions for the consistency of the systems of linear constraints of the corresponding mathematical programming problems are justified. Examples of applying the modifications for the optimal set partitioning, the p-median graph problem, and the problem of optimal arrangement of a given number of storages are considered. The results of the computing experiments using the Gurobi and CPLEX solvers and the AMPL modeling language are presented.

关键词： two-stage transportation problem linear programming problem Boolean linear programming problem AMPL Gurobi CPLEX optimal set partition p-median k-means material and technical support

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：