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

Accelerating Generalized Benders Decomposition for Wireless Resource Allocation

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2021年第2期20卷 1233-1247页

作者： Lee, Mengyuan Ma, Ning Yu, Guanding Dai, Huaiyu Zhejiang Univ Coll Informat Sci & Elect Engn Hangzhou 310027 Peoples R China North Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27606 USA Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310027 Peoples R China

Generalized Benders decomposition (GBD) is a globally optimal algorithm for mixed integer nonlinear programming (MINLP) problems, which are NP-hard and can be widely found in the area of wireless resource allocation. The main idea of GBD is decomposing an MINLP problem into a primal problem and a master problem, which are iteratively solved until their solutions converge. However, a direct implementation of GBD is time- and memory-consuming. The main bottleneck is the high complexity of the master problem, which increases over the iterations. Therefore, we propose to leverage machine learning (ML) techniques to accelerate GBD aiming at decreasing the complexity of the master problem. Specifically, we utilize two different ML techniques, classification and regression, to deal with this acceleration task. In this way, a cut classifier and a cut regressor are learned, respectively, to distinguish between useful and useless cuts. Only useful cuts are added to the master problem and thus the complexity of the master problem is reduced. By using a resource allocation problem in device-to-device communication networks as an example, we validate that the proposed method can reduce the computational complexity of GBD without loss of optimality and has good generalization ability. The proposed method is applicable for solving various MINLP problems in wireless networks since the designs are invariant for different problems.

关键词： Resource management Acceleration Wireless networks Complexity theory programming Training Machine learning generalized Benders decomposition device-to-device communications resource allocation mixed integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Fine-Tuned Convex Approximations of Probabilistic Reachable Sets Under Data-Driven Uncertainties

引用

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2024年 22卷 1319-1338页

作者： Wu, Pengcheng Martinez, Sonia Chen, Jun Univ Calif San Diego Dept Mech & Aerosp Engn La Jolla CA 92093 USA San Diego State Univ Dept Aerosp Engn San Diego CA 92182 USA

This paper proposes a mechanism to fine-tune convex approximations of probabilistic reachable sets (PRS) of uncertain dynamic systems. We consider the case of unbounded uncertainties, for which it may be impossible to find a bounded reachable set of the system. Instead, we turn to find a PRS that bounds system states with high confidence. Our data-driven approach builds on a kernel density estimator (KDE) accelerated by a fast Fourier transform (FFT), which is customized to model the uncertainties and obtain the PRS efficiently. However, the non-convex shape of the PRS can make it impractical for subsequent optimal designs. Motivated by this, we formulate a mixed integer nonlinear programming (MINLP) problem whose solution result is an optimal n sided convex polygon that approximates the PRS. Leveraging this formulation, we propose a heuristic algorithm to find this convex set efficiently while ensuring accuracy. The algorithm is tested on comprehensive case studies that demonstrate its near-optimality, accuracy, efficiency, and robustness. The benefits of this work pave the way for promising applications to safety-critical, real-time motion planning of uncertain dynamic systems.

关键词： Uncertainty Dynamical systems Approximation algorithms Heuristic algorithms Planning Probabilistic logic Trajectory Probabilistic reachable set convex approximation uncertain dynamic system kernel density estimator mixed integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

A branch-and-price approach for the continuous multifacility monotone ordered median problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2023年第1期306卷 105-126页

作者： Blanco, Victor Gazquez, Ricardo Ponce, Diego Puerto, Justo Univ Granada Inst Math IMAG Granada Spain Univ Granada Dept Quant Methods Econ & Business Granada Spain Univ Seville Inst Math IMUS Seville Spain Univ Seville Dept Stats & OR Seville Spain

