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

IEEE International Conference on Systems, Man and Cybernetics

作者： O. Saeki K. Tsuji Graduate School of Engineering Osaka University Suita Japan

来源：评论

学校读者我要写书评

暂无评论

Safety of a decentralized scheme for free-flight ATMS using mixed integer linear programming

Safety of a decentralized scheme for free-flight ATMS using ...

引用

American Control Conference (ACC)

作者： L. Pallottino A. Bicchi S. Pancanti E2809C. PiaggioE2809D Interdepartmental Research Center University of Pisa Pisa Italy

In this paper we consider policies for free-flight management of air traffic. We consider instantaneous and bounded heading angle deviation as conflict avoidance maneuvers. The corresponding model, resulting in a mixed integer linear programming (MILP) problem allow to solve both conflict detection and conflict resolution problems. The developed algorithm proved successful in a centralized implementation with a large number of cooperating aircraft. However, the application of such algorithm to a free flight environment, where cooperation can only be expected from neighboring aircraft, poses many challenges. We consider a model of the decentralized conflict resolution strategy that is based on a hybrid system, and sufficient conditions under which a 3-aircraft free flight MILP-based scheme guarantees safety of flight are provided.

关键词： mixed integer linear programming Aircraft Aerospace safety Air safety Vehicle safety Traffic control Decision making Fuels Collaboration Distributed control

来源：评论

学校读者我要写书评

暂无评论

Aircraft trajectory planning with collision avoidance using mixed integer linear programming

Aircraft trajectory planning with collision avoidance using ...

引用

American Control Conference (ACC)

作者： A. Richards J.P. How Space Systems Laboratory Massachusetts Institute of Technology Cambridge USA

Describes a method for finding optimal trajectories for multiple aircraft avoiding collisions. Developments in spacecraft path-planning have shown that trajectory optimization including collision avoidance can be written as a linear program subject to mixed integer constraints, known as a mixed-integer linear program (MILP). This can be solved using commercial software written for the operations research community. In the paper, an approximate model of aircraft dynamics using only linear constraints is developed, enabling the MILP approach to be applied to aircraft collision avoidance. The formulation can also be extended to include multiple waypoint path-planning, in which each vehicle is required to visit a set of points in an order chosen within the optimization.

关键词： Trajectory Collision avoidance mixed integer linear programming Vehicle dynamics Path planning Unmanned aerial vehicles Air traffic control Remotely operated vehicles Military aircraft Space vehicles

来源：评论

学校读者我要写书评

暂无评论

An algorithm for the generalized vehicle routing problem with backhauling

引用

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2005年第2期22卷 153-169页

作者： Mitra, S Indian Inst Management Calcutta Joka Kolkata 700104 India

The Vehicle Routing Problem with Backhauling deals with the supply of finished goods from a depot to a number of delivery points, and picking up returnable items and bringing them back to the depot using a fleet of trucks. Traditionally, the objective of the problem has been to determine the truck routes such that the total number of trucks and/or the total distance traveled/total route cost are minimized. Most of the papers available in the literature in this connection deal with problems where the linehaul (having a demand for finished goods) and backhaul (having items to be returned to the depot) customers axe different, and a customer may be visited by at most one truck limiting demand and returns at a location by the capacity of the truck. In this paper, we allow the linehaul and backhaul customers to be the same leading to simultaneous delivery and pickup at a customer location, and also there is no restriction on the quantity demanded at (to be returned from) a customer location. As such a customer may be visited by more than one truck and more than once by the same truck. We developed a mixed integer linear programming (MILP) formulation of the problem and a route construction heuristic. The heuristic averaged 80 ms for 110 problems tested, and in 78 of them the heuristic costs were either equal to the optimal costs or at most equal to the upper bounds on the optimal costs obtained after running the optimization package for 30 min. Optimal solutions were obtained for 28 problems at an average time of 295 ms. The heuristic could match the optimal solutions for 22 of these problems at, an average time of 71 ms.

关键词： vehicle routing backhauling mixed integer linear programming heuristic

来源：评论

学校读者我要写书评

暂无评论

Aircraft maintenance jacking problem via optimization

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2005年第1期41卷 99-109页

作者： Mongeau, M Bès, C Univ Toulouse 3 MIP UMR 5640 F-31062 Toulouse France

We address the problem of assigning forces to jacking positions in order to weaken stress at points where an aircraft maintenance operation has to be performed. We introduce a mixed-integer linear programming model and report encouraging computational experiments on historical data. Our methodology is currently under the process of industrial implementation at Airbus, where it will be used as a maintenance decision-analysis tool.

关键词： aircraft maintenance integer programming linear programming Airbus aircraft maintenance jacking problem aircraft maintenance operation industrial implementation jacking positions maintenance decision-analysis tool mixed-integer linear programming model aircraft maintenance Airbus mixed integer linear programming linear programming integer programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Nonlinear control allocation using piecewise linear functions: A linear programming approach

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2005年第3期28卷 558-562页

作者： Bolender, MA Doman, DB USAF Control Design & Anal Branch Wright Patterson AFB OH 45433 USA

The intent of this Note is to show that the piecewise linear control allocation problem can be solved fast enough to be implemented in a digital flight-control system. The approach taken here differs from the authors' initial paper on this subject in two ways. The first difference is a move away from the mixed-integer linear programming form of the optimization problem and to a linear programming formulation. The linear programming problem will be solved using a modified simplex algorithm where a rule-based approach is employed to enforce the necessary adjacency constraints on the interpolating coefficients. The second difference is that we solve a mixed optimization problem2 as opposed to the solution of the multibranch control allocation problem.' This allows us to achieve the same objective as before, but only having to solve one optimization problem instead of two. We will compare the performance of the simplex method with restricted basis entry rules to the mixed-integer formulation and show that the two approaches give equivalent solutions to the same set of control allocation problems. To perform this comparison, we will look at both closed-loop and open-loop control allocation problems. In the latter case, a set of control allocation problems are randomly selected and solved by each approach. For the former, we compare the algorithms in a digital simulation of a reentry vehicle on approach and landing.

关键词： linear programming Nonlinear Control mixed integer linear programming Digital Flight Control System Control Surfaces Digital Flight Control Computer Branch and Bound Algorithm Closed Loop Aerodynamic Interference linear Interpolation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：