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

Loading Optimization of an Ordered Set of Aircraft

Mathematical Models and Computer Simulations 2020年第6期12卷 950-957页

作者： Bogdanov, I.P. Sudakov, V.A. Toporov, N.B. Keldysh Institute of Applied Mathematics Russian Academy of Sciences Moscow Russian Federation National Research Center Zhukovsky Institute Moscow Russian Federation

Abstract: The problem of calculating the optimal loading of the set of aircraft organized in accordance with the given system of priorities is considered. The formalization in the form of a mixed integer linear programming problem, which requires half as many binary variables for writing down the conditions under which the cargoes do not intersect in comparison with the approaches presented in the literature, is proposed for the specified problem. The technology of the exact solution of the specified problem is developed and implemented in the form of a public web service. The main features and practical significance of the proposed technology are described. © 2020, Pleiades Publishing, Ltd.

关键词： aircraft loading container packing mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal Throughput Allocation in Air-to-Ground Networks

Optimal Throughput Allocation in Air-to-Ground Networks

引用

IEEE Global Communications Conference (GLOBECOM) on Advanced Technology for 5G Plus

作者： Hofmann, Sandra Schupke, Dominic Fitzek, Frank H. P. Tech Univ Dresden Deutsch Telekom Chair Commun Networks Dresden Germany Airbus Cent Res & Technol Munich Germany

ISBN: (纸本)9781728182988

While connectivity is available almost anytime and anywhere on ground, aircraft during flight still lack high-throughput communication. We investigate air-to-ground networks consisting of direct air-to-ground, air-to-air and satellite links for providing high throughput to aircraft. We formulate an optimization problem to maximize the minimum throughput of all aircraft. We solve the problem using realistic aircraft and base station positions and also model physical limitations such as maximum number of antennas per aircraft and interference. We investigate different scenarios and parameters and analyze the influence of the parameters on the max-min throughput per aircraft. We show that the satellite and direct air-to-ground links are the bottleneck, as all throughput can be distributed among aircraft. Furthermore we show that air-to-air communication is dispensable for achieving a high throughput when having direct air-to-ground coverage.

关键词： aircraft connectivity air-to-ground throughput air-to-ground networks mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

EIA-CNDP: An exact iterative algorithm for critical node detection problem

引用

COMPUTERS & OPERATIONS RESEARCH 2021年 127卷 105138-105138页

作者： Rezaei, Javad Zare-Mirakabad, Fatemeh MirHassani, Seyed Ali Marashi, Sayed-Amir Amirkabir Univ Technol Dept Math & Comp Sci Tehran Iran Univ Tehran Coll Sci Dept Biotechnol Tehran Iran

In designing reliable and impermeable networks, the robustness of the network is evaluated against the removal and failure of the node or edge where the network robustness (network connectivity) is measured using various metrics (objective functions) such as the number of connected components, size of the largest connected component, and pairwise connectivity. Critical node detection problem (CNDP) is one of the main issues in this literature, which aims to find a set of vertices whose removal maximizes or minimizes some objective function. In this paper, the focus is on solving CNDP, considering the size of the largest connected component as its objective function. In this regard, we introduce a new problem called K-Group-Division-Problem and present a mixed integer linear programming model to solve it. We prove that under certain circumstances, any optimal solution of the new problem is also an optimal solution of CNDP. Analyzing the performance of the proposed model on solving CNDP, indicates that this model is highly competitive against the base model in the literature. Furthermore, a novel exact algorithm is introduced which improves the proposed mixed integer linear programming model to address CNDP more efficiently. The results show that the proposed algorithm is much more efficient, and, compared with the base model, it can solve the problem on networks with a higher number of nodes. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Exact algorithm Critical node Largest connected component mixed integer linear programming Network vulnerability

来源：评论

学校读者我要写书评

暂无评论

A modelling framework for energy system planning: Application to CHP plants participating in the electricity market

引用

ENERGY 2021年 214卷 118976-118976页

作者： Mallier, Lise Hetreux, Gilles Thery-Hetreux, Raphaele Baudet, Philippe Univ Toulouse Lab Genie Chim LGC UPS INPTCNRS Toulouse France Proesis SAS 42 Ave Gen Croutte Toulouse France

This article presents a general modelling framework dedicated to the short-term planning of energy systems, which supports the fast prototyping of optimization models. Due to the need for its applicability to practical problem instances, the methodology is based on a generic mixed integer linear programming (MILP) formulation. In addition, a specific graphical formalism called Extended Resource Task Network (ERTN) is proposed for the configuration step, which enables the modelling of any type of system and the automatic instantiation of the optimization models. The value of implementing such a tool is demonstrated through the modelling, operational planning and performance evaluation of a Combined Heat and Power (CHP) plant that participates in the French Day-ahead electricity market. Indeed, while real-time control of utility plants plays an important role in ensuring the balance between production and needs, forecasting and planning these production systems is becoming increasingly necessary to make them more energy and economically efficient. The case study shows, on the one hand the potentialities of the modelling approach through the ability to achieve rapid development and implementation of complex systems, and on the other hand significant opportunities to improve the site's economic profitability as well as its environmental impact. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Modelling framework Fast prototyping Short-term planning Energy management system mixed integer linear programming Combined heat and power plants

