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

Contribution of FACTS devices in power systems security using MILP-based OPF

IET GENERATION TRANSMISSION & DISTRIBUTION 2018年第15期12卷 3744-3755页

作者： Nikoobakht, Ahmad Aghaei, Jamshid Parvania, Masood Sahraei-Ardakani, Mostafa Higher Educ Ctr Eghlid Dept Elect Engn Eghlid Iran Shiraz Univ Technol Dept Elect & Elect Engn Shiraz Iran Univ Utah Dept Elect & Comp Engn Salt Lake City UT 84112 USA

Traditionally, electric system operators have dispatched generation to minimise total production costs ignoring the flexibility of the AC transmission system (ACTS). One available option to enhance power system security is to harness the flexibility of the ACTS, where a variety of flexible AC transmission system (FACTS) devices can be incorporated in the ACTS. However, utilisation of FACTS devices is limited today due to the complexities that these devices introduce to the AC optimal power flow (ACOPF) problem. The mathematical representation of the full ACOPF problem, with the added modelling of FACTS devices, is a non-linear programming (NLP) optimisation problem, which is computationally burdensome for large-scale systems. This study presents a method to convert this NLP problem into a mixed-integer linear program (MILP) where a certain level of solution accuracy can be achieved for a time budget. In this regard, this study first proposes a linear AC OPF model, using which the OPF solution with the operation of FACTS devices is obtained. In addition, the loadability of the power systems is utilised to quantify the impacts of FACTS devices on improving the security of system. The OPF problem including FACTS devices based on a linearised model is tested on a 6-bus and the IEEE 118-bus test systems.

关键词： power system security flexible AC transmission systems nonlinear programming integer programming linear programming power generation dispatch FACTS devices power system security MILP-based OPF electric system operators generation dispatch total production cost minimization flexible AC transmission system AC optimal power flow problem mathematical representation nonlinear programming NLP optimisation problem mixed-integer linear program linear AC OPF model IEEE 118-bus test systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic resource scheduling of biomanufacturing projects

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2020年 147卷 106527-106527页

作者： Limon, Yasemin Krishnamurthy, Ananth Bilkent Univ Fac Business Adm Ankara Turkey Indian Inst Management Bangalore Decis Sci Bangalore Karnataka India

We consider the scheduling problem for biomanufacturing projects that involve multiple tasks and "no-wait" constraints between some of these tasks. The aim is to create schedules that ensure timely delivery of products while enabling schedule revisions to accommodate additional constraints realized during the execution of these projects. We formulate the problem as a mixed-integer linear programming model with the objective of minimizing total tardiness, and propose a dynamic scheduling approach that solves a series of modified mixed-integer linear programming models to revise and improve the schedule. We conduct numerical studies to investigate the performance of this approach and compare its performance to a traditional proactive scheduling approach. In collaboration with biomanufacturing companies, we create a scheduling tool and validate the approach with implementation in an industry setting.

关键词： Dynamic scheduling Biomanufacturing Protein manufacturing No-wait mixed-integer linear program

来源：评论

学校读者我要写书评

暂无评论

A mixed integer linear programming approach for optimal DER portfolio, sizing, and placement in multi-energy microgrids

引用

APPLIED ENERGY 2017年 187卷 154-168页

作者： Mashayekh, Salman Stadler, Michael Cardoso, Goncalo Heleno, Miguel Ernest Orlando Lawrence Berkeley Natl Lab 1 Cyclotron RdMS 90-1121 Berkeley CA 94720 USA

Optimal microgrid design is a challenging problem, especially for multi-energy microgrids with electricity, heating, and cooling loads as well as sources, and multiple energy carriers. To address this problem, this paper presents an optimization model formulated as a mixed-integer linear program, which determines the optimal technology portfolio, the optimal technology placement, and the associated optimal dispatch, in a microgrid with multiple energy types. The developed model uses a multi-node modeling approach (as opposed to an aggregate single-node approach) that includes electrical power flow and heat flow equations, and hence, offers the ability to perform optimal siting considering physical and operational constraints of electrical and heating/cooling networks. The new model is founded on the existing optimization model DER-CAM, a state-of-the-art decision support tool for microgrid planning and design. The results of a case study that compares single-node vs. multi-node optimal design for an example microgrid show the importance of multi-node modeling. It has been shown that single-node approaches are not only incapable of optimal DER placement, but may also result in sub-optimal DER portfolio, as well as underestimation of investment costs. Published by Elsevier Ltd.

关键词： Multi-energy microgrid design Power flow Electrical network Heating and cooling network mixed-integer linear program

来源：评论

学校读者我要写书评

暂无评论

DC programming approach for multicommodity network optimization problems with step increasing cost functions

引用

JOURNAL OF GLOBAL OPTIMIZATION 2002年第1-4期22卷 205-232页

作者： An, LTH Tao, PD Natl Inst Appl Sci Rouen Math Lab Modelling Appl Optimizat & Operat Res Grp F-76131 Mont St Aignan France

