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

33rd Chinese Control Conference (CCC)

作者： Tian Fang Zhang Xing Liang Yile Wei Wei Liu Feng Mei Shengwei Elect Power Res Inst China Beijing 100192 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

ISBN: (纸本)9781479947249

This paper presents a method to determine carbon tax on different generating units based on Stackelberg game, which can strike a balance between carbon emission reduction and the profit of energy industry. The upper-level decision maker is the government agency, he aims to limit total carbon emissions within a certain level with minimal additional cost by setting optimal tax rates for different generating units. The lower-level decision maker is the grid operator, he wants to minimize the total production cost through executing an economic dispatch while considering the tax levied by the government. The Stackelberg game model is finally formulated as a mixed integer linear program and solved by CPLEX. Case studies on a 10 unit system demonstrate the validity of the proposed model and method.

关键词： Stackelberg game Power systems Carbon emission tax mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Stochastic Optimization Formulations for Reliability Unit Commitment Runs

Stochastic Optimization Formulations for Reliability Unit Co...

引用

IEEE Power and Energy Society General Meeting

作者： Kai Pan Yang Lu Yongpei Guan Jean-Paul Watson Department of Industrial and Systems Engineering University of Florida Discrete Math and Complex Systems Department Sandia National Laboratories

ISBN: (纸本)9781479964161

To address the uncertainties caused by the penetration of intermittent renewable energy, most ISOs/RTOs perform day-ahead and look-ahead reliability unit commitment (RUC) runs, ensuring sufficient generation capacity available in real time to accommodate the uncertainties. Two-stage stochastic optimization models have been studied extensively to strengthen the RUC runs, while multi-stage stochastic optimization models were barely studied. In this paper, we investigate the unit commitment and economic dispatch decision differences generated by these two approaches considering the load uncertainties in the system. The stochasticity is represented by a set of scenarios for the two-stage model and a scenario tree for the multi-stage case.

关键词： Unit commitment mixed-integer linear programming Two-stage stochastic optimization Multi-stage stochastic optimization

来源：评论

学校读者我要写书评

暂无评论

Two-stage flow-shop scheduling problem with non-identical second stage assembly machines

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2013年第9-12期69卷 2215-2226页

作者： Navaei, J. Ghomi, S. M. T. Fatemi Jolai, F. Shiraqai, M. E. Hidaji, H. Univ Windsor Intelligent Mfg Syst IMS Ctr Windsor ON N9B 3P4 Canada Amirkabir Univ Technol Dept Ind Engn Tehran Iran Univ Tehran Coll Engn Dept Ind Engn Tehran Iran Mazandaran Univ Sci & Technol Dept Ind Engn Babol Sar Iran

This paper addresses the two-stage assembly flow-shop problem (TSAFP) with multiple non-identical assembly machines in second stage with the objective function of makespan minimization. This problem is a generalization of previously proposed problems in TSAFP. Mathematical mixed-integer linear programming model of this problem is defined, and for it being NP-hard, a hybrid SA heuristic is proposed. The heuristic is proved to solve the problem in reduced time with negligible error. To validate the proposed method, a real-life example is presented and solved in which the efficiency of the proposed heuristic is shown.

关键词： Two-stage assembly flow-shop problem Multiple non-identical machines Mathematical model mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Modelling disruptions and resolving conflicts optimally in a railway schedule

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2013年第1期64卷 469-481页

作者： Narayanaswami, Sundaravalli Rangaraj, Narayan Higher Coll Technol Abu Dhabi U Arab Emirates Indian Inst Technol Bombay 400076 Maharashtra India

Resolving disruptions, by dispatching and rescheduling conflicting trains is an NP-complete problem. Earlier literature classify railway operations as: (i) tactical scheduling, (ii) operational scheduling, and (iii) rescheduling. We distinguish the three based on operational criticality. Existing optimisation models do not distinguish precisely between scheduling and rescheduling based on constraints modelling;the only difference is in their objective function. Our model is the first of its kind to incorporate disruptions in an MILP model and to include conflicts-resolving constraints in the model itself. The major advantage of such a formulation is that only those trains which are disrupted are rescheduled and other nonconflicting trains retain their original schedules. Our model reschedules disrupted train movements on both directions of a single track layout with an objective to minimise total delay of all trains at their destinations. Using a small sized data it is proved that all possible conflicts out of a disruption are resolved. Apart from achieving optimal resolutions, we infer through experimental verification that a non-standard dispatch ordering is a requisite for global optimality, as cogitated by other authors. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Disruption Conflicts Optimal resolution Single-track railway mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Multi-parametric disaggregation technique for global optimization of polynomial programming problems

