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

IEEE EUROCON

作者： Perica Ilak Slavko Krajcar Ivan Rajsl Marko Delimar Department of Energy and Power Systems University of Zagreb Faculty of Electrical Engineering and Computing

ISBN: (纸本)9781467322331

Water is scarce resource with uncertain availability. Hence finding an optimal production schedule for hydro producer is usually a complex task and it is necessary to carefully balance the timing of water use. This paper addresses the self-scheduling problem for a price-taker hydro producer. The goal is maximizing the profit of a hydro producer through participating in the day-ahead energy and ancillary service markets. The spinning reserve and regulation market are considered as ancillary service markets. The self-scheduling problem of hydro producer is formulated and solved as a mixed integer linear programming problem. Model is deterministic and three-dimensional relationship between the power produced, the water discharged, and the head of associated reservoir is accounted. Real hydropower system Vinodol is considered.

关键词： Hydroelectric producer Short-term planning Day-ahead auction market Ancillary services Head dependent power output mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Tight and compact MILP formulation of start-up and shut-down ramping in unit commitment

Tight and compact MILP formulation of start-up and shut-down...

引用

IEEE General Meeting Power& Energy Society

作者： Germán Morales-España Jesus M. Latorre Andres Ramos Electric Power Systems KTH Royal Institute of Technology Institute for Research in Technology (IIT) Universidad Pontificia Comillas

Summary form only given. This paper presents a mixed-integer linear programming (MILP) formulation of start-up (SU) and shut-down (SD) power trajectories of thermal units. Multiple SU power-trajectories and costs are modeled according to how long the unit has been offline. The proposed formulation significantly reduces the computational burden in comparison with others commonly found in the literature. This is because the formulation is 1) tighter, i.e., the relaxed solution is nearer to the optimal integer solution; and 2) more compact, i.e., it needs fewer constraints, variables and nonzero elements in the constraint matrix. For illustration, the self-unit commitment problem faced by a thermal unit is employed. We provide computational results comparing the proposed formulation with others found in the literature.

关键词： Decision support systems Power systems mixed integer linear programming Trajectory Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Specialized Genetic Algorithm to Solve the Electrical Distribution System Expansion Planning

Specialized Genetic Algorithm to Solve the Electrical Distri...

引用

IEEE Power and Energy Society General Meeting

作者： Vera Camargo Marina Lavorato Rubén Romero Department of Mathematics of Sinop Mato Grosso State University Sinop – MT Brazil Faculty of Engineering of Ilha Solteira Paulista State University Ilha Solteira - SP Brazil

ISBN: (纸本)9781479913022

A specialized genetic algorithm with a adaptation of Chu-Beasley algorithm is presented in this paper to solve the electrical distribution distribution system expansion planning (DSP) problem modeled by a mixed integer nonlinear programming problem. The specialized genetic algorithm proposed in this paper starting from a initial population where all elements have a radial topology found using a heuristic algorithm and after the selection and mutation operations must also go through a local improvement in order to make the proposed solution in a feasible solution, if necessary, with respect to operational constraints. The DSP problem presented in this paper consider the circuit construction/recondutoring for different types of conductors and the substation construct/reinforcement. To evaluate the quality of the proposed methodology were used three different test systems found in the literature, 23, 54 and 136 buses systems.

关键词： Distribution network planning genetic algorithm mixed integer nonlinear programming power systems optimization. power distribution planning Genetic Algorithm (GA) Electricity Distribution Systems system optimization expansion plan mixed integer linear programming power system expansion planning Feasible Solution

来源：评论

学校读者我要写书评

暂无评论

Optimal Branch Exchange for Feeder Reconfiguration in Distribution Networks

Optimal Branch Exchange for Feeder Reconfiguration in Distri...

引用

IEEE Annual Conference on Decision and Control

作者： Qiuyu Peng Steven H. Low Electrical Engineering Department California Institute of Technology Pasadena CA 91125 USA Computing and Mathematical Sciences and the Electrical Engineering Departments California Institute of Technology Pasadena CA 91125 USA

ISBN: (纸本)9781467357159

The feeder reconfiguration problem chooses the on/off status of the switches in a distribution network in order to minimize a certain cost such as power loss. It is a mixed integer nonlinear program and hence hard to solve. A popular heuristic search consists of repeated application of branch exchange, where some loads are transferred from one feeder to another feeder while maintaining the radial structure of the network, until no load transfer can further reduce the cost. Optimizing each branch exchange step is itself a mixed integer nonlinear program. In this paper we propose an efficient algorithm for optimizing a branch exchange step. It uses an AC power flow model and is based on the recently developed convex relaxation of optimal power flow. We provide a bound on the gap between the optimal cost and that of our solution. We prove that our algorithm is optimal when the voltage magnitudes are the same at all buses. We illustrate the effectiveness of our algorithm through the simulation of real-world distribution feeders.