We address a class of particularly hard-to-solve combinatorial optimization problems, namely that of multicommodity network optimization when the link cost functions are discontinuous step increasing. Unlike usual approaches consisting in the development of relaxations for such problems (in an equivalent form of a large scale mixed integer linear programming problem) in order to derive lower bounds, our d.c.(difference of convex functions) approach deals with the original continuous version and provides upper bounds. More precisely we approximate step increasing functions as closely as desired by differences of polyhedral convex functions and then apply DCA (difference of convex function algorithm) to the resulting approximate polyhedral d.c. programs. Preliminary computational experiments are presented on a series of test problems with structures similar to those encountered in telecommunication networks. They show that the d.c. approach and DCA provide feasible multicommodity flows x(*) such that the relative differences between upper bounds (computed by DCA) and simple lower bounds r :=(f(x(*))-LB)/{f(x(*))} lies in the range [4.2 %, 16.5 %] with an average of 11.5 %, where f is the cost function of the problem and LB is a lower bound obtained by solving the linearized program (that is built from the original problem by replacing step increasing cost functions with simple affine minorizations). It seems that for the first time so good upper bounds have been obtained.

关键词： multicommodity network flows step increasing cost function capacity assignment problem flow assignment problem mixed-integer linear program d.c. (difference of convex functions) program polyhedral d.c. program relaxation techniques DCA (d.c. algorithm)

来源：评论

学校读者我要写书评

暂无评论

Global Search Metaheuristics for planning transportation of multiple petroleum products in a multi-pipeline system

引用

COMPUTERS & CHEMICAL ENGINEERING 2012年 37卷 248-261页

作者： Herran, A. de la Cruz, J. M. de Andres, B. Univ Complutense Dept Comp Sci Engn CES Felipe 2 Aranjuez 28300 Spain Univ Complutense Dept Comp Architecture & Automat Control Aranjuez 28040 Spain

The objective of this work is to develop several metaheuristic algorithms to improve the efficiency of the MILP algorithm used for planning transportation of multiple petroleum products in a multi-pipeline system. The problem involves planning the optimal sequence of products assigned to each new package pumped through each polyduct of the network in order to meet product demands at each destination node before the end of the planning horizon. All the proposed metaheuristics are combinations of improvement methods applied to solutions resulting from different construction heuristics. These improvements are performed by searching the neighborhoods generated around the current solution by different Global Search Metaheuristics: Multi-Start Search, Variable Neighborhood Search, Taboo Search and Simulated Annealing. Numerical examples are solved in order to show the performance of these metaheuristics against a standard commercial solver using MILP. Results demonstrate how these metaheuristics are able to reach better solutions in much lower computational time. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Multi-product pipeline network mixed-integer linear program Global Search Metaheuristics Taboo Search Simulated Annealing Multiple Markov Chain

来源：评论

学校读者我要写书评

暂无评论

A cyclic allocation model for the inventory-modulated capacitated location problem

引用

INFOR 2017年第4期55卷 312-338页

作者： Maass, Kayse Lee Daskin, Mark S. Univ Michigan Dept Ind & Operat Engn Ann Arbor MI 48109 USA

Hard capacity constraints have been used for decades in facility location modelling and planning. However, such constraints are unrealistic as a variety of operational tools can be used to extend capacity in the short term. To address this, the Inventory-Modulated Capacitated Location Problem (IMCLP) uses inventory as a method of mitigating the hard capacity constraints, but enforces single sourcing. In this paper, we examine a cyclic, day-specific allocation approach to assigning demand sites to processing facilities in the IMCLP. This enables the model to develop a day-of-the-week allocation policy that considers day-to-day variations in the daily processing capacity levels of a set of candidate processing facilities and/or systematic day-to-day demand variations. We demonstrate that allowing demands at a particular site to be allocated to multiple processing facilities in such a manner can be a cost-effective operational tool.

关键词： Location capacitated daily demands inventory backlog mixed-integer linear program

来源：评论

学校读者我要写书评

暂无评论

Integrated stochastic optimization approaches for tactical scheduling of trains and railway infrastructure maintenance

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2019年 127卷 1315-1335页

作者： D'Ariano, Andrea Meng, Lingyun Centulio, Gabriele Corman, Francesco Roma Tre Univ Dept Engn Via Vasca Navale 79 I-00146 Rome Italy Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing 100044 Peoples R China Delft Univ Technol Transport Engn & Logist Mekelweg 2 NL-2628 CD Delft Netherlands Swiss Fed Inst Technol Inst Transport Planning & Syst Stefano Franscini Pl 5 CH-8093 Zurich Switzerland

This work addresses a tactical railway traffic scheduling problem focused on the optimization of train sequencing and routing decisions and timing decisions related to short-term maintenance works in a railway network subject to disturbed process times. This is modeled as a mixed-integer linear programming formulation in which the traffic flow and track maintenance variables, constraints and objectives are integrated under a stochastic environment. The resulting bi-objective optimization problem is to minimize the deviation from a scheduled plan and to maximize the number of aggregated maintenance works under stochastic disturbances. The two objectives require to schedule competitive train operations versus maintenance works on the same infrastructure elements. Computational experiments are performed on a realistic railway network. We measure the quality of the integrated solutions in terms of their robustness to stochastic perturbations of the train travel times and of the maintenance works. Pareto optimal methods are compared for the bi-objective problem. We also evaluate the impact of introducing routing stability constraints in order to force the trains to keep the same route among the different stochastic disturbed scenarios. The experiments show that forcing the routing stability reduces the routing flexibility and the ability to optimize the two performance indicators when dealing with stochastic disturbances.

