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

Optimal design of three phase induction motors and their comparison with a typical industrial motor

COMPUTERS & ELECTRICAL ENGINEERING 2001年第2期27卷 133-144页

作者： Faiz, J Sharifian, MBB Univ Tabriz Fac Engn Dept Elect Engn Tabriz Iran Univ Tehran Fac Engn Dept Elect & Comp Engn Tehran Iran

Three optimally designed three-phase squirrel-cage induction motors are compared with an industrial (conventional) motor having the same ratings. The Hooke-Jeeves search routine is used for optimization and three objective functions, namely efficiency, efficiency-cost and cost, are considered. Comparison of the optimum designs with the initial and industrial design reveals that better than the proposed performance can be obtained by a simple optimization method. It is interesting to note that the industrial design satisfies some performance of the cost optimum design, and efficiency optimum design, of course with a lower efficiency. The most desirable variation of motor performance with line voltage and output power is due to the efficiency optimum design. (C) 2000 Elsevier Science Ltd. All rights reserved.

关键词： design optimization squirrel-cage induction motor objective functions

来源：评论

学校读者我要写书评

暂无评论

SET COVERING BY SINGLE-BRANCH ENUMERATION WITH LINEAR-PROGRAMMING SUBPROBLEMS

引用

OPERATIONS RESEARCH 1971年第4期19卷 998-+页

作者： LEMKE, CE SALKIN, HM SPIELBERG, K

