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

IEEE International Conference on Smart Energy Grid Engineering (SEGE)

作者： Mojdehi, Mohammad Nikkhah Ghosh, Prasanta Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA

ISBN: (纸本)9781467379335

Electric Vehicle (EV) becoming a promising reactive power service provider because of its short response time with no battery degradation during this service. Also EV would allow efficient adjustment of power flows in response to frequent changes in loads. In this paper we present a novel structure to evaluate the reactive power service potential of EVs. We formulate a linear program to minimize the operating cost of an EV that includes the battery degradation cost, under a range of practical constraints. These constraints include owner's desired state of charges and limitation in the current ripple from the DC-link capacitor of the EV charger. The developed optimization framework yields EV's optimal charging/discharging and reactive power service (injection/absorption) schedules. We also introduce an algorithm capable of determining the estimated compensation for the EV owner under different market structure and when real time events force the DSO to ask for more reactive power than pre-scheduled amount.

关键词： cost reduction electric vehicles linear programming reactive power DC-link capacitor DSO EV charger current ripple energy usage minimization linear program operating cost minimization reactive power service Absorption Batteries Capacitors Degradation Mathematical model Optimization Reactive power Electric vehicles Reactive power linear programming dc-link capacitor current ripple digital storage oscilloscopes energy use Batteries COST REDUCTION Capacitors Mathematical Model absorption

来源：评论

学校读者我要写书评

暂无评论

Path-Finding Methods for linear programming Solving linear programs in (O)over-tilde(√rank) Iterations and Faster Algorithms for Maximum Flow 55

Path-Finding Methods for Linear Programming Solving Linear P...

引用

55th Annual IEEE Symposium on Foundations of Computer Science (FOCS)

作者： Lee, Yin Tat Sidford, Aaron MIT Dept Math Cambridge MA 02139 USA MIT Dept EECS Cambridge MA 02139 USA

ISBN: (纸本)9781479965175

In this paper, we present a new algorithm for solving linear programs that requires only (O) over tilde (root rank(A)L) iterations where A is the constraint matrix of a linear program with m constraints, n variables, and bit complexity L. Each iteration of our method consists of solving (O) over tilde (1) linear systems and additional nearly linear time computation. Our method improves upon the previous best iteration bounds by factor of (Omega) over tilde((m/rank (A)))(1/4)) for methods with polynomial time computable iterations and by (Omega) over tilde (m/rank (A)) 1/2) for methods which solve at most (O) over tilde (1) linear systems in each iteration each achieved over 20 years ago. Applying our techniques to the linear program formulation of maximum flow yields an (O) over tilde (vertical bar E vertical bar root vertical bar V vertical bar log(2) U) time algorithm for solving the maximum flow problem on directed graphs with vertical bar E vertical bar edges, vertical bar V vertical bar vertices, and capacity ratio U. This improves upon the previous fastest running time of O(vertical bar E vertical bar min{vertical bar E vertical bar(1/2), vertical bar V vertical bar(2/3)} log(vertical bar V vertical bar(2)/vertical bar E vertical bar) log(U)) achieved over 15 years ago by Goldberg and Rao and improves upon the previous best running times for solving dense directed unit capacity graphs of O(vertical bar E vertical bar min{vertical bar E vertical bar(1/2), vertical bar V vertical bar(2/3)}) achieved by Even and Tarjan over 35 years ago and a running time of O(vertical bar E vertical bar(10/7)) achieved recently by Madry.

关键词： linear program maximum flow interior point

来源：评论

学校读者我要写书评

暂无评论

USMC logistics resource allocation optimization tool

USMC logistics resource allocation optimization tool

引用

作者： Walker, Thomas G. US Naval Postgraduate School

学位级别：硕士

To support the U. S. Administration's announced rebalancing, or pivot, to the Asia-Pacific region, the U. S. Marine Corps is pushing its footprint beyond established logistics support locations. Yet, the Corps' ability to rapidly respond to primary missions, such as international military cooperation, humanitarian assistance, and defense of U. S. interests, must be maintained. This Marine diaspora from Okinawa, its current concentration, must consider the logistical vagaries of time, space, and expense. This thesis develops an optimization-based tool by which item- specific details are combined with theater logistical constraints to analyze present logistical performance and "what- if" capability for future troop redeployments within the region. The mathematical model is applied to optimally allocate Class IX repair parts for the Marine Corps across the Pacific theater. In particular, the combined relationship of Defense Logistics Agency and the Marine's intermediate level supply units is analyzed. The optimization model minimizes a logistical system cost of multiple priority demands from disparate locations. The model is flexible enough to allow any number of stock items, additional user locations, and supply nodes at operational and strategic levels. While the focus is the force rebalancing in the Pacific, the intent is a general tool that can support other theaters.

