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

Load Control Problems in Direct Current Distribution Networks: Optimality, Equilibrium of Games

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2020年第2期28卷 347-360页

作者： Zou, Suli Ma, Zhongjing Liu, Shan BIT Sch Automat Beijing 100081 Peoples R China BIT Natl Key Lab Complex Syst Intelligent Control & D Beijing 100081 Peoples R China

Due to the promising development of direct current (dc) distribution networks, we focus on the demand-side management (DSM) problems which aim at the minimization of operational costs in dc distribution networks. Based on the established voltage model of power electronic loads, we formulate a DSM optimization problem that coordinates the bus voltage by minimizing the system cost, and the underlying optimization problem is nonconvex. In order to solve this nonconvex problem, we first reformulate it as a difference of convex programming problem, and then propose a novel algorithm based on branch and bound to implement the optimal solution. It is shown that the system is guaranteed to converge to the global optimum under the proposed method. As demonstrated with numerical examples, we analyze the convergence and global optimality of the proposed method, and discuss the computational complexity and scalability with respect to the size of distribution networks. Moreover, in case each of individual loads can make its own decisions by itself, the underlying optimization problem is implemented in the context of the noncooperative game. The existence of the Nash equilibrium is verified and demonstrated through simulation results.

关键词： Optimization Games Load modeling Power electronics Resistance Programming Convergence branch and bound algorithm dc distribution networks demand-side management (DSM) global optimality Nash equilibrium (NE) nonconvex optimization power electronic loads (PELs)

来源：评论

学校读者我要写书评

暂无评论

Synthesis and Optimization of Pipelines for HW Implementations of Dataflow Programs

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2015年第10期34卷 1613-1626页

作者： Prihozhy, Anatoly Bezati, Endri Ab Rahman, Ab Al-Hadi Mattavelli, Marco Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland Ecole Polytech Fed Lausanne SCI STI MM CH-1015 Lausanne Switzerland Univ Teknol Malaysia DSIP Res Grp Johor Baharu 81310 Malaysia

This paper introduces a new methodology for pipeline synthesis with applications to data flow high-level system design. The pipeline synthesis is applied to dataflow programs whose operators are translated into graphs and dependencies relations that are then processed for the pipeline architecture optimization. For each pipeline-stage time, a minimal number of pipeline stages are first determined and then an optimal assignment of operators to stages is generated with the objective of minimizing the total pipeline register size. The obtained "optimal" pipeline schedule is automatically transformed back into a dataflow program that can be synthesized to efficient hardware implementations. Two new pipeline scheduling: "least cost search branch and bound" and a heuristic technique have been developed. The first algorithm yields global optimum solutions for middle size designs, whereas the second one generates close-to-optimal solutions for large designs. Experimental results on FPGA designs show that the total pipeline register size gain in a range up to 4.68x can be achieved. The new algorithms overcome the known downward and upward direction dataflow graph traversal algorithms concerning the amount of pipeline register size by up to 100% on average.

关键词： branch and bound algorithm data flow hardware design heuristic algorithm high-level synthesis optimization pipeline

来源：评论

学校读者我要写书评

暂无评论

Spacecraft trajectory planning with avoidance constraints using mixed-integer linear programming

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2002年第4期25卷 755-764页

作者： Richards, A Schouwenaars, T How, JP Feron, E MIT Space Syst Lab Cambridge MA 02139 USA MIT Informat & Decis Syst Lab Cambridge MA 02139 USA

A method tar finding fuel-optimal trajectories for spacecraft subjected to avoidance requirements is introduced. These include avoidance of collisions with obstacles or other vehicles and prevention of thruster plumes from one spacecraft impinging on another spacecraft. The necessary logical constraints for avoidance are appended to a fuel-optimizing linear program by including binary variables in the optimization. The resulting problem is a mixed-integer linear program (MILP) that can be solved using available software. The logical constraints can also be used to express the configuration requirements for maneuvers where only the final relative alignment of the vehicles is important and the assignment of spacecraft within the fleet is not specified. The collision avoidance, trajectory optimization, and fleet assignment problems can be combined into a single MILE to obtain the optimal solution for these maneuvers. The MILE problem formulation, including these various avoidance constraints, is presented, and then several examples of their application to spacecraft maneuvers, including reconfiguration of a satellite formation and close inspection of the International Space Station by a microsatellite, are shown. These examples clearly show that the trajectory design methods presented are particularly well suited to proposed formation flying missions that involve multiple vehicles operating in close proximity.