This paper presents an algorithm for the set-covering problem (that is, min c′y: Ey ≧ e, y ≧ 0, yi integer, where E is an m by n matrix of l's and 0's, and e is an m-vector of l's). The special problem ... 详细信息

This paper presents an algorithm for the set-covering problem (that is, min c′y: Ey ≧ e, y ≧ 0, y_i integer, where E is an m by n matrix of l's and 0's, and e is an m-vector of l's). The special problem structure permits a rather efficient, yet simple, solution procedure that is basically a (0, 1) search of the single-branch type coupled with linear programming and a suboptimization technique. The algorithm has been found to be highly effective for a good number of relatively large problems. Problems from 30 to 905 variables with as many as 200 rows have been solved in less than 16 minutes on an IBM 360 Model 50 computer. The algorithm's effectiveness stems from an efficient suboptimization procedure, which constructs excellent integer solutions from the solutions to linear-programming subproblems.

关键词： Algorithms Integers Linear programming Bookkeeping objective functions Variable costs Optimal solutions Information search Integer programming

来源：评论

学校读者我要写书评

暂无评论

Impact of FFC distributed generations in a DNR in the presence of renewable and load uncertainties by mixed-discrete particle swarm-based point estimation method

引用

IET RENEWABLE POWER GENERATION 2019年第9期13卷 1431-1445页

作者： Barik, Soumyabrata Das, Debapriya Indian Inst Technol Kharagpur Elect Engn Dept Kharagpur W Bengal India

This study presents the uncertainty analysis of a distribution network (DNR) caused by unit power output control (UPC) distributed generations (DGs) (solar, wind) and load demand by point estimate method (PEM) based on mixed-discrete-based particle swarm optimisation (MDPSO) technique. The uncertainties are taken care by the feeder flow control (FFC) DGs which make the DNR power independent of the main grid, which means the DNR does not exchange any power with the main grid at any load level. To analyse the situation, the load flow technique is modified with introducing $PQV\delta $PQV delta and zero bus in the system. $2m + 1$2m+1 and the higher-order PEM methods are applied in this study for uncertainty analysis. The FFC and the UPC DGs are placed and sized by the MDPSO algorithm. The uncertainty analysis of the system is done based on different objective functions and test cases which are the combinations of active power loss, voltage deviation, and the DG operation cost. The proposed method is applied to the 69-bus DNR, and the results are compared with teaching learning-based meta-heuristic optimisation method. The cumulative distribution function and probability density function of the output random variable are approximate with Gram-Charlier expansion method.

关键词： distributed power generation particle swarm optimisation probability load flow control power distribution control mixed-discrete particle swarm-based point estimation method uncertainty analysis distribution network unit power output control DGs load demand point estimate method mixed-discrete-based particle swarm optimisation technique feeder flow control DGs DNR power main grid load level load flow technique higher-order PEM methods UPC DGs active power loss 69-bus DNR teaching learning-based meta-heuristic optimisation method cumulative distribution function probability density function Gram-Charlier expansion method renewable uncertainties objective functions FFC distributed generations load uncertainties MDPSO technique

来源：评论

学校读者我要写书评

暂无评论

The Adaptive Knapsack Problem with Stochastic Rewards

引用

OPERATIONS RESEARCH 2011年第1期59卷 242-248页

作者： Ilhan, Taylan Iravani, Seyed M. R. Daskin, Mark S. Northwestern Univ Dept Ind Engn & Management Sci Evanston IL 60208 USA Univ Michigan Dept Ind & Operat Engn Ann Arbor MI 48109 USA

Given a set of items with associated deterministic weights and random rewards, the adaptive stochastic knapsack problem (adaptive SKP) maximizes the probability of reaching a predetermined target reward level when items are inserted sequentially into a capacitated knapsack before the reward of each item is realized. This model arises in resource allocation problems that permit or require sequential allocation decisions in a probabilistic setting. One particular application is in obsolescence inventory management. In this paper, the adaptive SKP is formulated as a dynamic programming (DP) problem for discrete random rewards. The paper also presents a heuristic that mixes adaptive and static policies to overcome the "curse of dimensionality" in the DP. The proposed heuristic is extended to problems with normally distributed random rewards. The heuristic can solve large problems quickly, and its solution always outperforms a static policy. The numerical study indicates that a near-optimal solution can be obtained by using an algorithm with limited look-ahead capabilities.

关键词： Heuristics objective functions Algorithms Optimal solutions Dynamic programming Determinism Business audits Approximation Gaussian distributions Histograms

来源：评论

学校读者我要写书评

暂无评论

LARGE-SCALE NONLINEAR NETWORK MODELS AND THEIR APPLICATION

引用

OPERATIONS RESEARCH 1989年第3期37卷 353-372页

作者： DEMBO, RS MULVEY, JM ZENIOS, SA PRINCETON UNIV ENGN & MANAGEMENT SYST PROGRAMPRINCETONNJ 08544 UNIV PENN WHARTON SCHPHILADELPHIAPA 19104

Nonlinear network applications arise in a variety of contexts: hydroelectric power system scheduling, financial planning, matrix estimation, air traffic control, and so on. This paper reviews applications of network optimization models with nonlinear objectives and, possibly, generalized arcs. Particular emphasis is placed on large-scale implementations. Specialized nonlinear network programming software is typically an order of magnitude faster than general purpose codes. [ABSTRACT FROM AUTHOR]

关键词： Algorithms Computer software Network optimization objective functions Economic models Financial portfolios Scheduling Hydroelectric power Modeling

来源：评论

学校读者我要写书评

暂无评论

COMMON TERMINAL MULTICOMMODITY FLOW WITH A CONCAVE objective FUNCTION: 收藏
分享
引用; SIAM JOURNAL ON APPLIED MATHEMATICS 1970年第2期18卷 489-&页; 作者： ROTHFARB, B FRISCH, IT; We consider graphs in which there are n source nodes, each a source of a different commodity, and a common terminal node. Associated with each commodity is a nonincreasing function αi(<span class="mo" id... 详细信息; We consider graphs in which there are n source nodes, each a source of a different commodity, and a common terminal node. Associated with each commodity is a nonincreasing function $α_{i} (.), i = 1, \dots, n$; 来源：评论; 学校读者我要写书评

暂无评论

STOCHASTIC PROGRAMS WITH INCOMPLETE INFORMATION

引用

OPERATIONS RESEARCH 1976年第2期24卷 336-347页

作者： BENTAL, A HOCHMAN, E UNIV TEXAS AUSTINTX 78712 TEL AVIV UNIV TEL AVIVISRAEL

This paper treats a simple recourse problem. We consider the problem of reducing the feasible set into a smaller efficient set when partial information about the random parameters is known. We analyze some examples an... 详细信息

关键词： Random variables Inventories Distribution functions objective functions

来源：评论

学校读者我要写书评

暂无评论

Computing moments of the exit time distribution for Markov processes by linear programming

引用

OPERATIONS RESEARCH 2001年第4期49卷 516-530页

作者： Helmes, K Röhl, S Humboldt Univ Inst Operat Res Berlin Germany Konrad Zuse Zentrum Informationstechn Berlin Berlin Germany Univ Kentucky Dept Stat Lexington KY 40506 USA

We provide a new approach to the numerical computation of moments of the exit time distribution of Markov processes. The method relies on a linear programming formulation of a process exiting from a bounded domain. The LP formulation characterizes the evolution of the process through the moments of the induced occupation measure and naturally provides upper and lower bounds for the exact values of the moments. The conditions the moments have to satisfy are derived directly from the generator of the Markov process and are not based on some approximation of the process. Excellent software is readily available because the computations involve finite dimensional linear programs.

关键词： Mathematical moments Brownian motion Adjoints Linear programming Markov processes Poisson process Interest rates Martingales Algorithms objective functions

来源：评论

学校读者我要写书评

暂无评论

APPROXIMATION AND COMPLEMENTARY GEOMETRIC PROGRAMMING

引用

SIAM JOURNAL ON APPLIED MATHEMATICS 1972年第4期23卷 527-531页

作者： MORRIS, AJ ROY AIRCRAFT ESTAB STRUCT DEPTFARNBOROUGHHAMPSHIREENGLAND

The note shows that a system for condensing posynomials with more than one term into single-termed posynomials, proposed recently by Avriel and Williams, is a special case of an approximation technique originally put forward by Dufhn, Peterson and Zener. It is also shown that the latter approximation scheme has a more general application and the difference between the two is demostrated by a small example.

关键词： Geometric programming Approximation objective functions Mathematical theorems Coefficients Real numbers

来源：评论

学校读者我要写书评

暂无评论

Trajectory optimisation in electrical discharge machining of three-dimensional curved and twisted channels

引用

Chinese Journal of Aeronautics 2022年第4期35卷 473-484页

作者： Jianshe ZHAO Yicong QIU Jian YUAN Chao LIU College of Mechanical and Electrical Engineering Nanjing University of Aeronautics and AstronauticsNanjing 210016China Laboratory of Integrated Electrical Processing Nanjing HANGPU Machinery Technology Company LimitedNanjing 210000China Military Representative Bureau of the Air Force Equipment Department in Shanghai and Military Representative Office in Zhuzhou Region Zhuzhou 412002China AECC South Industry Company Limited Zhuzhou 412002China

Numerical control electrical discharge machining(NC EDM) is one of the most widely used machining technologies for manufacturing a closed blisk flow path, particularly for three-dimensional(3D) curved and twisted flow channels. In this process, tool electrode design and machining trajectory planning are the key factors affecting machining accessibility and efficiency. Herein, to reduce the difficulty in designing the electrode and its motion path in the closed curved and twisted channels, a heuristic search hybrid optimisation strategy based on channel grids is adopted to realise the initial electrode trajectory design search and optimised size reduction. By transferring the trajectory optimisation constraints from the complex free-form surface to numbered grids, the search is found to be more orderly and accurate. The two trajectory indicators, namely argument angle and minimum distance, are analysed separately for the optimised results of the adaptive learning particle swarm optimisation algorithm, demonstrating that they can meet the actual processing *** results of NC EDM indicate that the motion path generated by this design method can meet the machining requirements of 3D curved and twisted flow channels.

关键词： Blisk Electrical discharge machining(EDM) Electrode objective functions Trajectory generation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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