关键词： branch exchange Power grids voltage magnitude Reconfiguration mixed integer linear programming Nonlinear programming optimal load flow Load transfer power loss efficient algorithm

来源：评论

学校读者我要写书评

暂无评论

A linear reformulation of Boolean optimization problems and structure identification of gene regulation networks

A linear reformulation of Boolean optimization problems and ...

引用

IEEE Annual Conference on Decision and Control

作者： Christian Breindl Madalena Chaves Frank Allgower Institute for Systems Theory and Automatic Control University of Stuttgart Pfaffenwaldring 9 70550 Stuttgart Germany BIOCORE INRIA 2004 Route des Lucioles BP 93 06902 Sophia Antipolis France

ISBN: (纸本)9781467357159

We consider the problem of estimating Boolean models of gene regulation networks from few and noisy measurements. To this end, we use a representation of Boolean functions as multi-affine polynomials, leading to a reformulation of the estimation problem as mixed integer linear program. We then show that the integer constraints can be omitted which improves existing results and reduces the required computing time drastically. Also certain properties of Boolean functions such as unateness or the canalizing property can be included in the linear formulation. The benefits of this reformulation are demonstrated with the help of a large Boolean model of the network of the segment polarity genes in Drosophila melanogaster.

关键词： Boolean functions Gene regulation mixed integer linear programming Drosophila melanogaster Network

来源：评论

学校读者我要写书评

暂无评论

Simultaneous design and scheduling of a semicontinuous/batch plant for ethanol and derivatives production

引用

COMPUTERS & CHEMICAL ENGINEERING 2012年第1期36卷 342-357页

作者： Fumero, Yanina Montagna, Jorge M. Corsano, Gabriela INGAR Inst Desarrollo & Diseno CONICET UTN Santa Fe Argentina Univ Tecnol Nacl Fac Reg Santa Fe CIDISI Santa Fe Argentina

The interest on renewable fuels has greatly increased in the last years. Particularly, ethanol production arises as a good solution to many current economic-environmental problems. Yeast production from the ethanol residuals constitutes a sustainable alternative. Usually, this kind of plants is designed using single product campaigns. However, since yeast degradation is fast and a continuous supply must be assured, the mixed product campaign policy is the most appropriate. Besides, a stable context can be assumed to justify this approach that takes advantage of the special structure of the plant. Therefore, in this paper, a mixed integer linear programming model is formulated for simultaneous design and scheduling of a semicontinuous/batch plant for ethanol and derivatives production. The optimal plant configuration, unit sizes, number of batches of each product in the campaign and its sequencing is obtained in order to fulfill the ethanol and yeast demands minimizing the investment cost. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Batch/semicontinuous plant design Scheduling Ethanol and yeast productions mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Sequential Dynamic Strategies for Real-Time Scheduling of Terminal Traffic

引用

JOURNAL OF AIRCRAFT 2012年第1期49卷 237-249页

作者： Chen, Heming Zhao, Yiyuan J. Univ Minnesota Minneapolis MN 55455 USA

This paper presents dynamic strategies for the integrated scheduling and runway assignment of both arrival and departure traffic over an airport. While a static scheduling scheme handles traffic over a specified planning horizon simultaneously, sequential dynamic schedulers divide the planning horizon into a series of smaller scheduling windows and apply a static scheduling scheme sequentially over each window. Dynamic scheduling strategies are desirable for obtaining real-time solutions of continual traffic streams and for taking advantage of updated traffic information. In this paper, a multiple-point scheduling framework is used in which scheduling locations include runway thresholds as well as fixes over the terminal airspace and gates on the airport surface. Integrated static scheduling of both arrival and departure traffic is formulated as mixed-integer linear programming. Solution variables include scheduled times of arrival at the multiple scheduling locations and aircraft sequences at merge points. Aircraft route assignments for both ground and airborne traffic are also included as discrete solution variables, from which optimal runway assignments can be determined. Then, different dynamic strategies with either overlapping or nonoverlapping scheduling windows are developed and compared. Induced constraints for ensuring sufficient separations among traffic in neighboring windows are discussed. The John F. Kennedy International Airport is used as the example in extensive numerical solutions to evaluate the computational speeds and scheduling performances of different dynamic strategies.

