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

Performance Evaluation of Start-Up Decisions of Rapid-Start Units for AGC

IEEE TRANSACTIONS ON POWER SYSTEMS 2015年第6期30卷 3130-3138页

作者： Saboya Bautista, Inmaculada Egido, Ignacio Lobato Miguelez, Enrique Univ Pontificia Comillas Sch Engn ICAI Madrid 28015 Spain

Generating units, participating in the secondary frequency control of a control area, are usually spinning units already connected to the network and operating outside their range of optimal performance. This paper deals with an alternative method of providing secondary frequency control called Rapid-Start (RS). It consists in assigning a regulation band to several off-line units (RS units) which are capable of being started and connected rapidly, therefore allowing the online units to operate closer to their nominal power. As RS operation may have economic benefits, an appropriate algorithm to start up an RS unit needs to be developed. This paper proposes a methodology to evaluate, compare, and choose the most appropriate RS algorithm among the ones developed for a certain AGC control area. An optimization model provides a reference by determining the hypothetically ideal start-ups and shut-downs of RS units. In addition, the definition of performance indexes to evaluate, compare, and choose the different RS algorithms is proposed. The proposed methodology is illustrated for a secondary frequency control zone within the Spanish power system by using real data signals.

关键词： mixed-integer linear programming Rapid-Start secondary regulation

来源：评论

学校读者我要写书评

暂无评论

Computation of strict long-run marginal cost for different HV consumers

引用

ELECTRIC POWER SYSTEMS RESEARCH 2015年 128卷 66-78页

作者： Biskas, Pandelis N. Bakirtzis, Grigorios A. Chatziathanasiou, Vasilis Aristotle Univ Thessaloniki Dept Elect Engn Thessaloniki 54124 Greece

In this paper the strict long-run marginal cost (LRMC) for the ratemaking of High Voltage (HV) consumers is computed, along with the constituent parts of LRMC, namely the marginal capacity cost and the marginal operating cost. The computation is performed using the perturbation approach, employing a generation expansion planning model in order to compute the optimal generation capacity expansion program that could cover the future increased demand. The perturbation is performed using realistic data from five HV consumers in Greece, which are used as demand increments for the overall system demand. The attained LRMCs are compared and conclusions are drawn regarding the effect of the consumption profile on the LRMC. A sensitivity analysis is performed considering an increasing demand increment for each HV consumer, in order to evaluate the effect of the increment magnitude on the LRMCs. Moreover, the Marginal Capacity Cost and the Marginal Operating Cost are computed in all cases. All tests are performed using the Greek electricity market, and the planning period for the LRMC computation is 20 years. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Generation expansion planning Long-run marginal cost Marginal capacity cost Marginal operating cost mixed-integer linear programming Perturbation approach

来源：评论

学校读者我要写书评

暂无评论

The aircraft routing problem with refueling

引用

OPTIMIZATION LETTERS 2015年第8期9卷 1609-1624页

作者： Kannon, Tanya E. Nurre, Sarah G. Lunday, Brian J. Hill, Raymond R. Air Force Inst Technol Dept Operat Sci ENS Wright Patterson AFB OH 45433 USA US Air Force Dept Strateg Plans & Programs Headquarters Washington DC 20330 USA

In this paper, we present, test, and compare two novel methods to solve the aircraft routing problem with aerial refueling with a multicriteria objective function. We present a mixed-integer linear program (MILP) that utilizes a combination of a network transformation and a formulation that creatively decouples refueling decisions from the nodes within the network. We also present a dynamic program (DP) that, when coupled with an alternative network transformation to account for the multiple criteria within the objective function, applies a node-labeling approach based on a modification of Dijkstra's algorithm. We test and compare these alternative solution methods on a set of 264 synthetically-generated instances representing 66 combinations of network size and the frequency of aerial refueling point availability. Invoking CPLEX using the C++ callable library to solve the MILP and applying the DP in C++, we found that the application of the DP yields a 98.97 % reduction in the required computational effort, on average, relative to the MILP;the MILP fails to find an optimal solution within a 3,600-s time limit for selected instances of networks having at least 80 nodes and for all instances of networks having at least 350 nodes. In contrast, the DP is more robust than the MILP, as it only requires longer than 3,600 s to solve selected instances of networks having more than 3,000 nodes.

关键词： Aircraft routing Network routing Node splitting mixed-integer linear programming Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Single-Car Routing in Rail Freight Transport

引用

TRANSPORTATION SCIENCE 2015年第1期49卷 130-148页

作者： Fuegenschuh, Armin Homfeld, Henning Schuelldorf, Hanno Helmut Schmidt Univ Univ Fed Armed Forces Hamburg Dept Mech Engn D-22043 Hamburg Germany Univ Erlangen Nurnberg Lehrstuhl Wirtschaftsmath D-91058 Erlangen Germany DB Mobil Logist AG Transportat Network Dev & Transport Models GSV D-60326 Frankfurt Germany