关键词： Mixed Integer Linear Programming Monolithic Satellite ISS Trajectory Optimization Linear Programming Spacecraft Trajectories Spacecraft Maneuvers Thruster Plumes Path Planning branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

On Blade Arrangement for Multi-Blade Rotors

引用

WIND ENGINEERING 2011年第3期35卷 329-337页

作者： Hitz, K. L. Wood, D. H. Univ Newcastle Sch Engn Callaghan NSW 2308 Australia Univ Calgary Schulich Sch Engn Calgary AB Canada

This paper concerns the blades of multi-bladed water-pumping windmills when they have variable mass and centre of mass. The paper explores blade arrangement strategies that will minimize the eccentricity of the rotor centre of mass and hence any rotor-induced vibration. The number of blades in the rotor is assumed to equal the number made in each production batch, in contrast to the case where a batch of up to 22 blades was optimally matched to produce two-and three-bladed rotors, Hitz & Wood [1]. Using the measured mass and centre of mass of 24 blades for the rotor of a 26 ft Kijito windmill described by Harries [3], three strategies are considered. Random matching of the blades is shown to become increasingly effective as blade number increases. Pairing the blades by ordering in the product of mass and centre of mass, d, followed by random selection of pairs also produces rotors with low eccentricities. The numerical experiments show that the best strategy involving random selection is to pair by ordering, swapping the blades of every second pair, and then randomly arrange the resulting pairs. Finally, a heuristic based on blade pairing is shown to give eccentricities which are high compared to the minimum value determined exactly for 12 blades or less, but apparently low enough to be useful.

关键词： windmill blades multi-bladed rotor matching branch and bound algorithm blade arrangement

来源：评论

学校读者我要写书评

暂无评论

Minimizing the total weighted tardiness in wildfire suppression

引用

OPERATIONAL RESEARCH 2011年第1期11卷 113-120页

作者： Rachaniotis, Nikos P. Pappis, Costas P. Univ Piraeus Dept Ind Management Piraeus 18534 Greece

In scheduling fire fighting resource problems, increasing time is required to control a fire if the beginning of the containment effort is delayed. A fire has escaped initial attack if its containment time exceeds a specific '' containment escape time limit'', which can be calculated at its ignition time. These times can be considered as due dates. The problem of scheduling a single fire fighting resource when there are multiple forest fires to be suppressed is considered in this paper, in the case where the objective is to minimize the total weighted tardiness in wildfire suppression. A model of the problem is presented, one fast to calculate lower bound for the problem tackled is shown and a heuristic algorithm is used for the extraction of an upper bound of the solution.

关键词： Scheduling Deteriorating processing times Total weighted tardiness branch and bound algorithm Wildfire suppression

来源：评论

学校读者我要写书评

暂无评论

A reliable affine relaxation method for global optimization

引用

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2015年第3期13卷 247-277页

作者： Ninin, Jordan Messine, Frederic Hansen, Pierre ENSTA Bretagne LabSTICC IHSEV Team F-29806 Brest France ENSEEIHT IRIT F-31071 Toulouse France HEC Montreal Studies & Res Decis Anal Montreal PQ Canada Ecole Polytech LIX Palaiseau France

An automatic method for constructing linear relaxations of constrained global optimization problems is proposed. Such a construction is based on affine and interval arithmetics and uses operator overloading. These linear programs have exactly the same numbers of variables and inequality constraints as the given problems. Each equality constraint is replaced by two inequalities. This new procedure for computing reliable bounds and certificates of infeasibility is inserted into a classical branch and bound algorithm based on interval analysis. Extensive computation experiments were made on 74 problems from the COCONUT database with up to 24 variables or 17 constraints;61 of these were solved, and 30 of them for the first time, with a guaranteed upper bound on the relative error equal to . Moreover, this sample comprises 39 examples to which the GlobSol algorithm was recently applied finding reliable solutions in 32 cases. The proposed method allows solving 31 of these, and 5 more with a CPU-time not exceeding 2 min.

关键词： Affine arithmetic Interval analysis Linear relaxation branch and bound algorithm Global optimization

来源：评论

学校读者我要写书评

暂无评论

Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints

引用

MATHEMATICAL PROGRAMMING 2001年第2期89卷 233-250页

作者： Konno, H Wijayanayake, A Dept Ind Engn & Management Tokyo 152 Japan Tokyo Inst Technol Ctr Res Adv Financial Technol Tokyo 152 Japan