来源：评论

学校读者我要写书评

暂无评论

City-scale optimal location planning of Green Infrastructure using piece-wise linear interpolation and exact optimization methods

引用

JOURNAL OF HYDROLOGY 2021年 601卷 126540-126540页

作者： Torres, M. N. Fontecha, J. E. Walteros, J. L. Zhu, Z. Ahmed, Z. Rodriguez, J. P. Rabideau, A. J. Univ Buffalo Dept Civil Struct & Environm Engn Jarvis Hall Buffalo NY 14228 USA Univ Buffalo Dept Ind & Syst Engn Bell Hall Buffalo NY USA Univ Buffalo RENEW Inst Cooke Hall Buffalo NY USA Univ Los Andes Dept Ingn Civil & Ambiental Bogota Colombia

Green Infrastructure (GI) location planning involves multi-objective spatial analysis considering simultaneous benefits. Fast optimization results are often required (e.g., collaborative modeling exercises and stakeholder involvement workshops), while the simulation-optimization approach is impractical for these cases if it relies on time-consuming simulations of complex drainage system models. This paper proposes a new method using a surrogated model based upon targeted executions of a more complex urban drainage model. This method uses a piece-wise linear interpolation to predict the hydrological impact of individual impervious-to-pervious area changes and the mixed integer linear Optimization to find the optimal location of GI practices. We applied the methodology to the capital city of Colombia, Bogota, with the objectives of reducing runoff, combined sewer overflows (CSOs), and separate sanitary overflows (SSOs). Two multi-objective optimization approaches (i.e., a lexicographic and a weighted-sum model) were explored, showing the high efficiency of this approach in building Pareto Fronts and rapidly suggesting alternative solutions for different budgets. It was found that by implementing GIs on one-third of the city's GI-feasible public areas (2.2% of city area), under a 10-year 6-h rainfall event, the total reduction on runoff, CSO, and SSO are 0.9%, 1.8%, and 2.4%, respectively. These results show the importance of promoting GI among private-land owners, especially in cities with land predominantly private-owned. This new approach is particularly useful for applications under data scarcity and high-uncertainty scenarios.

关键词： Green Infrastructure mixed integer linear programming Optimization Piece-wise interpolation Spatial location Urban drainage

来源：评论

学校读者我要写书评

暂无评论

Minimizing maximum tardiness subject to collect the EOL products in a single machine scheduling problem with capacitated batch delivery and pickup systems

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2021年 161卷

作者： Rostami, Mohammad Shahrood Univ Technol Dept Ind Engn & Management Shahroud Iran

This paper introduces capacitated batch delivery and pickup systems (here it is named closed-loop batch delivery systems) in an integrated production scheduling and distribution operation problem for the first time. A comprehensive and integrated model is developed for production scheduling, delivering products to the multiple customers using batch delivery system, and picking-up End of Life (EOL) products in order to recycle and reuse in the manufacturer plant. The aim of this model is to minimize the maximum tardiness subject to collect the EOL product in order to improve sustainability. First, a mixed integer linear programming (MILP) model is developed to solve small-size instances. Due to the fact that this problem is NP-hard, a branch and bound algorithm is developed by introducing effective lower bounds in order to obtain optimal solutions for the large-size instances. In order to show the application of the problem, a real case study in a motor oil supply chain is presented. The results illustrate that paying attention to the problem of collecting used motor oils through simultaneous pick-up and delivery can reduce their disposal in nature or reduce non-standard recycling of motor oil, which in turn improves sustainability. Finally, experimental results on the random generation problems show that the proposed branch and bound algorithm is especially useful to solve large-size instances.

关键词： Closed-loop batch delivery system Maximum tardiness Sustainability mixed integer linear programming Branch and bound algorithm Case study

来源：评论

学校读者我要写书评

暂无评论

An optimization model to maximize energy generation in short-term hydropower unit commitment using efficiency points

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2021年 125卷 106419-106419页

作者： Daadaa, Maissa Seguin, Sara Demeester, Kenjy Anjos, Miguel F. Univ Quebec Chicoutimi Dept Comp Sci & Math Saguenay PQ G7H 2B1 Canada Rio Tinto Saguenay PQ G7S 4R5 Canada Univ Edinburgh Sch Math Edinburgh EH9 3FD Midlothian Scotland Polytech Montreal Dept Math & Ind Engn Montreal PQ H3T 1J4 Canada GERAD HEC Montreal Montreal PQ H3T 2A7 Canada

This paper presents a linear mixed-integer formulation to solve the short-term hydropower unit commitment problem. It uses the pair of maximum efficiency points of water discharge and the power produced at the maximum storage for all possible combinations of turbines. The goal is to maximize total energy production for all periods. The objective function is calculated using the correction between the power produced at the current volume and the maximum storage and penalizes unit start-ups. Constraints on the maximum number of turbine changes are imposed to find a viable solution. Computational results are reported for 65 instances with two powerhouses of five turbines each located in the Saguenay-Lac-St-Jean region of the province of Quebec in Canada.