Single cars in rail freight service are bundled into trains at classification yards. On the way from their respective origins via intermediate yards to their destinations, they are reclassified several times, which is a time-consuming and personally consuming procedure. The single-car routing problem asks for the design of such routes for a given set of orders (origin-destination pairs with associated data) on an infrastructure network, such that the number of trains and their travel distances are minimal. A number of hard restrictions must be obeyed, such as restrictions for the train length and weight, and capacity restrictions for the yards, as well as further operational rules. We present a mixed-integer linear programming (MILP) formulation for this car-routing problem arising at Deutsche Bahn, one of the largest European railway companies. In a further step, we refine the handling of the turnover waiting time for the cars in the yards, which leads to the inclusion of nonlinear constraints in the model. Using adequate linearization techniques, this model can be reduced to a MILP again. Instances of this model turn out to be hard to solve. Further techniques are thus presented to speed up the numerical solution process, among them a tree-based reformulation and heuristic cuts. The different model formulations are computationally compared on a test set of randomly generated instances whose sizes are comparable to real-world instances. Using state-of-the-art MILP solvers, optimal or near-optimal solutions can be computed within a reasonable time frame.

关键词： single-car rail freight transport mixed-integer linear programming modeling nonlinear constraints lifting network design

来源：评论

学校读者我要写书评

暂无评论

Multi-objective, multi-period optimization of district energy systems: IV - A case study

引用

ENERGY 2015年 84卷 365-381页

作者： Fazlollahi, Samira Becker, Gwenaelle Ashouri, Araz Marechal, Francois Veolia Environm Rech & Innovat F-78520 Limay France Ecole Polytech Fed Lausanne Ind Proc & Energy Syst Engn CH-1015 Lausanne Switzerland

A multi-objective, multi-period model for optimizing the design and operating strategy of district energy systems is proposed by authors [1]. In the developed model the process and energy integration techniques are principally investigated. In the present work, a case study is discussed to demonstrate the proposed model. The results illustrate that by selecting the adequate resources, centralized and decentralized conversion technologies and distribution networks, the environmental impacts can be reduced down to 50-65% and the total annual costs down to 22-27%. In addition, 75% efficiency is obtained due to the integration of co-generation technologies, endogenous resources and the waste heat recovery. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： District energy systems mixed-integer linear programming Evolutionary algorithm Multi-objective optimization Case study

来源：评论

学校读者我要写书评

暂无评论

Spatial Power Network Expansion Planning Considering Generation Expansion

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2015年第4期30卷 1815-1824页

作者： Shu, Jun Wu, Lei Zhang, Lizi Han, Bing North China Elect Power Univ Dept Elect Engn Beijing 102206 Peoples R China Clarkson Univ Elect & Comp Engn Dept Potsdam NY 13699 USA China Three Gorges Corp Dept Mkt Beijing Peoples R China

This paper introduces an efficient approach on static spatial power network expansion planning integrated with generation expansion, while considering complicated environments based on the raster map in geographic information systems (GIS). Candidate plants could be built on any cell in the map, which means that terminals of candidate lines connected to candidate plants are not fixed. This is a remarkable difference from the literature in which the terminals of candidate lines are fixed. The objective is to minimize the total system cost, subject to prevailing investment and operation constraints. The model is formulated as a mixed-integer linear programming (MILP) problem via integer algebra techniques. A two-step approach is proposed to address the computational complexity. The first step searches optimal electric line routes via dynamic programming, while the second step solves a simplified MILP problem for obtaining final optimal generation and transmission planning strategies based on optimal line routes derived from the first step. In most cases, the proposed two-step approach would derive the same global optimal solutions as those by solving the original formulation directly. Thus, the proposed two-step approach can significantly improve the computational efficiency while maintaining the solution optimality. Numerical examples demonstrate the effectiveness of the proposed approach.

关键词： Dynamic programming generation expansion geographic information systems mixed-integer linear programming power network planning routing

来源：评论

学校读者我要写书评

暂无评论

A quantitative assessment on the placement practices of gas detectors in the process industries

引用

JOURNAL OF LOSS PREVENTION IN THE PROCESS INDUSTRIES 2015年 35卷 339-351页

作者： Benavides-Serrano, A. J. Mannan, M. S. Laird, C. D. Texas A&M Univ Dept Chem Engn Artie McFerrin Dept Chem Engn College Stn TX 77843 USA Texas A&M Univ Mary Kay OConnor Proc Safety Ctr Artie McFerrin Dept Chem Engn College Stn TX 77843 USA Purdue Univ Sch Chem Engn W Lafayette IN 47907 USA