We will propose a branch and bound algorithm for calculating a globally optimal solution of a portfolio construction/rebalancing problem under concave transaction costs and minimal transaction unit constraints. We will employ the absolute deviation of the rate of return of the portfolio as the measure of risk and solve linear programming subproblems by introducing (piecewise) linear underestimating function for concave transaction cost functions. It will be shown by a series of numerical experiments that the algorithm can solve the problem of practical size in an efficient manner.

关键词： portfolio optimization concave transaction cost rebalancing minimal transaction unit branch and bound algorithm global optimization

来源：评论

学校读者我要写书评

暂无评论

Allocation of Static Var Compensator in Electric Power Systems Considering Different Load Levels

引用

JOURNAL OF CONTROL AUTOMATION AND ELECTRICAL SYSTEMS 2019年第1期30卷 1-8页

作者： Belati, Edmarcio A. Nascimento, Claudionor F. de Faria, Haroldo, Jr. Watanabe, Edson H. Padilha-Feltrin, Antonio Univ Fed ABC CECS UFABC Ave Estados 5001 BR-09210580 Santo Andre SP Brazil Univ Fed Sao Carlos UFSCar CCET Rod Washington Luis Km 235CP 676 BR-13565905 Sao Carlos SP Brazil Univ Fed Rio de Janeiro COPPE CT Bloco H-321CP 68504 BR-21941972 Rio de Janeiro RI Brazil

This paper proposes an approach to determine the optimal location of static var compensators (SVCs) in electric power systems in order to improve voltage profile and minimize active power losses. A multi-scenario framework that includes different load levels with different time periods is considered in this approach. The problem is formulated as a mixed-integer nonlinear programming problem using an optimal power flow (OPF). The SVC value and location are modeled as a variable susceptance inside the bus admittance matrix and as a binary decision variable, respectively. The problem is solved using the branch and bound algorithm associated with the OPF. Studies and simulations were conducted on the IEEE 118-bus test system considering variations in both the objective function and the amount of SVCs to be allocated. Analysis of results demonstrate that the performance of the power system can be effectively enhanced due to the optimal allocation of SVC equipment if considering different load levels with different time periods for the allocation of SVCs, rather than allocate the SVCs separately.

关键词： branch and bound algorithm Flexible alternating current transmission systems Optimal power flow Static var compensator

来源：评论

学校读者我要写书评

暂无评论

algorithms with Restrictive Input Constrains on Genome Exemplar Distance Caculation

Algorithms with Restrictive Input Constrains on Genome Exemp...

引用

International Conference on Business, Economics, and Financial Sciences, Management (BEFM 2011)

作者： Chen, Yehong Zhu, Daming Tang, Weifang Chen, Qi Zhang, Jie Shandong Polytech Univ Informat Sch Jinan Shandong Peoples R China Shandong Univ Comp Sci & Technol Inst Jinan Shandong Peoples R China

ISBN: (纸本)9783642279652

The comparative study of gene order rearrangements has been restricted to the case when the genes in one genome are homologous to at most one gene in the other genome. Sankoff (1999) proposes the estimation of true exemplars, a selection of one gene from each gene family in both genomes such that the distance between the resulting exemplar strings is minimized, which is called exemplar distance. David Bryant in his paper show that the calculation of the exemplar distance between two genomes is NP-hard for both the signed reversals distance and the breakpoint distance, even with quite restrictive conditions on the input. Limite the input according to strictive conditions used by David Bryants' proof, here we provides two algorithm to solve problem under some input conditions, one is branch and bound algorithms. the other is Greedy algorithm for both distances. different DATA can use different algorithm to get better performance.

关键词： Exemplar Distance NP-HARD branch and bound algorithm Greedy algorithm vertex cover problem Set cover

来源：评论

学校读者我要写书评

暂无评论

An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

引用

OR SPEKTRUM 1998年第1期20卷 47-53页

作者： Horst, R Thoai, NV Univ Trier Dept Math D-54286 Trier Germany

Formulating the minimum concave cost capacitated network flow problem as an integer concave minimization problem, we establish finite branch and bound algorithms, in which the branching operation is the so-called integral rectangular partition and the bounding procedure is performed by the classical minimum linear cost flow problem on subnetworks. For the special case that the flow cost function is concave on a fixed number of arcs and linear on the others, an upper bound of the running time is given.

关键词： minimum cost network flow problem integer concave minimization problem branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：