关键词： Marine Corps Inventory Management Logistics Supply Chain Management Modeling and Optimization linear program

来源：评论

学校读者我要写书评

暂无评论

Minimum Energy Multi-Objective Clustering Model for Wireless Sensor Networks

Minimum Energy Multi-Objective Clustering Model for Wireless...

引用

International Wireless Communications and Mobile Computing Conference

作者： Manel SOUISSI Aref MEDDEB National Engineering School of Tunis University of Tunis EL-Manar National Engineering School of Sousse University of Sousse

ISBN: (纸本)9781509003051

Wireless Sensor Networks (WSNs) constitute a very dynamic research area. The constraints related to deployment, topology, and energy motivates much of the research activities related to the WSNs. In a network of thousands of sensor nodes, routing management and data exchange are expensive in terms of energy consumption and storage capacity. In fact, a sensor needs to store a lot of information to perform data routing. A lot of researchers have proposed clustering to minimize energy consumption by cutting the network into groups and routing captured information at different hierarchical levels. Clustering has been deeply investigated for energy savings in the WSNs. It has also the advantage of being an alternative to address scalability problems. However, building and maintaining a cluster structure requires an additional cost compared to flat networks. In this paper, we address the problem of maximizing the network lifetime by means of cluster formation and by assigning sensor nodes to cluster heads. We propose a multi-objective model for clustering that guarantees an optimal selection of cluster heads among sensor nodes with the highest residual energy while simultaneously minimizing the intra cluster distance. The numerical results demonstrate the effectiveness of our model compared to existing ones.

关键词： Wireless sensor networks linear program Optimization Clustering Energy saving

来源：评论

学校读者我要写书评

暂无评论

DEAR: Delay and Energy Aware Routing In Wireless Sensor Networks

DEAR: Delay and Energy Aware Routing In Wireless Sensor Netw...

引用

International Wireless Communications and Mobile Computing Conference

作者： Manel SOUISSI Aref MEDDEB National Engineering School of Tunis University of Tunis EL-Manar Le BELVEDERE 1002 Tunis Tunisie National Engineering School of Sousse University of Sousse Route de Ceinture Sahloul 4054 Tunisie

ISBN: (纸本)9781509003051

One of the critical issues in a Wireless Sensor Network (WSN) is the design of a proper routing protocol. While the requirement of low latency and low-energy consumption is getting more and more importance in emerging applications, the WSN should be capable of fulfilling its mission in a timely manner and without loss of energy. In this paper, we focus on multi-hop flat routing. A mathematical model for Delay and Energy Aware Routing (DEAR) is proposed. Our model aims to build a trade-off between energy consumption and delay. The goal is to find out a route from all sensor nodes to the base station, which has a comparably lower overall distance, with fewer data forwards. We define a multi-objective function for simultaneously minimizing the distance and minimizing the delay in forwarding. To demonstrate the effectiveness of DEAR, we compare it with the LeeMoon (Lee and Moon Model), the MHRM (Minimum Hop Routing Model), and the MTEM (Minimum Transmission Energy Model). the numerical results show that our model outperforms those models in terms of latency and energy consumption.

关键词： Wireless sensor networks Routing Optimization linear program Energy Latency

来源：评论

学校读者我要写书评

暂无评论

Modelling metabolism of the diatom Phaeodactylum tricornutum

引用

BIOCHEMICAL SOCIETY TRANSACTIONS 2015年第6期43卷 1182-1186页

作者： Singh, Dipali Carlson, Ross Fell, David Poolman, Mark Montana State Univ Dept Chem & Biol Engn Bozeman MT 59717 USA Oxford Brookes Univ Dept Biol & Med Sci Oxford OX3 0BP England

Marine diatoms have potential as a biotechnological production platform, especially for lipid-derived products, including biofuels. Here we introduce some features of diatom metabolism, particularly with respect to photosynthesis, photorespiration and lipid synthesis and their differences relative to other photosynthetic eukaryotes. Since structural metabolic modelling of other photosynthetic organisms has been shown to be capable of representing their metabolic capabilities realistically, we briefly review the main approaches to this type of modelling. We then propose that genome-scale modelling of the diatom Phaeodactylum tricornutum, in response to varying light intensity, could uncover the novel aspects of the metabolic potential of this organism.