引用

JOURNAL OF GLOBAL OPTIMIZATION 2013年第2期55卷 227-251页

作者： Teles, Joao P. Castro, Pedro M. Matos, Henrique A. Unidade Modelacao & Optimizacao Sistemas Energet Lab Nacl Energia & Geol P-1649038 Lisbon Portugal Inst Super Tecn Dept Engn Quim & Biol P-1049001 Lisbon Portugal

This paper discusses a power-based transformation technique that is especially useful when solving polynomial optimization problems, frequently occurring in science and engineering. The polynomial nonlinear problem is primarily transformed into a suitable reformulated problem containing new sets of discrete and continuous variables. By applying a term-wise disaggregation scheme combined with multi-parametric elements, an upper/lower bounding mixed-integer linear program can be derived for minimization/maximization problems. It can then be solved to global optimality through standard methods, with the original problem being approximated to a certain precision level, which can be as tight as desired. Furthermore, this technique can also be applied to signomial problems with rational exponents, after a few effortless algebraic transformations. Numerical examples taken from the literature are used to illustrate the effectiveness of the proposed approach.

关键词： Polynomial Signomial Optimization mixed-integer linear programming Parameterization

来源：评论

学校读者我要写书评

暂无评论

Technical Note-Managing a Secret Project

引用

OPERATIONS RESEARCH 2013年第1期61卷 65-72页

作者： Pinker, Edieal Szmerekovsky, Joseph Tilson, Vera Univ Rochester Simon Sch Business Rochester NY 14627 USA N Dakota State Univ Coll Business Fargo ND 58102 USA Univ Rochester Simon Grad Sch Business Rochester NY 14627 USA

We study project scheduling in a competitive setting taking the perspective of a project manager with an adversary, using a Stackelberg game format. The project manager seeks to limit the adversary's opportunity to react to the project and therefore wants to manage the project in a way that keeps the adversary "in the dark" as long as possible while completing the project on time. We formulate and illustrate a new form of project management problem for secret projects where the project manager uses a combination of deception, task scheduling, and crashing to minimize the time between when the adversary initiates a response to the project to when the project is completed. We propose a novel mixed-integer linear programming formulation for the problem and determine characteristics of optimal schedules in this context. Using a detailed example of nuclear weapons development, we illustrate the interconnectedness of the deception, task scheduling, and crashing, and how these influence adversary behavior.

关键词： competitive project scheduling exposed time secret projects covert operations interdiction mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Reactive scheduling in a make-to-order flexible job shop with re-entrant process and assembly: a mathematical programming approach

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2013年第17期51卷 5120-5141页

作者： Gomes, Marta Castilho Barbosa-Povoa, Ana Paula Novais, Augusto Queiroz Univ Tecn Lisboa Inst Super Tecn CESUR P-1049001 Lisbon Portugal Univ Tecn Lisboa Inst Super Tecn CEG IST P-1049001 Lisbon Portugal Natl Lab Energy & Geol UMOSE Unit Energy Syst Modelling & Optimizat P-1649038 Lisbon Portugal

A mixed-integer linear programming model is presented for the scheduling of flexible job shops, a production mode characteristic of make-to-order industries. Re-entrant process (multiple visits to the same machine group) and a final assembly stage are simultaneously considered in the model. The formulation uses a continuous time representation and optimises an objective function that is a weighted sum of order earliness, order tardiness and in-process inventory. An algorithm for predictive-reactive scheduling is derived from the proposed model to deal with the arrival of new orders. This is illustrated with a realistic example based on data from the mould making industry. Different reactive scheduling scenarios, ranging from unchanged schedule to full re-scheduling, are optimally generated for order insertion in a predictive schedule. Since choosing the most suitable scenario requires balancing criteria of scheduling efficiency and stability, measures of schedule changes were computed for each re-scheduling solution. The short computational times obtained are promising regarding future application of this approach in the manufacturing environment studied.