In this paper, we address the Continuous Multifacility Monotone Ordered Median Problem. The goal of this problem is to locate p facilities in Rd minimizing a monotone ordered weighted median function of the distances between given demand points and its closest facility. We propose a new branch-and -price procedure for this problem, and three families of matheuristics based on: solving heuristically the pricer problem, aggregating the demand points, and discretizing the decision space. We give detailed discussions of the validity of the exact formulations and also specify the implementation details of all the solution procedures. Besides, we assess their performances in an extensive computational experience that shows the superiority of the branch-and-price approach over the compact formulation in medium-sized instances. To handle larger instances it is advisable to resort to the matheuristics that also report rather good results.(c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license ( http://***/licenses/by/4.0/ )

关键词： Combinatorial optimization Continuous location Ordered median problems mixed integer nonlinear programming Branch-and-price

来源：评论

学校读者我要写书评

暂无评论

Solving Multistage mixed nonlinear Convex Stochastic Problems

引用

INFORMATICA 2016年第4期27卷 799-818页

作者： Mijangos, Eugenio Univ Basque Country UPV EHU Dept Appl Math & Stat & Operat Res Math POB 644 Leioa Bizkaia Spain

We present an algorithm to solve multistage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the twin-node-family concept involved in the Branch-and-Fix Coordination method. These problems have 0-1 mixed-integer and continuous variables in all the stages. The non-anticipativity constraints are satisfied by means of the twin-node family strategy. In this work to solve each nonlinear convex subproblem at each node we propose the solution of sequences of quadratic subproblems. Due to the convexity of the constraints we can approximate them by means of outer approximations. These methods have been implemented in C++ with the help of CPLEX 12.1, which only solves the quadratic approximations. The test problems have been randomly generated by using a C++ code developed by this author. Numerical experiments have been performed and its efficiency has been compared with that of a well-known code. Key words: stochastic programming, convex programming, branch and fix coordination, mixed integer nonlinear programming, quadratic programming, outer approximation.

关键词： stochastic programming convex programming branch and fix coordination mixed integer nonlinear programming quadratic programming outer approximation

来源：评论

学校读者我要写书评

暂无评论

Maximizing a class of submodular utility functions with constraints

引用

MATHEMATICAL programming 2017年第1-2期162卷 145-164页

作者： Yu, Jiajin Ahmed, Shabbir Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA

Motivated by stochastic 0-1 integer programming problems with an expected utility objective, we study the mixed-integer nonlinear set: where N is a positive integer, is a concave function, are nonnegative vectors, d is a real number and B is a positive real number. We propose a family of inequalities for the convex hull of P by exploiting submodularity of the function over and the knapsack constraint . Computational effectiveness of the proposed inequalities within a branch-and-cut framework is illustrated using instances of an expected utility capital budgeting problem.

关键词： Submodularity Cutting planes Lifting mixed integer nonlinear programming Branch-and-cut

来源：评论

学校读者我要写书评

暂无评论

Covering a line segment with variable radius discs

引用

COMPUTERS & OPERATIONS RESEARCH 2009年第5期36卷 1423-1436页

作者： Agnetis, Alessandro Grande, Enrico Mirchandani, Pitu B. Pacifici, Andrea Univ Arizona ATLAS Ctr Tucson AZ 85721 USA Univ Siena Dipartimento Ingn Informaz I-53100 Siena Italy Univ Roma Tor Vergata Dipartimento Ingn Impresa I-00133 Rome Italy

The paper addresses the problem of locating sensors with a circular field of view so that it given line segment is under full Surveillance, which is termed as the disc covering problem on a line. The cost of each sensor includes a fixed component f, and a variable component that is a convex function of the diameter of the field-of-view area. When only one type of sensor or, in general. one type of disc, is available, then a simple polynomial algorithm solves the problem. When (here are different types of sensors, the problem becomes hard. A branch-and-bound algorithm as well as an efficient heuristic are developed for the special case in which the variable cost component of each sensor is proportional to the square of the measure of the field-of-view area. The heuristic very often obtains the optimal solution as shown in extensive computational testing.

关键词： Sensor location Network covering problems mixed integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Distributed implementation of generation scheduling algorithm on interconnected power systems

引用

ENERGY CONVERSION AND MANAGEMENT 2011年第12期52卷 3457-3464页

作者： Chung, K. H. Kim, B. H. Hur, D. Kwangwoon Univ Dept Elect Engn Seoul 139701 South Korea Korea Electrotechnol Res Inst Uiwang City 437808 Gyeonggi Provin South Korea Hongik Univ Sch Elect & Elect Engn Seoul 121791 South Korea

The emphasis in this paper is on investigating a new generation scheduling algorithm for the interconnected power systems. In general, the generation scheduling problem formulated as a mixed integer nonlinear programming (MINLP) can be efficiently computed by the generalized Benders decomposition (GBD) technique which decouples an original problem into the master problem and subproblems to allow remarkably fast and accurate solutions of very large problems. In order to ferret out efficient inter-temporal optimal power flow subproblems, we will propose a regional decomposition framework based on auxiliary problem principle (APP). Obviously, this scheme can find the most economic dispatch (ED) schedule under the power transactions for a multi-utility system without the exchange of each utility's own private information and major disruption to existing ED or optimal power flow (OPF) constructed by individual utilities. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Auxiliary problem principle Benders decomposition Distributed optimal power flow Economic dispatch Generation scheduling Interconnected power system mixed integer nonlinear programming Unit commitment

来源：评论

学校读者我要写书评

暂无评论

Reformulations in mathematical programming: automatic symmetry detection and exploitation

引用

MATHEMATICAL programming 2012年第1-2期131卷 273-304页

作者： Liberti, Leo Ecole Polytech LIX F-91128 Palaiseau France

If a mathematical program has many symmetric optima, solving it via Branch-and-Bound techniques often yields search trees of disproportionate sizes;thus, finding and exploiting symmetries is an important task. We propose a method for automatically finding the formulation group of any given mixed-integer nonlinear Program, and for reformulating the problem by means of static symmetry breaking constraints. The reformulated problem-which is likely to have fewer symmetric optima-can then be solved via standard Branch-and-Bound codes such as CPLEX (for linear programs) and Couenne (for nonlinear programs). Our computational results include formulation group tables for the MIPLib3, MIPLib2003, GlobalLib and MINLPLib instance libraries and solution tables for some instances in the aforementioned libraries.

关键词： Group Symmetry mixed integer nonlinear programming Branch and bound

来源：评论

学校读者我要写书评

暂无评论

Hybrid MPC System for Platoon based Cooperative Lane change Control Using Machine Learning Aided Distributed Optimization

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2022年 159卷 104-142页

作者： Zhang, Hanyu Du, Lili Shen, Jinglai Univ Florida Dept Civil & Coastal Engn Gainesville FL 32608 USA Univ Maryland Dept Math & Stat Baltimore MD 21250 USA

This study is devoted to developing a platoon-based cooperative lane-change control (PB-CLC). It coordinates the trajectories of a CAV platoon under a platoon-centered platooning control to accommodate the CAV lane-change requests from its adjacent lane, aiming to reduce the negative traffic impacts on the platoon resulting from lane-change maneuvers, on the premise of ensuring CAVs' safety and mobility. Mathematically, the PB-CLC control is established using a hybrid model predictive control (MPC) system. The hybrid MPC system involves an MPC-based mixed integer nonlinear programming optimizer (MINLP-MPC) for optimal lane-change decisions, which considers multiple objectives such as traffic smoothness, driving comfort and lane-change response promptness subject to vehicle dynamics and safety constraints. To ensure the feasible lane-change, this study investigates and provides a lower bound of the lane-change time window by analyzing the MINLP-MPC model feasibility. Apart from the optimal lane-change decision consideration, the hybrid MPC system is well designed to ensure the control continuity and smoothness. In particular, the hybrid MPC system control feasibility and stability are proved to enable the platoon's back-and-forth state switchings between car-following and lane-change accommodation states. Next, we developed a machine learning aided distributed branch and bound algorithm (ML-DBB) to solve the MINLP-MPC model within a control sampling time interval (< 1 second). Specifically, built upon computer simulation and the c-LHS sampling technique, supervised machine learning models are developed offline to predict a reduced solution space of the integer variables, which is further integrated into the distributed branch and bound method to solve the MINLP-MPC model efficiently online. Extensive numerical experiments validate the effectiveness and applicability of the ML-DBB algorithm and the PB-CLC control.

关键词： connected and autonomous vehicles cooperative lane-change vehicle platooning model predictive control hybrid system controller mixed integer nonlinear programming supervised machine learning distributed branch and bound

来源：评论

学校读者我要写书评

暂无评论

A mixed integer Formulation for Energy-efficient Multistage Adsorption Dryer Design

引用

DRYING TECHNOLOGY 2012年第8期30卷 873-883页

作者： Atuonwu, J. C. van Straten, G. van Deventer, H. C. van Boxtel, A. J. B. Wageningen Univ Syst & Control Grp NL-6700 AA Wageningen Netherlands TNO NL-3700 AJ Zeist Netherlands

This work presents a mixed integer nonlinear programming (MINLP) formulation for the design of energy-efficient multistage adsorption dryers within constraints on product temperature and moisture content. Apart from optimizing temperatures and flows, the aim is to select the most efficient adsorbent per stage and product to air flow configuration. Superstructure models consisting of commonly used adsorbents such as zeolite, alumina, and silica-gel are developed and optimized for a two-stage, low-temperature, adsorption drying system. Results show that the optimal configuration is a hybrid system with zeolite as the first-stage adsorbent and silica-gel as the second-stage adsorbent in counter-current flow between drying air and product. A specific energy consumption of 2,275 kJ/kg is achieved, which reduces to 1,730 kJ/kg with heat recovery by a heat exchanger. Compared to a conventional two-stage dryer at the same drying temperature, this represents a 59% reduction in energy consumption. The optimal system ensures the exhaust air temperature of the first-stage regenerator is high enough to regenerate the second-stage adsorbent so no utility energy is spent in the second stage. A higher second-stage adsorbent wheel speed favors energy performance as it becomes optimized for energy recovery while the first is optimized for dehumidification. Although this work considers three candidate adsorbents in a two-stage system, the same reasoning can be applied to systems with more stages and adsorbents. The developed superstructure optimization methodology can, by extension, be applied to optimize multistage hybrid drying systems in general for any objective.

关键词： Adsorption drying Dryer energy optimization Hybrid dryers mixed integer nonlinear programming Multistage dryers Product quality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：