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

Integrated UAV Trajectory Control and Resource Allocation for UAV-Based Wireless Networks With Co-Channel Interference Management

引用

IEEE INTERNET OF THINGS JOURNAL 2021年第14期9卷 12754-12769页

作者： Minh Dat Nguyen Long Bao Le Girard, Andre Univ Quebec Inst Natl Rech Sci Energie Mat & Telecommun Montreal PQ H5A 1K6 Canada

In this article, we study the trajectory control, subchannel assignment, and user association design for unmanned aerial vehicles (UAVs)-based wireless networks. We propose a method to optimize the max-min average rate subject to data demand constraints of ground users (GUs) where spectrum reuse and co-channel interference management are considered. The mathematical model is a mixed-integer nonlinear optimization problem which we solve by using the alternating optimization approach where we iteratively optimize the user association, subchannel assignment, and UAV trajectory control until convergence. For the subchannel assignment subproblem, we propose an iterative subchannel assignment (ISA) algorithm to obtain an efficient solution. Moreover, the successive convex approximation (SCA) is used to convexify and solve the nonconvex UAV trajectory control subproblem. Via extensive numerical studies, we illustrate the effectiveness of our proposed design considering different UAV flight periods and number of subchannels and GUs as compared with a simple heuristic.

关键词： Trajectory Autonomous aerial vehicles Optimization Channel allocation Wireless networks Internet of Things Bandwidth mixed-integer nonlinear programming subchannel assignment unmanned aerial vehicle (UAV) trajectory user association

来源：评论

学校读者我要写书评

暂无评论

LORM: Learning to Optimize for Resource Management in Wireless Networks With Few Training Samples

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2020年第1期19卷 665-679页

作者： Shen, Yifei Shi, Yuanming Zhang, Jun Letaief, Khaled B. Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Peoples R China ShanghaiTech Univ Sch Informat Sci & Technol Shanghai 201210 Peoples R China Hong Kong Polytech Univ Dept Elect & Informat Engn Hong Kong Peoples R China

Effective resource management plays a pivotal role in wireless networks, which, unfortunately, typically results in challenging mixed-integer nonlinear programming (MINLP) problems. Machine learning-based methods have recently emerged as a disruptive way to obtain near-optimal performance for MINLPs with affordable computational complexity. There have been some attempts in applying such methods to resource management in wireless networks, but these attempts require huge amounts of training samples and lack the capability to handle constrained problems. Furthermore, they suffer from severe performance deterioration when the network parameters change, which commonly happens and is referred to as the task mismatch problem. In this paper, to reduce the sample complexity and address the feasibility issue, we propose a framework of Learning to Optimize for Resource Management (LORM). In contrast to the end-to-end learning approach adopted in previous studies, LORM learns the optimal pruning policy in the branch-and-bound algorithm for MINLPs via a sample-efficient method, namely, imitation learning. To further address the task mismatch problem, we develop a transfer learning method via self-imitation in LORM, named LORM-TL, which can quickly adapt a pre-trained machine learning model to the new task with only a few additional unlabeled training samples. Numerical simulations demonstrate that LORM outperforms specialized state-of-the-art algorithms and achieves near-optimal performance, while providing significant speedup compared with the branch-and-bound algorithm. Moreover, LORM-TL, by relying on a few unlabeled samples, achieves comparable performance with the model trained from scratch with sufficient labeled samples.

关键词： Resource management Optimization Machine learning algorithms Wireless networks Training Machine learning Heuristic algorithms Resource allocation mixed-integer nonlinear programming wireless communications few-shot learning transfer learning

来源：评论

学校读者我要写书评

暂无评论

Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2008年第3期191卷 1223-1240页

作者： Aras, Necati Aksen, Deniz Tanugur, Ayse Goenuel Bogazici Univ Dept Ind Engn Istanbul Turkey Koc Univ Coll Adm Sci & Econ Istanbul Turkey

We address the problem of locating collection centers of a company that aims to collect used products from product holders. The remaining value in the used products that can be captured by recovery operations is the company's motivation for the collection operation. We assume that a pick-up strategy is in place according to which vehicles with limited capacity are dispatched from the collection centers to the locations of product holders to transport the returns. Each product holder has an inherent willingness to return, and makes the decision on the basis of the financial incentive offered by the company. The incentive depends on the condition of the returned item referred to as return type. We formulate a mixed-integer nonlinear facility location-allocation model to find both the optimal locations of a predetermined number of collection centers and the optimal incentive values for different return types. Since the problem is NP-hard, we propose a heuristic method to solve medium and large-size instances. The main loop of the method is based on a tabu search method performed in the space of collection center locations. For each location set prescribed by tabu search, Nelder-Mead simplex search is called to obtain the best incentives and the corresponding net profit. We experiment with different quality profiles when there are two and three return types, and observe the effect of the uniform incentive policy (UIP) in which the same incentive is offered to product holders regardless of the quality of their returns. We conclude that the UIP is inferior to the quality-dependent incentive policy resulting in a higher profit loss when the proportion of lowest quality returns is relatively high. (C) 2007 Elsevier B.V. All rights reserved.

