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

2010 IEEE PES Transmission and Distribution Conference and Exposition - Smart Solutions for a Changing World

作者： Vural, A. M. Bayindir, K. C. Atilim Univ Dept Elect & Elect Engn TR-06836 Ankara Turkey Cukurova Univ Dept Elect & Elect Engn TR-01330 Adana Turkey

ISBN: (纸本)9781424465477

STATCOM controlled power system shows highly non-linear characteristics. In such a structure, linear controllers are easy to apply but difficult to tune. Fine tuning of controller parameters is necessary to meet transient performance requirements. In this paper, control system parameters of a STATCOM which is constructed from two six-pulse voltage source based converters are optimized by simplex algorithm which is a non-linear and non-gradient method. System objective function to be minimized is based on a performance index and expressed in terms of measured and desired values of system variables. After optimization, performance of STATCOM control system consisting of two PI controllers and two leag/lag compensators has been tested and verified through a number of simulation studies investigating step-response performance. Precise and quick responses have been observed with optimized parameters.

关键词： Static synchronous compensator STATCOM PI controller lead/lag compensator multi-parameter optimization simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

On the Number of Degenerate simplex Pivots 25th

On the Number of Degenerate Simplex Pivots

引用

25th International Conference on Integer Programming and Combinatorial Optimization (IPCO)

作者： Kukharenko, Kirill Sanita, Laura Otto von Guericke Univ Magdeburg Germany Bocconi Univ Milan Italy

ISBN: (纸本)9783031598340;9783031598357

The simplex algorithm is one of the most popular algorithms to solve linear programs (LPs). Starting at an extreme point solution of an LP, it performs a sequence of basis exchanges (called pivots) that allows one to move to a better extreme point along an improving edge-direction of the underlying polyhedron. A key issue in the simplex algorithm's performance is degeneracy, which may lead to a (potentially long) sequence of basis exchanges which do not change the current extreme point solution. In this paper, we prove that it is always possible to limit the number of consecutive degenerate pivots that the simplex algorithm performs to n - m - 1, where n is the number of variables and m is the number of equality constraints of a given LP in standard equality form.

关键词： simplex algorithm Linear Programming Degeneracy

来源：评论

学校读者我要写书评

暂无评论

Hybrid Immune PSO algorithm for Engineering Optimization Problems 12

Hybrid Immune PSO Algorithm for Engineering Optimization Pro...

引用

12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)

作者： Fan, Lilue Ouyang, Aijia Zunyi Normal Coll Dept Informat Engn Zunyi 563002 Guizhou Peoples R China Zunyi Normal Coll Dept Comp & Informat Sci Zunyi 563002 Guizhou Peoples R China

ISBN: (纸本)9781509040933

For its low efficiency in solving constrained optimization problems, the particle swarm optimization (PSO) is combined with immune algorithm (IA) in this paper. At the same time, an adaptive penalty function formula is designed to propose a hybrid immune PSO (HIPSO) algorithm for finding solution in constrained optimization problems. Through tests of 13 benchmark functions and three engineering optimization examples, it is clear that the performance of the HIPSO algorithm is equal to that of the HPSO algorithm. Whats more, the IA algorithm is not only better than IA algorithm and the PSO algorithm, but also co-evolutionary algorithm and other six kinds of algorithms.

关键词： Immune algorithm particle swarm optimization simplex algorithm hybrid algorithm constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Modern Optimization algorithms and Applications: Architectural Layout Generation and Parallel Linear Programming

Modern Optimization Algorithms and Applications: Architectur...

引用

作者： Bradley J. de Vlugt The University of Western Ontario

学位级别：硕士

This thesis examines two topics from the field of computational optimization; architectural layout generation and parallel linear programming. The first topic, a modern problem in heuris- tic optimization, focuses on deriving a general form of the optimization problem and solving it with the proposed Evolutionary Treemap algorithm. Tests of the algorithm's implementation within a highly scalable web application developed with Scala and the web service framework Play reveal the algorithm is effective at generated layouts in multiple styles. The second topic, a classical problem in operations research, focuses on methodologies for implementing the Sim- plex algorithm on a parallel computer for solving large-scale linear programming problems. Implementations of the algorithm's data-parallel and task parallel forms illuminate the ideal method for accelerating a solver. The proposed Multi-Path simplex algorithm shows an aver- age speed up of over two times that of a popular open-source solver, showing it is an effective methodology for solving linear programming problems.

关键词： Genetic algorithms Procedural Generation Architecture Treemap Linear Programming OpenCL simplex algorithm Parallel Computing

来源：评论

学校读者我要写书评

暂无评论

CUTTING STOCK PROBLEM BASED ON THE LINEAR PROGRAMMING APPROACH

CUTTING STOCK PROBLEM BASED ON THE LINEAR PROGRAMMING APPROA...

引用

作者： PHILIP DEBRAH Kwame Nkrumah University of Science and Technology

学位级别：硕士

This thesis considers the application of the Cutting Stock Problem based on the Linear Programming Approach. This is applied in the cutting of paper, glass, steel rod, wood etc. In this thesis, we apply a variant of it, the One-dimensional Cutting Stock Problem, to the cutting of wood in a sawmill. In a sawmill, boards are first cut along their width (rip) into strips, then the obtained strips are cut along their length (strip cut) into cut-pieces with specific length and demand. The thesis focuses on using simplex algorithm to find optimal cutting patterns. In the simplex algorithm, to determine the entering column (pattern), we solve sub-problem. The sub-problem is of a knapsack type and we solve it using dynamic programming. We develop a computer program based on the above approach to generate optimal cutting patterns.

