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

Tire noise optimization problem: a mixed integer linear programming approach

RAIRO-OPERATIONS RESEARCH 2021年第5期55卷 3073-3085页

作者： Becker, Matthias Ginoux, Nicolas Martin, Sebastien Roka, Zsuzsanna Leibniz Univ Hannover FG HCI Appelstr 9A D-30167 Hannover Germany Univ Lorraine CNRS IECL F-57000 Metz France Univ Lorraine Lab Concept Optimisat & Modelisat Syst LCOMS EA 7306 F-57000 Metz France

We present a mixed integer linear programming (MILP) approach in order to model the non-linear problem of minimizing the tire noise function. In a recent work, we proposed an exact solution for the Tire Noise Optimization Problem, dealing with an APproximation of the noise (TNOP-AP). Here we study the original non-linear problem modeling the EXact- or real-noise (TNOP-EX) and propose a new scheme to obtain a solution for the TNOP-EX. Relying on the solution for the TNOP-AP, we use a Branch&Cut framework and develop an exact algorithm to solve the TNOP-EX. We also take more industrial constraints into account. Finally, we compare our experimental results with those obtained by other methods.

关键词： mixed integer linear programming branch-and-cut tire shape optimization

来源：评论

学校读者我要写书评

暂无评论

Genset Scheduling in a Redundant Electric Power System for an Offshore Vessel Using mixed integer linear programming

引用

JOURNAL OF OFFSHORE MECHANICS AND ARCTIC ENGINEERING-TRANSACTIONS OF THE ASME 2021年第6期143卷 061401页

作者： Thorat, Laxminarayan Skjetne, Roger Osen, Ottar L. Norwegian Univ Sci & Technol NTNU Ctr Autonomous Marine Operat & Syst AMOS Dept Marine Technol N-7491 Trondheim Norway Norwegian Univ Sci & Technol NTNU Dept ICT & Nat Sci N-6009 Alesund Norway

This paper proposes several schemes for optimal scheduling of power producers in a shipboard power system for a typical offshore supply vessel, having a multiple number of possibly varying capacity gensets. The proposed scheduling methods are illustrated using four alternative power system configurations, ranging from a few large gensets to many gensets of smaller ratings. mixed integer linear programming is used to formulate the optimization problems. Three formulations are presented: one for minimizing online capacity without further objectives, one that includes a redundancy constraint for loosing a group of gensets (to account for a worst-case failure scenario), and one to also balance running hours and minimizing connect/disconnect of the gensets. These different objectives can be combined and weighted based on importance, with or without redundancy constraints. Simulations are carried out to demonstrate the properties of the three different scheduling methods. The first method, minimizing online capacity only, is also used to illustrate the differences between the four genset configurations. This shows, for instance, that using more small gensets ensures generally a lower online available power (the connected capacity matches better the prevailing load) and near optimal loading of each genset around 80% (assuming equal loadsharing), at the same time as resilience to genset failures is preserved.

关键词： marine vessels marine power systems optimal genset scheduling mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

mixed integer linear programming formulations for the hydro production function in a unit-based short-term scheduling problem

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2021年 128卷

作者： Guisandez, Ignacio Ignacio Perez-Diaz, Juan Univ Politecn Madrid Dept Hydraul Energy & Environm Engn Madrid 28040 Spain

The growing complexity of power system operation demands a greater performance of the modeling approaches, even for generation technologies already consolidated as hydroelectricity. Five mixed integer linear programming formulations for modeling the hydro production function (HPF) are compared: four based on previous references (the traditional method based on a single concave piecewise linear flow-power function, the rectangle method, the logarithmic independent branching 6-stencil method, and the quadrilateral method), and one firstly presented in the paper (the parallelogram method). The comparison is made in the context of daily and weekly hydro scheduling problems of a hypothetical three-plant system on different national day-ahead markets and using different levels of detail in the HPF discretization and time limits. The discussion of results is focused around the relative accuracy, effectiveness, and speed of the analyzed methods to solve the scheduling problems in order to aid in making the most appropriate choice depending on the time horizon. This discussion shows the logarithmic independent branching 6-stencil method as one of the most accurate, the parallelogram method as one of the most effective, and the traditional method based on a single concave piecewise linear flow-power function as the fastest one.

关键词： Hydro production function mixed integer linear programming Problem linearization Short-term hydro scheduling

来源：评论

学校读者我要写书评

暂无评论

Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations

引用

JOURNAL OF GLOBAL OPTIMIZATION 2021年第2期81卷 293-321页

作者： Gondzio, Jacek Yildirim, E. Alper Univ Edinburgh Sch Math James Clerk Maxwell Bldg Edinburgh EH9 3FD Midlothian Scotland