关键词： diatoms elementary modes flux balance analysis genome scale metabolic model linear program metabolic networks Phaeodactylum tricornutum

来源：评论

学校读者我要写书评

暂无评论

Energy and Cost Minimization of Bidirectional Frequency Regulation Service by EV Following FERC Order 755

Energy and Cost Minimization of Bidirectional Frequency Regu...

引用

IEEE Power and Energy Society General Meeting

作者： Mohammad Nikkhah Mojdehi Prasanta Ghosh Makan Fardad Dept. of Electrical Eng. and Computer Science Syracuse University

ISBN: (纸本)9781467380416

Increasing share of renewable energy sources in the electric sector, forces the system operators to include new resources for frequency regulations with fast ramping. Electric vehicles (EVs) with fast charging and short battery reaction time are becoming promising source for frequency regulations. Therefore, it is worthwhile to evaluate EV's abilities and associated cost to participate in the frequency regulation activity. In this paper, we first present a linear model of EV operating in charging/discharging mode and impact of battery degradation during these activities. We then define a cost function for EV operation and its minimization using linear programming. After calculating the optimal operating points of EV, a novel framework was developed to calculate optimal bidding components of EV, regulation capacity and energy cost function to participate in the regulation market. Simulation results show the efficiency of the developed linear model. Results also provide pathways for possible opportunities of revenue stream for the EV owner, by offering the regulation up/down services, without limiting the EV owners level of comfort.

关键词： Electric vehicle Frequency regulation linear program Battery degradation

来源：评论

学校读者我要写书评

暂无评论

A SYMMETRIC REDUCTION OF THE NT DIRECTION

引用

SIAM JOURNAL ON OPTIMIZATION 2014年第2期24卷 714-732页

作者： Jarre, Florian Hergenroeder, Chantal Univ Dusseldorf Math Inst D-40225 Dusseldorf Germany

A stable symmetrization of the linear systems arising in interior-point methods for solving linear programs is introduced. A comparison of the condition numbers of the resulting interior-point linear systems with other commonly used approaches indicates that the new approach may be best suitable for an iterative solution. It is shown that there is a natural generalization of this symmetrization to the Nesterov-Todd (NT) search direction for solving semidefinite programs. The generalization includes a novel pivoting strategy to minimize the norm of the right and side and heavily relies on the symmetry properties of the NT direction. The search directions generated by iterative solvers typically have fairly low relative accuracy. Nevertheless, in some preliminary numerical examples, a suitably adapted interior-point approach results in a rather small number of outer iterations.

关键词： linear program semidefinite program condition number quasi-minimal residual iteration interior-point algorithm

来源：评论

学校读者我要写书评

暂无评论

Robust Optimization of Dynamic Motorway Traffic via Ramp Metering

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2014年第3期15卷 1374-1380页

作者： Chow, Andy H. F. Li, Ying UCL Ctr Transport Studies London WC1E 6BT England

This paper presents a robust optimization model for motorway management. The optimization aims to minimize motorway delay via ramp metering with consideration of uncertainties in traffic demand and its characteristics. The robust optimization is formulated as a minimax problem and solved by a two-stage solution procedure. The performances of different control policies are illustrated through working examples with traffic data collected from the M25 motorway in the United Kingdom. Experiments reveal that the robust control provides reliable performance over a range of uncertain scenarios. Results also show that the proposed robust controller is particularly effective during transition periods when congestion has not yet fully developed.

关键词： Cell transmission model (CTM) linear program ramp metering robust optimization

来源：评论

学校读者我要写书评

暂无评论

Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2014年第12期91卷 2470-2482页

作者： Choi, Jiwoong Choi, In-Chan Korea Univ Grad Sch Informat Management & Secur Seoul South Korea Korea Univ Sch Ind Management Engn Seoul South Korea

Redundancy identification techniques play an important role in improving the solvability of a linear program. In this paper, we address the redundancy in multi-dimensional knapsack constraints by proposing a new redundancy identification method. The proposed method is based on the constraint intercepts of Paulraj, Chellappan, and Natesan [A heuristic approach for identification of redundant constraints in linear programming models, Int. J. Comput. Math. 83 (2006), pp. 675-683] and surrogate constraints. In it, feasibility problems are constructed in order to determine the redundancy of the constraints, and are solved by a heuristic algorithm, which is developed to check the redundancy fast. The results of computational experiments show that the proposed method may be used in a preprocessing stage in order to reduce the number of knapsack constraints.

关键词： redundancy linear program surrogate constraints knapsack constraints feasibility problems 65K05 90C08

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：