Gas detection is an important safety system with interfaces to several other safety safeguards. However, the generality of the regulations, standards and recommended practices in conjunction with the inherent challenges of the gas detector placement problem, has resulted in a widespread use of prescriptive and qualitative detector placement strategies. In order to take advantage of the quantitative information provided by dispersion simulations, a stochastic programming formulation (SP-UV) was previously proposed, developed and validated by the authors. This formulation identifies the gas detector layout that minimizes the expected value of an overall damage coefficient (i.e., the minimization of a risk metric) given a set of dispersion scenarios. Results demonstrated the potential and suitability of numerical optimization to solve the gas detector placement problem while rigorously considering its inherent uncertainties. In this work, four existing approaches for gas detector placement were implemented and compared with the previously proposed quantitative optimization-based approach using three different performance metrics in accordance to the objectives of gas detection systems. Results provide evidence on the effectiveness of the use of dispersion simulations, and mathematical programming, to supplement the gas detector placement problem. (c) 2014 Published by Elsevier Ltd.

关键词： Gas detection Process safety Detector placement Stochastic programming mixed-integer linear programming Unavailability Backup coverage Voting

来源：评论

学校读者我要写书评

暂无评论

A decomposition-based heuristic for the multiple-product inventory-routing problem

引用

COMPUTERS & OPERATIONS RESEARCH 2015年第Mar.期55卷 153-166页

作者： Cordeau, Jean-Francois Lagana, Demetrio Musmanno, Roberto Vocaturo, Francesca HEC Montreal Montreal PQ H3T 2A7 Canada Univ Calabria Dept Mech Energy & Management Engn I-87036 Arcavacata Di Rende CS Italy Univ Calabria Dept Econ Stat & Finance I-87036 Arcavacata Di Rende Italy

The inventory-routing problem is an integrated logistics planning problem arising in situations where customers transfer the responsibility for inventory replenishment to the vendor. The vendor must then decide when to visit each customer, how much to deliver and how to sequence customers in vehicle routes. In this paper, we focus on the case where several different products have to be delivered by a fleet of vehicles over a finite and discrete planning horizon. We present a three-phase heuristic based on a decomposition of the decision process of the vendor. In the first phase, replenishment plans are determined by using a Lagrangian-based method. These plans do not specify delivery sequences for the vehicles. The sequencing of the planned deliveries is performed in the second phase in which a simple procedure is employed to construct vehicle routes. The third phase incorporates planning and routing decisions into a mixed-integer linear programming model aimed at finding a good solution to the integrated problem. Computational experiments show that our heuristic is effective on instances with up to 50 customers and 5 products. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Inventory-routing Heuristic mixed-integer linear programming Lagrangian relaxation

来源：评论

学校读者我要写书评

暂无评论

A supply chain design approach considering environmentally sensitive customers: the case of a German manufacturing SME

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2015年第21期53卷 6534-6550页

作者： Altmann, Michael Univ Wurzburg Chair Business Management & Ind Management D-97070 Wurzburg Germany

Sustainable business development is one of the main topics of research and management in recent years. Since the environmental pillar is a part of the sustainability concept, companies are forced to (re-)design their supply chain according to environmental issues. Both government and other stakeholders, e.g. non-governmental organisations and customers, pay a lot of attention on a company's environmental performance. Hence there is a risk of losing reputation if a company does not comply with environmental norms. We focus on the impact of customers' requirements regarding the environmental performance of a product on strategic supply chain design decisions of the manufacturer of the product. Thus, we consider the case of a German manufacturing company and present a mixed-integer linear programming supply chain design model with a demand function that is influenced by sustainability requirements. The company is assumed to be able to improve the environmental performance of the products sold and affect the customer demand positively by designing an environmentally conscious supply chain.

关键词： mixed-integer linear programming sustainable manufacturing supply chain design case study

来源：评论

学校读者我要写书评

暂无评论

AM-Band: An Asymmetrical Multi-Band model for arterial traffic signal coordination

引用

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2015年第PartC期58卷 515-531页

作者： Zhang, Chao Xie, Yuanchang Gartner, Nathan H. Stamatiadis, Chronis Arsava, Tugba MIT Dept Civil & Environm Engn Cambridge MA 02139 USA Univ Massachusetts Dept Civil & Environm Engn Lowell MA 01854 USA

MAXBAND and MULTIBAND are two well-recognized methods for arterial signal control. In this paper, an Asymmetrical Multi-BAND (AM-BAND) model is developed by relaxing the symmetrical progression band requirement in MULTIBAND. Such a relaxation allows the AM-BAND model to better utilize the available green times in each direction and to provide additional opportunities for vehicular progression. Similar to MULTIBAND, the proposed AM-BAND model is formulated as a mixed-integer linear program. However, in AM-BAND the green bands in each directional section of the arterials do not have to be symmetrical with respect to the progression line. The performance of the AM-BAND model is evaluated for two arterial network data using the AIMSUN microscopic traffic simulation tool. The optimal signal coordination plans are computed by the IBM CPLEX Optimization Studio and compared with signal timing plans generated by AM-BAND, MULTIBAND, and MAXBAND. Simulation results indicate that the traffic signal coordination plans generated by AM-BAND can provide significant benefits compared to those generated by MAXBAND and MULTIBAND. Published by Elsevier Ltd.

关键词： Traffic signal coordination MAXBAND MULTIBAND mixed-integer linear programming Traffic simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：