A standard quadratic program is an optimization problem that consists of minimizing a (nonconvex) quadratic form over the unit simplex. We focus on reformulating a standard quadratic program as a mixed integer linear programming problem. We propose two alternative formulations. Our first formulation is based on casting a standard quadratic program as a linear program with complementarity constraints. We then employ binary variables to linearize the complementarity constraints. For the second formulation, we first derive an overestimating function of the objective function and establish its tightness at any global minimizer. We then linearize the overestimating function using binary variables and obtain our second formulation. For both formulations, we propose a set of valid inequalities. Our extensive computational results illustrate that the proposed mixed integer linear programming reformulations significantly outperform other global solution approaches. On larger instances, we usually observe improvements of several orders of magnitude.

关键词： Nonconvex optimization Quadratic programming mixed integer linear programming Global optimization

来源：评论

学校读者我要写书评

暂无评论

New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年第1期46卷 1-1页

作者： Doan, Thanh Tan Bostel, Nathalie Ha, Minh Hoang Nguyen, Vu Hoang Vuong Univ Nantes CNRS LS2N F-44000 Nantes France Phenikaa Univ Fac Comp Sci ORLab Hanoi 12116 Vietnam VNU Univ Engn & Technol Fac Informat Technol ORLab Hanoi Vietnam

The Traveling Salesman Problem (TSP) is a well known problem in operations research with various studies and applications. In this paper, we address a variant of the TSP in which the customers are divided into several priority groups and the order of servicing groups can be flexibly changed with a rule called the d-relaxed priority rule. The problem is called the Clustered Traveling Salesman Problem with Relaxed Priority Rule (CTSP-d). We propose two new mixed integer linear programming (MILP) models for the CTSP-d and a metaheuristic based on Iterated Local Search (ILS) with operators designed for or adapted to the problem. The experimental results obtained on the benchmark instances show that two new models performs better than previous ones, and ILS also proves its performance with 13 new best known solutions found and significant stability compared to existing metaheuristics.

关键词： Traveling Salesman Problem d-relaxed priority rule mixed integer linear programming Iterated local search

来源：评论

学校读者我要写书评

暂无评论

Improving the manufacturability of highly materially restricted topology-optimized designs with mixed integer linear programming

引用

ENGINEERING STRUCTURES 2023年第1期284卷

作者： Carstensen, Josephine, V Kim-Tackowiak, Hajin Liang, Mia Y. MIT Dept Civil & Environm Engn 77 Massachusetts Ave Cambridge MA 02139 USA

This paper presents a new free-form topology optimization framework for highly materially restricted design situations. Highly materially restricted design situations are herein defined as being limited significantly by the combined demands on material use and manufacturability. The new framework uses the ground structure approach with frame elements and casts the design problem as a mixed integer linear Program (MILP), ensuring a solution with a manufacturable discrete material distribution. This paper also presents an extension to hybrid mesh ground structures containing both frame and thin solid elements. In both cases, the user can easily tailor the resultant design to discrete fabrication requirements as e.g. relevant when using an extrusion -based Additive Manufacturing (AM) process that requires the design features to adhere to a discrete number of bead depositions. The new framework is numerically demonstrated on topology optimization benchmark examples. In addition, numerical and experimental comparisons are made to the conventional density-based topology optimization approach (with continuous density variables). When the design is highly restricted, the new MILP framework is in most tested cases found to generate solutions with improved numerical predictions on the compliance. For the experimentally validated case study, the numerical prediction is seen to significantly underestimate the experimentally observed performance gain. The experimental investigation additionally cements the high performance of density-based topology optimization in design situations with low levels of design restrictions. In these cases (6 out of 7 tested herein), the solutions generated with density-based topology optimization have comparable or preferable performance.

关键词： Topology optimization Manufacturability Additive Manufacturing Frame structures Hybrid mesh mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

mixed integer linear programming Models for Scheduling Elective Surgical Procedures 1

引用

20th International Conference on Computational Science and Its Applications (ICCSA)

作者： Hortencio, Hanna Pamplona Ronconi, Debora Pretti Univ Sao Paulo Dept Prod Engn EP USP Av Prof Almeida Prado 128Cidade Univ BR-05508900 Sao Paulo Brazil

ISBN: (数字)9783030588083

ISBN: (纸本)9783030588083;9783030588076

The problem of scheduling surgeries consists of allocating patients and resources to each surgical stage, considering the patient's needs, as well as sequencing and timing constraints. This problem is classified as NP-hard and has been widely discussed in the literature for the past 60 years. Nevertheless, many authors do not take into account the multiple stages and resources required to address the complex aspects of operating room management. The general goal of this paper is to propose a mathematical model to represent and solve this problem. Computational tests were also performed to compare the proposed model with a similar model from the literature, with a 64% average reduction in computational time.

关键词： Scheduling Surgery mixed integer linear programming Multiple resources Multiple stages