关键词： One-dimensional Cutting Stock Problem Linear programming knapsack problem simplex algorithm dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A Note on the Distribution of the Number of simplex Iterations to Optimality

引用

JOURNAL OF STATISTICAL THEORY AND PRACTICE 2008年第1期2卷 15-19页

作者： Kim, S. Switkes, J. Calif State Polytech Univ Pomona Dept Math & Stat Pomona CA 91768 USA

In this note, we present a simulation exploring the distribution of the number of simplex iterations required to obtain the optimal solution of a randomly-generated linear programming problem of a given size and type. We use a Chi-square goodness-of-fit test to show that the distribution appears to be well-fit by a gamma distribution.

关键词： simplex algorithm Gamma distribution Maximum likelihood estimator Chi-square test

来源：评论

学校读者我要写书评

暂无评论

Rudder roll stabilization based on sliding mode variable structure control research 34

Rudder roll stabilization based on sliding mode variable str...

引用

34th Chinese Control Conference, CCC 2015

作者： Peng, Xiuyan Jincai, Hu Sun, Tao College of Automation Harbin Engineering University Harbin China

ISBN: (纸本)9789881563897

Sliding mode variable structure controller design is mostly based on pole assignment principle to select the sliding mode surface, however, because of the selection of the poles are based on single parameter and experience, so that the design of sliding mode surface is not the most reasonable. This paper use the simplex algorithm to optimize design the sliding mode plane function and put forward the Integral Performance Index, which is based on the principle of pole assignment. This method make the switching function of sliding surface is more reasonable and ideal, which is used for controlling rudder roll stabilization, roll reduction rate can reach 43%. It is better than only based on pole assignment to select sliding mode surface. © 2015 Technical Committee on Control Theory, Chinese Association of Automation.

关键词： Integral Performance Index Rudder roll stabilization simplex algorithm Sliding mode surface optimize design

来源：评论

学校读者我要写书评

暂无评论

Automatic Grade and Quad Crossing Safety and Delay Optimization in Addis Ababa LRT

Automatic Grade and Quad Crossing Safety and Delay Optimizat...

引用

作者： Kibrom Kidanu Addis Ababa University

学位级别：硕士

The implementation of Light Rail Transit System (LRTS) as an integrated form of public transportation, with the rail corridor running through city centers and connecting major commercial centers, presents interference with other modes of transportation especially road transport. So at the intersection of the two modes of transport safety becomes the critical issue. This thesis presents new ideas in developing a system which minimizes the risk at level/quad crossing. So a radar based automatic and coordinated system has developed in this thesis to solve the obstacle detection mechanism in Addis Ababa Light Rail Transit al Level/Quad Crossing (LQC) which is not yet adopted on the line. After reviewing all the available technologies designed for minimizing risk at level/quad crossing here a radar based safety enhancing technology have been presented. Every specification of 122GHz radar system has been mathematically modeled and simulated. A coordination algorithm for both modes of transport have been developed so unwanted interference will be mitigated. Here the radar signal is considered as an actuator to control the train and traffic signaling system. In addition to this, an optimization equation for minimizing the risk and time delay; and maximizing track and road utilization have been developed and simulated. It shows as the time delay is reduced to 8.6136sec from 10.6706sec. A possible interfacing mechanism with the existed system of Addis Ababa Light Transit signaling system has been presented.

关键词： Level crossing Grade crossing Bi-signaling Time delay Quad Crossing Preemption train signaling optimization traffic light simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

Ibm :: 1620 :: General Program Library :: 10.1.002 Linear Programming Code for the Ibm 1620 with Card Input and Output

引用

2016年

Ibm :: 1620 :: General Program Library :: 10.1.002 Linear Programming Code for the Ibm 1620 with Card Input and Output by published by

关键词： algorithm changer console switch cost changer data depress depress release dual algorithm entered fixed point floating point general input library linear matrix output program record mark rhs changer set shadow price simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

Weak percolation on multiplex networks

引用

Physical Review E 2014年第4期89卷 042801-042801页

作者： Gareth J. Baxter Sergey N. Dorogovtsev José F. F. Mendes Davide Cellai Department of Physics & I3N University of Aveiro Portugal A. F. Ioffe Physico-Technical Institute 194021 St. Petersburg Russia MACSI Department of Mathematics and Statistics University of Limerick Ireland

Bootstrap percolation is a simple but nontrivial model. It has applications in many areas of science and has been explored on random networks for several decades. In single-layer (simplex) networks, it has been recently observed that bootstrap percolation, which is defined as an incremental process, can be seen as the opposite of pruning percolation, where nodes are removed according to a connectivity rule. Here we propose models of both bootstrap and pruning percolation for multiplex networks. We collectively refer to these two models with the concept of “weak” percolation, to distinguish them from the somewhat classical concept of ordinary (“strong”) percolation. While the two models coincide in simplex networks, we show that they decouple when considering multiplexes, giving rise to a wealth of critical phenomena. Our bootstrap model constitutes the simplest example of a contagion process on a multiplex network and has potential applications in critical infrastructure recovery and information security. Moreover, we show that our pruning percolation model may provide a way to diagnose missing layers in a multiplex network. Finally, our analytical approach allows us to calculate critical behavior and characterize critical clusters.

关键词： BOOTSTRAP theory (Nuclear physics) PERCOLATION (Statistical physics) MULTIPLEXING (Telecommunication) CLUSTER theory (Nuclear physics) INFORMATION storage & retrieval systems simplex algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：