关键词： reverse logistics network design location-allocation mixed-integer nonlinear programming tabu search metaheuristics capacitated pick-up

来源：评论

学校读者我要写书评

暂无评论

Minimizing pump energy in a wastewater processing plant

引用

ENERGY 2012年第1期47卷 505-514页

作者： Zhang, Zijun Zeng, Yaohui Kusiak, Andrew Univ Iowa Dept Mech & Ind Engn Seamans Ctr 3131 Iowa City IA 52242 USA

This paper discusses energy savings in wastewater processing plant pump operations and proposes a pump system scheduling model to generate operational schedules to reduce energy consumption. A neural network algorithm is utilized to model pump energy consumption and fluid flow rate after pumping. The scheduling model is a mixed-integer nonlinear programming problem (MINLP). As solving a data-driven MINLP is challenging, a migrated particle swarm optimization algorithm is proposed. The modeling and optimization results show that the performance of the pump system can be significantly improved based on the computed schedules. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： mixed-integer nonlinear programming Energy saving Data mining Pump control Particle swarm optimization Neural networks

来源：评论

学校读者我要写书评

暂无评论

AN EXTENDED CUTTING PLANE METHOD FOR SOLVING CONVEX MINLP PROBLEMS

引用

COMPUTERS & CHEMICAL ENGINEERING 1995年第0期19卷 S131-S136页

作者： WESTERLUND, T PETTERSSON, F Process Design Laboratory at &Aring bo Akademi University Biskopsgatan 8 FIN-20500 &Aring bo Finland

An extended version of Kelley's cutting plane method is introduced in the present paper. The extended method can be applied for the solution of convex MINLP (mixed-integer non-linear programming) problems, while Kelley's cutting plane method was originally introduced for the solution of convex NLP (non-linear programming) problems only. The method is suitable for solving large convex MINLP problems with a moderate degree of nonlinearity. The convergence properties of the method are given in the present paper and an example is provided to illustrate the numerical procedure.

关键词： OPTIMIZATION mixed-integer nonlinear programming integer nonlinear programming EXTENDED CUTTING PLANE

来源：评论

学校读者我要写书评

暂无评论

Informing pediatric vaccine procurement policy via the pediatric formulary design, pricing, and production problem

引用

IIE TRANSACTIONS 2016年第12期48卷 1112-1126页

作者： Lunday, Brian Robbins, Matthew J. Air Force Inst Technol Dept Operat Sci Wright Patterson AFB OH USA

This research improves upon the monopsonist vaccine formulary design problem in the literature by incorporating several modeling enhancements and applying different methodologies to efficiently obtain solutions and derive insights. Our multi-objective formulation seeks to minimize the overall price to immunize a cohort of children, maximize the net profit shared among pediatric vaccine manufacturers, and minimize the average number of injections per child among the prescribed formularies. Accounting for Centers for Disease Control and Prevention (CDC) guidelines, we restrict vaccines utilized against a given disease within a given formulary to those produced by a single manufacturer. We also account for a circumstance in which one manufacturer's vaccine has a greater relative efficacy. For the resulting nonconvex mixed-integer nonlinear program, we bound the second and third objectives using optimal formulary designs for current public sector prices and utilize the E -constraint method to solve an instance representative of contemporary immunization schedule requirements. Augmenting our formulation with symmetry reduction constraints to reduce the required computational effort, we identify a set of non-inferior solutions. Of practical interest to the CDC, our model enables the design of a pricing and purchasing policy, creating a sustainable and stable capital investment environment for the provision of pediatric vaccines.

关键词： Multi-objective optimization mixed-integer nonlinear programming vaccine economics

来源：评论

学校读者我要写书评

暂无评论

Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation

引用

OPTIMIZATION METHODS & SOFTWARE 2017年第4期32卷 719-737页

作者： Castro, Pedro M. Univ Lisbon Ctr Matemat Aplicacoes Fundamentais & Invest Oper Fac Ciencias P-1749016 Lisbon Portugal

Spatial branch-and-bound (B&B) is widely used for the global optimization of non-convex problems. It basically works by iteratively reducing the domain of the variables so that tighter relaxations can be achieved that ultimately converge to the global optimal solution. Recent developments for bilinear problems have brought us piecewise relaxation techniques that can prove optimality for a sufficiently large number of partitions and hence avoid spatial B&B altogether. Of these, normalized multiparametric disaggregation (NMDT) exhibits a good performance due to the logarithmic increase in the number of binary variables with the number of partitions. We now propose to integrate NMDT with spatial B&B for solving mixed-integer quadratically constrained minimization problems. Optimality-based bound tightening is also part of the algorithm so as to compute tight lower bounds in every step of the search and reduce the number of nodes to explore. Through the solution of a set of benchmark problems from the literature, it is shown that the new global optimization algorithm can potentially lead to orders of magnitude reduction in optimality gap when compared to commercial solvers BARON and GloMIQO.