关键词： Railway traffic management Train scheduling Infrastructure maintenance Disturbance robustness Routing stability mixed-integer linear program

来源：评论

学校读者我要写书评

暂无评论

Scheduling of semi-automatic carousels with fixed production sequences

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2023年第4期61卷 1252-1267页

作者： Campana, Giampaolo Malaguti, Enrico Mele, Mattia Paronuzzi, Paolo Univ Bologna DIN Bologna Italy Univ Bologna DEI Guglielmo Marconi Bologna Italy

Rotary transfer machines are widely used in different industrial sectors. A rich literature concerning their design and optimisation is available, but mainly dedicated to integrated machining systems. This machine architecture is also implemented in the aluminium gravity die casting technology where the specificity of the casting process needs an appropriate design. In particular, the constraints related to processing times and the rigidity of the production sequence impose a specific approach to schedule the production for achieving an optimal cycle time. We approach this problem with an optimisation perspective: first we propose a mixed-integer linear programming formulation for defining the sequencing and scheduling of the machine in order to obtain a specified production with minimum makespan, and discuss strategies for enumerating the variables of the formulation. Second, we describe a heuristic algorithm as an alternative to the solution of the formulation through a general-purpose solver. Eventually, we present extensive computational experiments on a set of instances generated from real data, comparing these alternative approaches.

关键词： Rotary transfer machine gravity die casting scheduling flow-shop mixed-integer linear program heuristics

来源：评论

学校读者我要写书评

暂无评论

An Optimal Layout Pattern-Based Solution Approach to the Extended Machine Layout Problem With Multirow Multicolumn Structure

引用

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2023年第2期20卷 1408-1428页

作者： Qi, Mingyao Hao, Xinru Yuan, Meng Tsinghua Univ Shenzhen Int Grad Sch Div Logist & Transportat Shenzhen 518055 Peoples R China Alibaba Grp Hangzhou 311121 Peoples R China

The machine layout problem (MLP) is to determine the optimal location arrangement of machines in a production system, usually in order to minimize the total material transmission distance. This article considers a type of MLP in an automated manufacturing system with unequal-area machines, machine replicas, and taking multi-row multi-column layout structure. The aim is to determine the near-optimal machine layout and orbit layout simultaneously. We model the problem as a mixed-integer linear program by introducing the concept of orbit-based relative locations and using auxiliary binary variables, including relative location assignment variables, in-block relationship variables, and material routing variables. We further exploit the optimal layout patterns, based on which, when the relative locations of the machines and orbits are given, we can quickly derive the near-optimal absolute machine and orbit positions without solving a mixed-integer linear program. A two-layer hybrid heuristic method is proposed to solve the problem: the outer layer is a variable neighborhood search metaheuristic used to explore the solution space of the relative locations, while the inner layer is a recursive heuristic based on the optimal layout patterns. Experiments on instances of different sizes are conducted, and the effectiveness and efficiency of the proposed algorithms are verified. Note to Practitioners-Many manufacturing systems, for example, those in the semiconductor industry, use automated guided vehicles running on orbits to transfer materials between machines. The design of such a manufacturing system consists of determining the numbers of vertical and horizontal orbits, their positions, and the positions of all machines. It is not unusual for there to be hundreds of machines. Furthermore, machines of the same type can be deployed non-adjacently in an automated transfer context since materials can easily be transmitted to an arbitrary machine. The flexibility and complexity

关键词： Layout Orbits Manufacturing systems Power transmission lines Costs Production Metaheuristics Machine layout automated manufacturing orbits unequal area mixed-integer linear program recursive

来源：评论

学校读者我要写书评

暂无评论

Signal coordination models for long arterials and grid networks

引用

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2016年 71卷 215-230页

作者： Zhang, Lihui Song, Ziqi Tang, Xiaojun Wang, Dianhai Zhejiang Univ Inst Transportat Engn Hangzhou 310058 Zhejiang Peoples R China Utah State Univ Dept Civil & Environm Engn Logan UT 84322 USA Dalian Univ Technol Sch Transportat & Logist Dalian 116024 Peoples R China

This paper proposes two models to tackle traffic signal coordination problems for long arterials and grid networks. Both models, denoted as MaxBandLA and MaxBandGN, are built based on Little's bandwidth maximization model, and the resulting formulations are both small-sized mixed-integer linear programs. Model MaxBandLA can optimize arterial partition plan and signal coordination plans of all the subsystems simultaneously. Model MaxBandGN directly optimizes the offsets for all the signals in a grid network, and as such, no 'cycle constraints' need to be constructed. Numerical tests are presented to show that both models have the potential to produce coordination plans that are comparable to signal plans optimized by Synchro. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Signal coordination Long arterial Grid network Bandwidth maximization mixed-integer linear program

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：