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

Hydrogen infrastructure strategic planning using multi-objective optimization

INTERNATIONAL JOURNAL OF HYDROGEN ENERGY 2005年第15期30卷 1523-1534页

作者： Hugo, A Rutter, P Pistikopoulos, S Amorelli, A Zoia, G Univ London Imperial Coll Sci Technol & Med Ctr Proc Syst Engn London SW7 2BY England BP Gas Power & Renewables Sunbury On Thames Middx England BP Gas Power & Renewables Naperville IL USA

Increasingly, hydrogen is being promoted as an alternative energy carrier for a sustainable future. Many argue that its use as a transportation fuel in fuel cell vehicles offers a number of attractive advantages over existing energy sources, especially in terms of well-to-wheel greenhouse gas emissions. Following this interest, several of the leading energy companies, like BP, have started investigating strategies for its introduction. The challenge of developing a future commercial hydrogen economy clearly still remains, though: what are the energy efficient, environmentally benign and cost effective pathways to deliver hydrogen to the consumer? Establishing what these "best" pathways may be is not trivial, given that a large number of technological options exist and are still in development for its manufacturing, storage, distribution and dispensing. Cost, operability, reliability, environmental impacts, safety and social implications are all performance measures that should be considered when assessing the different pathways as viable long-term alternatives. To aid this decision-making process, we present a generic optimization-based model for the strategic long-range investment planning and design of future hydrogen supply chains. By utilizing mixed integer linear programming (MILP) techniques, the model is capable of identifying optimal investment strategies and integrated supply chain configurations from the many alternatives. Realizing also that multiple performance criteria are of interest, the optimization is conducted in terms of both investment and environmental criteria, with the ultimate outcome being a set of optimal trade-off solutions representing conflicting infrastructure pathways. Since many agree that there is no one single template strategy for investing in a hydrogen infrastructure across the globe, emphasis is placed on developing a generic model such that it can be readily applied to different scenarios, geographical regions and case studies.

关键词： hydrogen infrastructure strategic supply chain planning mixed integer linear programming multi-objective optimization greenhouse gas emissions

来源：评论

学校读者我要写书评

暂无评论

An MILP model for optimal scheduling of the lubricant production plant

引用

CHEMICAL ENGINEERING COMMUNICATIONS 2005年第8期192卷 1067-1084页

作者： Doganis, P Sarimveis, H Bafas, G Koufos, D Natl Tech Univ Athens Sch Chem Engn Athens Greece Motor Oil Hellas Athens Greece

In this article we are developing a model that can be used for determining the optimal production schedule in a lubricant production plant. The model includes all the main stages in the lubricant production process, contains both continuous and binary variables, and results in the formulation of a mixed integer linear programming ( MILP) problem that is solved using standard optimization techniques. The model can be easily adapted to any lube production facility, thus providing a valuable tool to refineries in their effort to automate the production scheduling process. The proposed tool can save valuable time and resources by eliminating the time-consuming search for a feasible production plan that production engineers go through in order to meet production demands.

关键词： finite intermediate storage production planning and scheduling lubricants production mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Synthesis of large-scale heat exchanger networks using a sequential match reduction approach

引用

COMPUTERS & CHEMICAL ENGINEERING 2005年第5期29卷 993-1007页

作者： Pettersson, F Abo Akad Univ Heat Engn Lab FIN-20500 Turku Finland

In this paper, a sequential approach is outlined which generates networks for industrial sized heat exchanger network synthesis (HENS) problems. The proposed match reduction approach solves a sequence of subproblems, posed as transportation problems, successively reducing the set of matches that are considered in the next stage. The terms involved in the objective function are included at each step with increasing accuracy, until a final design is obtained. One of the subproblems identifies subsets of matches that can be designed separately. Due to the sequential approach, the final design is an approximating solution. Two examples are presented to illustrate the potential of the proposed method. The results show that large HENS problems can be solved to good solutions with modest computational effort. The obtained solutions are in fact, better than the results reported earlier in the literature. (c) 2004 Elsevier Ltd. All rights reserved.

关键词： heat exchanger network synthesis mixed integer linear programming sequential match reduction

来源：评论

学校读者我要写书评

暂无评论

A cutting plane method for solving linear generalized disjunctive programming problems

引用

COMPUTERS & CHEMICAL ENGINEERING 2005年第9期29卷 1891-1913页

作者： Sawaya, NW Grossmann, IE Carnegie Mellon Univ Dept Chem Engn Pittsburgh PA 15213 USA