关键词： reactive scheduling flexible job shop re-entrant process assembly mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Economic and environmental aspects Of the component sizing for a stand-alone building energy system: A case study

引用

RENEWABLE ENERGY 2013年 55卷 438-447页

作者： Fux, Samuel F. Benz, Michael J. Guzzella, Lino ETH Dept Mech & Proc Engn CH-8092 Zurich Switzerland

When designing a building energy system based on renewable energy sources, a major challenge is the suitable sizing of its components. In this paper, a simulation tool is presented for determining the optimal sizes of the main components of a stand-alone building energy system which integrates both thermal and electric renewable energy sources. Since the control of this multisource energy system is a non-trivial, multivariable control problem, particular emphasis is placed on the energy management system. A control structure based on model predictive control is proposed, whereas the underlying optimal control problem is formulated as a mixed-integer linear programming problem. The simulation tool developed is successfully applied on the specific case of an alpine lodge. A set of potential configurations, each being optimal with respect to both the net present costs and the global warming potential, is generated by analyzing the system for various component sizes. Out of this set, the decision makers can choose the most cost efficient configuration fulfilling their specifications. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Stand-alone energy system Renewable energy sources Optimal component sizing Model predictive control mixed-integer linear programming Global warming potential

来源：评论

学校读者我要写书评

暂无评论

A dynamic pricing approach for returned products in integrated forward/reverse logistics network design

引用

APPLIED MATHEMATICAL MODELLING 2013年第24期37卷 10182-10202页

作者： Keyvanshokooh, E. Fattahi, M. Seyed-Hosseini, S. M. Tavakkoli-Moghaddam, R. Iran Univ Sci & Technol Dept Ind Engn Tehran Iran Amirkabir Univ Technol Dept Ind Engn & Management Syst Tehran Iran Univ Tehran Coll Engn Dept Ind Engn Tehran Iran

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics network. In this paper, we address the problem of designing and planning a multi-echelon, multi-period, multi-commodity and capacitated integrated forward/reverse logistics network. Returned products are categorized with respect to their quality levels, and a different acquisition price is offered for each return type. Furthermore, the reservation incentive of customers, the expected price of customers for one unit of used product described by uniform distribution, is applied to model the customers' return willingness. Due to the fact that the remaining worthwhile value in the used products is the corporation's key motivation for buying them from customers, a dynamic pricing approach is developed to determine the acquisition price for these products and based on it determine the percentage of returned products collected from customer zones. The used products' acquisition prices at each time period are determined based on the customers' return willingness by each collection center. A novel mixed-integer linear programming is developed to consider dynamic pricing approach for used products, forward/reverse logistics network configuration and inventory decisions, concurrently. The presented model is solved by commercial solver CPLEX for some test problems. Computational results indicate that the effect of a dynamic pricing approach for used products versus a static pricing one, and the linearization of pricing concept for this model have the acceptable solution. In addition, sensitivity analysis is conducted to show the performance of the proposed model. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Supply chain management Integrated forward/reverse logistics Quality levels Dynamic pricing approach mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Reversing port rotation directions in a container liner shipping network

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2013年 50卷 61-73页

作者： Wang, Shuaian Meng, Qiang Univ Wollongong Sch Math & Appl Stat Wollongong NSW 2522 Australia Natl Univ Singapore Dept Civil & Environm Engn Singapore 117576 Singapore

Reversing port rotation directions of ship routes is a practical alteration of container liner shipping networks. The port rotation directions of ship routes not only affect the transit time of containers, as has been recognized by the literature, but also the shipping capacity and transshipment cost. This paper aims to obtain the optimal port rotation directions that minimize the generalized network-wide cost including transshipment cost, slot-purchasing cost and inventory cost. A mixed-integer linear programming model is proposed for the optimal port rotation direction optimization problem and it nests a minimum cost multi-commodity network flow model. The proposed model is applied to a liner shipping network operated by a global liner shipping company. Results demonstrate that real-case instances could be efficiently solved and significant cost reductions are gained by optimization of port rotation directions. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Liner shipping network design Port rotation directions Multi-commodity network flow mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：