关键词： Hydro unit commitment Short-term hydropower optimization mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A comparison of mixed integer programming formulations of the capacitated lot-sizing problem

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2018年第23期56卷 7064-7084页

作者： Karagul, Hakan F. Warsing, Donald P. Hodgson, Thom J. Kapadia, Maaz S. Uzsoy, Reha Enova Int Analyt Dept Chicago IL USA North Carolina State Univ Dept Business Management Raleigh NC 27695 USA North Carolina State Univ Edward P Fitts Dept Ind & Syst Engn Raleigh NC 27695 USA

We propose a novel mixed integer programming formulation for the capacitated lot-sizing problem with set-up times and set-up carryover. We compare our formulation to two earlier formulations, the Classical and Modified formulations, and a more recent formulation due to Suerie and Stadtler. Extensive computational experiments show that our formulation consistently outperforms the Classical and Modified formulations in terms of CPU time and solution quality. It is competitive with the Suerie-Stadtler (S&S) formulation, but outperforms all other formulations on the most challenging instances, those with low-capacity slack and a dense jobs matrix. We show that some of the differences in the performance of these various formulations arise from their different use of binary variables to represent production or set-up states. We also show that the LP relaxation of our Novel formulation provides a tighter lower bound than that of the Modified formulation. Our experiments demonstrate that, while the S&S formulation provides a much tighter LP bound, the Novel formulation is better able to exploit the intelligence of the CPLEX solution engine.

关键词： capacitated lot sizing mixed integer linear programming set-up planning printing industry optimisation

来源：评论

学校读者我要写书评

暂无评论

Fast Planning for Joint Routing and Charging of Autonomous Drone Delivery System

Fast Planning for Joint Routing and Charging of Autonomous D...

引用

AIAA Science and Technology Forum and Exposition (AIAA SciTech)

作者： Chen, Jun San Diego State Univ Dept Aerosp Engn San Diego CA 92182 USA

ISBN: (数字)9781624105951

ISBN: (纸本)9781624105951

Recent developments and investigations in autonomous electric aerial vehicles (EAVs) are expected to bring the aviation into a new era. Thanks to their unmanned and autonomous nature, EAVs are widely used or proposed for various aviation applications in the low altitude airspace, such as drone delivery and urban air mobility. To take the limited battery endurance into the route planning loop, this paper proposes a joint optimization methodology to handle the optimal routing and charging tasks at the same time. The joint optimization problem can effectively save system operational cost by considering the unique characteristics of EAVs. The joint problem is firstly formulated as a mixed integer linear program, which is NP-hard. To improve computing efficiency, we further develop a distributed heuristic algorithm. The problem formulation and the heuristic algorithm are both well validated through comprehensive simulations.

关键词： Drone Urban Air Mobility Airspace mixed integer linear programming Air Transportation Computing Federal Aviation Administration Small Unmanned Aircraft System Vertical Takeoff and Landing Energy Consumption

来源：评论

学校读者我要写书评

暂无评论

Optimization of Truck-Shovel Allocation Problem in Open-Pit Mines 3rd

Optimization of Truck-Shovel Allocation Problem in Open-Pit ...

引用

3rd International Conference on Smart Applications and Data Analysis for Smart Cyber Physical Systems

作者： Benlaajili, Sanaa Moutaouakkil, Fouad Chebak, Ahmed Medromi, Hicham Deshayes, Laurent Mourad, Salma Res Fdn Dev & Innovat Sci & Engn Casablanca Morocco Hassan II Univ Natl Higher Sch Elect & Mech Casablanca Morocco Mohammed VI Polytech Univ Innovat Lab Operat Benguerir Morocco

ISBN: (纸本)9783030451820;9783030451837

The use of an optimized dispatching system for the haul trucks in an open-pit mine plays a crucial role to increase the production, especially with the introduction of autonomous trucks into the mine. This involves managing the entire transport system in order to reduce the mine's operating costs and enhance the mine efficiency. This paper presents a trucks-shovel dispatching model that performs the first phase of a mining fleet management system (production optimization and allocation planning) and which is developed in two main steps. The first step proposes a modeling of the allocation of shovels problem as a vehicle routing problem. In the second step, a mixed integer linear programming model is proposed to determine the optimal number of trips required to transport the quantity of ore from each loading point to each dumping site, this model is used to dispatch available trucks to the appropriate shovel. The feature of the proposed models is that they include the assignment of shovels which is generally ignored and left to the task's dispatcher. The second specificity is that they take into account a heterogeneous fleet of trucks and shovels with different capacities. For validation, a case study using the developed models in a Moroccan mining company is presented and discussed.

关键词： Fleet management system Truck-shovel allocation problem mixed integer linear programming Vehicle routing problem Autonomous trucks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：