Raman and Grossmann [Raman, R., & Grossmann, I.E. (1994). Modeling and computational techniques for logic based integer programming. Computers and Chemical Engineering, 18(7), 563-578] and Lee and Grossmann [Lee, S., & Grossmann, I.E. (2000). New algorithms for nonlinear generalized disjunctive programming. Computers and Chemical Engineering, 24, 2125-2141] have developed a reformulation of Generalized Disjunctive programming (GDP) problems that is based on determining the convex hull of each disjunction. Although the relaxation of the reformulated problem using this method will often produce a significantly tighter lower bound when compared with the traditional big-M reformulation, the limitation of this method is that the representation of the convex hull of every disjunction requires the introduction of new disaggregated variables and additional constraints that can greatly increase the size of the problem. In order to circumvent this issue, a cutting plane method that can be applied to linear GDP problems is proposed in this paper. The method relies on converting the GDP problem into an equivalent big-M reformulation that is successively strengthened by cuts generated from an LP or QP separation problem. The sequence of problems is repeatedly solved, either until the optimal integer solution is found, or else until there is no improvement within a specified tolerance, in which case one switches to a branch and bound method. The strip-packing, retrofit planning and zero-wait job-shop scheduling problems are presented as examples to illustrate the performance of the proposed cutting plane method. (c) 2005 Elsevier Ltd. All rights reserved.

关键词： MIP disjunctive programming cutting planes mixed integer linear programming strip-packing retrofit planning job-shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Patient mix optimization in tactical cardiothoracic surgery planning: A case study

引用

IMA Journal of Management Mathematics 2005年第3期16卷 281-304页

作者： Vissers, J.M.H. Adan, I.J.B.F. Bekkers, J.A. Eindhoven University of Technology PO Box 513 5600 MB Eindhoven Netherlands Erasmus Medical Centre Institute of Health Policy and Management PO Box 1738 3000 DR Rotterdam Netherlands Erasmus Medical Centre Thorax Centre Department of Cardiothoracic Surgery PO Box 1738 3000 DR Rotterdam Netherlands

Cardiothoracic surgery planning involves different resources such as operating theatre (OT) time, medium care beds, intensive care beds and nursing staff. Within cardiothoracic surgery different categories of patients can be distinguished with respect to their requirements of resources. The mix of patients is, therefore, an important aspect of decision making for the hospital to manage the use of these resources. A master OT schedule is used at the tactical level of planning for deriving the weekly OT plan. It defines for each day of a week the number of OT hours available and the number of patients operated from each patient category. We develop a model for this tactical level planning problem, the core of which is a mixed integer linear program. The model is used to evaluate scenarios for surgery planning at tactical as well as strategic levels, demonstrating the potential of integer programming for providing recommendations for change.

关键词： mixed integer linear programming Multiple resources Operating theatre scheduling Resource utilization Tactical planning

来源：评论

学校读者我要写书评

暂无评论

Modernisation of existing and new construction of power plants in Germany: results of an optimisation model

引用

ENERGY ECONOMICS 2005年第1期27卷 113-137页

作者： Schwarz, HG Univ Erlangen Nurnberg Inst Econ D-91054 Erlangen Germany

If the average lifetime of a power plant is assumed, as is commonly accepted, to be 30 to 35 years, then the German power plant inventory is outdated. In light of this, several studies have predicted a comprehensive conversion of the German power-generating industry within the next few years. It is the objective of this paper to verify this finding using an optimisation approach. Different policy scenarios are defined. The requirements are calculated for the future modernisation of existing and the new construction of conventional power plants in Germany, as well as the share of new and total capacity provided by various energy sources. The optimisation approach used considers the modernisation of old plants as an investment alternative to the construction of new plants. This fills the gap in existing power station models which do not consider plant modernisation. Estimates, depending on scenario assumptions, show that discrepancies between models that include plant modernisation and models that do not include it are considerable. (C) 2004 Elsevier B.V. All rights reserved.

关键词： new power plant construction old plant modernisation mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Formulation of optimal tree construction for maximum lifetime multicasting in wireless ad-hoc networks with adaptive antennas

Formulation of optimal tree construction for maximum lifetim...

引用

IEEE International Conference on Communications (ICC 2005)

作者： Guo, S Yang, O Univ Ottawa Sch Informat Technol & Engn Ottawa ON Canada

ISBN: (纸本)0780389387