关键词： Runway Configuration John F. Kennedy International Airport Airspace mixed integer linear programming Estimated Time of Arrival Numerical Simulation Next Generation Air Transportation System Air Traffic Controller Aircraft Performance Aircraft Trajectory

来源：评论

学校读者我要写书评

暂无评论

Modelling of multi-period multi-product production planning considering production routes

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2012年第6期50卷 1749-1766页

作者： Mahdavi, Iraj Taghizadeh, Kaveh Bagherpour, Morteza Solimanpur, Maghsud Mazandaran Univ Sci & Technol Dept Ind Engn Babol Sar Iran Iran Univ Sci & Technol Dept Ind Engn Tehran Iran Urmia Univ Dept Mech Engn Orumiyeh West Azerbaijan Iran

The multi-period multi-product (MPMP) production planning problems, generally, deal with matching production levels of individual products with fluctuated demands over planning horizon. The conventional MPMP optimisation models suffer from insufficient utilisation of available capacity of machines. This fallacy is due to inappropriate formulation of machine capacity and material handling constraints. In this study, a novel mathematical model is proposed to simultaneously optimise production quantities and provide information about managerial decisions such as subcontracting, carrying inventory/backordering, and also hiring/layoff personnel. The problem is then formulated as a mixed integer linear programming (MILP) model by applying appropriate linearisation of non-linear components. The objective is to minimise production costs comprising of production, storage, shortage, subcontracting costs and costs associated with hiring/dismissing labourers. Superiority of the proposed model over existing ones, has been initially evaluated by solving the case presented by Byrne and Bakir [Byrne, M. D. and Bakir, M. A., 1999. Production planning using a hybrid simulation-analytical approach. International Journal of Production Economics, 59 (1), 305-311], and then evaluated by comparing the results obtained from solving both the proposed and the conventional MPMP production planning models using a 100-randomly-generated-test-problem.

关键词： multi-period multi-product production planning mixed integer linear programming aggregate production planning optimisation operational sequence

来源：评论

学校读者我要写书评

暂无评论

An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2012年第15期50卷 4237-4254页

作者： Shahvari, Omid Salmasi, Nasser Logendran, Rasaratnam Abbasi, Babak Sharif Univ Technol Dept Ind Engn Tehran Iran Mazandaran Univ Sci & Technol Dept Ind Engn Babol Sar Iran Oregon State Univ Sch Mech Ind & Mfg Engn Corvallis OR 97331 USA RMIT Univ Sch Math & Geospatial Sci Melbourne Vic Australia

In this paper, the flexible flow shop sequence-dependent group scheduling problem (FFSDGS) with minimisation of makespan as the criterion (FFm vertical bar fmls, S-plk vertical bar C-max) is investigated. For the first time a mathematical model for the proposed research problem is developed. Since the problem is shown to be NP-hard, six metaheuristic algorithms based on tabu search (TS) are developed to efficiently solve the problem. The proposed metaheuristics are different to the only available metaheuristic algorithm in the literature based on TS. By applying randomised complete block design and using available test problems in the literature, the best of the proposed TS algorithms in this research is identified. The performance of the best developed metaheuristic algorithm is then compared with the existing algorithm in the literature by solving the test problems, also available in the literature, ranging in size from small, medium, to large. A comparison based on paired t-test at 95% confidence interval, shows that the best proposed algorithm in this research has a better performance than the existing algorithm in the literature with an average percentage deviation of around 1.0% for medium and large size problems.

关键词： flexible flow shop sequence-dependent group scheduling tabu search mixed integer linear programming minimisation of makespan

来源：评论

学校读者我要写书评

暂无评论

An integral planning model that includes production, selling price, cash flow management and flexible capacity

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2012年第6期50卷 1568-1581页

作者： Lusa, Amaia Martinez-Costa, Carme Mas-Machuca, Marta Univ Politecn Cataluna IOC Res Inst Dept Management E-08028 Barcelona Spain

Many authors consider that production and marketing decisions should be integrated. In this paper, we discuss an aggregate planning problem that includes production, selling price, cash management and flexible capacity (by means of hiring and firing and with the possibility of unlimited production subcontracting). The demand is considered to be a nonlinear function of the product selling price. The problem, which is modelled as a mixed integer linear program, can be solved using standard optimisation software. The results of a computational experiment and a numerical example are shown to illustrate the performance of the proposed model and obtain some managerial insights.

关键词： integral planning aggregate planning marketing mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：