关键词： mixed-integer nonlinear programming nonlinear programming quadratic optimization discretization bilinear terms

来源：评论

学校读者我要写书评

暂无评论

Bunker consumption optimization methods in shipping: A critical review and extensions

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2013年第1期53卷 49-62页

作者： Wang, Shuaian Meng, Qiang Liu, Zhiyuan Univ Wollongong Sch Math & Appl Stat Wollongong NSW 2522 Australia Natl Univ Singapore Dept Civil & Environm Engn Singapore 117576 Singapore Monash Univ Inst Transport Studies Dept Civil Engn Clayton Vic 3800 Australia

It is crucial nowadays for shipping companies to reduce bunker consumption while maintaining a certain level of shipping service in view of the high bunker price and concerned shipping emissions. After introducing the three bunker consumption optimization contexts: minimization of total operating cost, minimization of emission and collaborative mechanisms between port operators and shipping companies, this paper presents a critical and timely literature review on mathematical solution methods for bunker consumption optimization problems. Several novel bunker consumption optimization methods are subsequently proposed. The applicability, optimality, and efficiency of the existing and newly proposed methods are also analyzed. This paper provides technical guidelines and insights for researchers and practitioners dealing with the bunker consumption issues. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Shipping Sailing speed Bunker consumption optimization mixed-integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs

引用

JOURNAL OF GLOBAL OPTIMIZATION 2019年第3期75卷 595-629页

作者： Ogbe, Emmanuel Li, Xiang Queens Univ Dept Chem Engn Kingston ON K7L 3N6 Canada

This paper proposes a joint decomposition method that combines Lagrangian decomposition and generalized Benders decomposition, to efficiently solve multiscenario nonconvex mixed-integer nonlinear programming (MINLP) problems to global optimality, without the need for explicit branch and bound search. In this approach, we view the variables coupling the scenario dependent variables and those causing nonconvexity as complicating variables. We systematically solve the Lagrangian decomposition subproblems and the generalized Benders decomposition subproblems in a unified framework. The method requires the solution of a difficult relaxed master problem, but the problem is only solved when necessary. Enhancements to the method are made to reduce the number of the relaxed master problems to be solved and ease the solution of each relaxed master problem. We consider two scenario-based, two-stage stochastic nonconvex MINLP problems that arise from integrated design and operation of process networks in the case study, and we show that the proposed method can solve the two problems significantly faster than state-of-the-art global optimization solvers.

关键词： Generalized Benders decomposition Dantzig-Wolfe decomposition Lagrangian decomposition Joint decomposition mixed-integer nonlinear programming Global optimization Stochastic programming

来源：评论

学校读者我要写书评

暂无评论

Material stream network modeling, retrofit and optimization for raw natural gas refining systems

引用

JOURNAL OF CLEANER PRODUCTION 2017年第Part4期142卷 3419-3436页

作者： Zhang, Bing J. Xu, Tao He, Chang Chen, Qing L. Luo, Xiang L. Sun Yat Sen Univ Sch Chem Engn & Technol Guangdong Engn Technol Res Ctr Petrochem Energy C 135 Xingang West Rd Guangzhou 510275 Guangdong Peoples R China Guangdong Univ Technol Sch Mat & Energy Guangzhou Higher Educ Mega Ctr 100 Waihuan West Rd Guangzhou 510006 Guangdong Peoples R China

The demand for natural gas is increasing in the energy market because of its lower emissions and sustainable development. This increasing demand for natural gas promotes the capacity expansion of raw natural gas refining systems (RNGRSs), resulting in parallel refining processes in a RNGRS. Optimizing the material stream network between these refining processes is very challenging because of the complex thermodynamics, unit operations and utility configurations. An optimization framework is presented for the retrofit of the material stream network between these refining processes to improve the economic performance. The retrofit framework integrates raw natural gas supply, refining processes, utility subsystems and product delivery and is formulated as a mixed-integer nonlinear programming (MINLP) optimization model to obtain an optimal material stream network to increase profit. The model presented here is applied to a Chinese industrial RNGRS and results in an optimal retrofit. A comparison before and after the retrofit demonstrates a significant increase in profit. Crown Copyright (C) 2016 Published by Elsevier Ltd on behalf of The Royal College of Radiologists. All rights reserved.

关键词： Raw natural gas Retrofit Optimization mixed-integer nonlinear programming Process modeling Utility system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：