来源：评论

学校读者我要写书评

暂无评论

Portfolio optimization in district heating: Merit order or mixed integer linear programming?

引用

ENERGY 2023年 265卷

作者： Gonzalez-Salazar, Miguel Klossek, Julia Dubucq, Pascal Punde, Thomas Vattenfall Warme Berlin AG Berlin Germany

Long-term portfolio optimization is commonly used to find the most cost-effective design and operation of a district heating system, subject to technical, financial, and environmental restrictions. Optimizing a district heating system is not trivial and demands high accuracy and high computational speed. However, existing methods addressing this problem offer one or the other but not both at the same time. The state-of-the-art method for portfolio optimization is mixed integer linear programming (MILP), which is extensively used in industry and academia but can be computing and resource-intensive for large portfolio models. This limitation has motivated the development of various options to reduce the computation time while maintaining the ac-curacy to a large extent. An alternative method to MILP is the merit order (MO) method, which has been used especially for power generation applications due to its simplicity and faster computation but somewhat reduced accuracy. The aim of this paper is to investigate the potential advantages and disadvantages of MO models compared to MILP models in the context of optimizing the portfolio of assets supplying a district heating network. As a study case, we analyze a large portion of the district heating network in Berlin. Four MO model variants with different levels of complexity are proposed and compared to a reference MILP model. Results suggest that MO models variants including heat storage and describing CHP plants with significant detail have the potential to reduce calculation time by nearly three orders of magnitude compared to the reference MILP model, without significantly sacrificing accuracy. In fact, differences in heat generation and net present value (NPV) between the most accurate MO model and the reference MILP model account for +/- 4% and-6%, respectively. Moreover, results show that combining MO and MILP models is advantageous and offers high computational speed and at the same time high accuracy, especially wh

关键词： District heating Portfolio optimization mixed integer linear programming Marginal costs Merit order

来源：评论

学校读者我要写书评

暂无评论

Task and Motion Planning of Fetch-and-Carry Including Push-Aside Action Using mixed integer linear programming

Task and Motion Planning of Fetch-and-Carry Including Push-A...

引用

IEEE/SICE International Symposium on System Integration

作者： Yusuke Kuribayashi Sotaro Sowa Keisuke Takeshita Kimitoshi Yamazaki Graduate School of Engineering Shinshu University Nagano Japan Toyota Motor Cooperation Faculty of Engineering Shinshu University Nagano Japan

ISBN: (数字)9798331531614

ISBN: (纸本)9798331531621

This paper describes a method for solving task planning and motion planning problems simultaneously. We target a fetch-and-carry of a small item by a single-arm mobile manipulator and introduce a method that can generate a sequence of actions and motions required for each action, even in environments with narrow open spaces such as corridors. In addition, to deal with a case where another object is already placed at the target location, we introduce a push-aside action and extend the previous method to include this action. As our method is formulated using mixed integer linear programming (MILP), the calculation time is relatively short, irrespective of the complexity of the target problem. To verify the efficiency of the proposed method, we performed a quantitative evaluation through simulation and conducted experiments on an actual mobile manipulator to verify feasibility of the methods.

关键词： System integration Manipulators Planning mixed integer linear programming Complexity theory

来源：评论

学校读者我要写书评

暂无评论

A mixed integer linear programming model for minimum backbone grid

引用

FRONTIERS IN ENERGY RESEARCH 2023年 10卷

作者： Mei, Wenwen Sun, Zhiyuan He, Yuanjian Liu, Mosi Gong, Xianfu Li, Peijie Guangxi Univ Inst Power Syst Optimizat Sch Elect Engn Nanning Peoples R China Guangxi Power Grid Co Ltd Elect Power Res Inst Nanning Peoples R China Power China Engn Co Ltd Chengdu Elect Power Invest & Design Inst Chengdu Peoples R China Guangdong Power Grid Co Ltd Planning & Res Ctr Guangzhou Peoples R China

Developing a minimum backbone grid in the power system planning is beneficial to improve the power system's resilience. To obtain a minimum backbone grid, a mixed integer linear programming (MILP) model with network connectivity constraints for a minimum backbone grid is proposed. In the model, some constraints are presented to consider the practical application requirements. Especially, to avoid islands in the minimum backbone grid, a set of linear constraints based on single-commodity flow formulations is proposed to ensure connectivity of the backbone grid. The simulations on the IEEE-39 bus system and the French 1888 bus system show that the proposed model can be solved with higher computational efficiency in only about 30 min for such a large system and the minimum backbone grid has a small scale only 52% of the original grid. Compared with the improved fireworks method, the minimum backbone grid from the proposed method has fewer lines and generators.

关键词： minimum backbone grid mixed integer linear programming connectivity constraints single-commodity flow resilience

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：