We consider the problem of maximizing the lifetime of a given multicast connection in wireless networks that use directional antennas and have limited energy resources. We present a constraint formulation for the MLM (Multicast Lifetime Maximization) problem in terms of MILP (mixed integer linear programming) for wireless ad hoc networks, which we can use to evaluate and compare the realistic performance of different heuristic algorithms.

关键词： wireless ad-hoc network multicasr lifetime maximization adaptive antenna mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Combined optimal location of FACTS controllers and loadability enhancement in competitive electricity markets using MILP

Combined optimal location of FACTS controllers and loadabili...

引用

IEEE-Power-Engineering-Society General Meeting

作者： Sharma, A Chanana, S Parida, S Natl Inst Technol Dept Elect Engn Kurukshetra Haryana India

ISBN: (纸本)078039156X

In this paper, a new methodology for combined optimal location of Thyristor Controlled Phase Angle Regulator (TCPAR) and Thyristor Controlled Series Compensator (TCSC) has been proposed using a mixed integer linear programming approach in the deregulated electricity environment. The methodology is based on DC load flow equations taking constraints on generation, tine flows, TCPAR and TCSC parameters, power angle, and number of FACTS controllers. The system loadability has been determined without and with the combined optimal location of FACTS controllers for a pool model and hybrid model using secure bilateral transaction matrix. The results have been compared for a pool model and hybrid model with and without individual optimal location of FACTS controllers. The proposed technique has been demonstrated on IEEE 24 bus reliability test system.

关键词： secure transaction matrix system loadabitity mixed integer linear programming TCPAR and TCSC location distribution factors

来源：评论

学校读者我要写书评

暂无评论

On the exact solution of a class of Stackelberg games

On the exact solution of a class of Stackelberg games

引用

American Control Conference 2005 (ACC)

作者： Motto, AL McGill Univ Dept Biomed Engn Montreal PQ H3A 2B4 Canada

ISBN: (纸本)0780390989

This paper presents a mixed-integer linear reformulation for a subclass of two-level nonlinear discrete-continuous decision problems also known as Stackelberg strategic games. Solving the original (two-level and nonlinear) model is algorithmically challenging. In fact, even global solvers for standard (or single-level) mixed-integer nonlinear programs are difficult to implement and relatively inaccessible. The proposed transformation allows solving this class of Stackelberg games using mixed-integer linear programming theory for which optimized solvers with large-scale computational capabilities have been reported. Furthermore, the proposed reformulation is achieved without adding any new integer variables to the original model, a desired computational property in case a large portion of the search tree has to be enumerated.

关键词： continuous time systems decision theory discrete systems game theory integer programming linear programming nonlinear systems tree searching Stackelberg strategic games integer variables mixed-integer linear programming nonlinear model optimized solvers Tree searching Continuous time systems Nonlinear Models Discrete systems Decision Theory integer programming linear programming mixed integer linear programming Solvers

来源：评论

学校读者我要写书评

暂无评论

Scheduling ammunition loading and unloading for U. S. Navy ships in San Diego

Scheduling ammunition loading and unloading for U. S. Navy s...

引用

作者： Billings, Roger L. NAVAL POSTGRADUATE SCHOOL

学位级别：硕士

Tomahawk cruise missiles (TCM) cost over one million dollars and are in short supply. U. S. Navy ships require TCM and other conventional ammunition be loaded in appropriate amounts prior to deploying to sea. A typical deployment lasts for six months and, when completed, any remaining ammunition must be unloaded and made ready for other deploying ships. For ships under Commander, Naval Surface Force U. S. Pacific Fleet (SURFPAC), about 3,500 tons of ammunition must be loaded and unloaded annually; this currently costs 14 million dollars for just pilots, tugboats and fuel. This thesis formulates and solves an integer linear program, Surface Navy Scheduler (SNSKED), to prescribe an ammunition load and unload schedule for San Diego homeported ships. SNSKED seeks a schedule with minimized costs subject to constraints on ships availability, port capabilities and support assets. We test SNSKED on a realistic quarterly scenario consisting of 19 combatant ships, three weapons stations, two ammunition ships, five mission types, two ammunition types, and three ways of loading ammunition. SNSKED provides optimal schedules that reduce costs by over 16 percent. We also use SNSKED to evaluate different operational policies, ammunition port utilization, and ammunition loading times.

关键词： mixed integer linear programming Ships Scheduling Optimization Ordnance GAMS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：