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

Minimizing energy and cost in range-limited drone deliveries with speed optimization

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2021年 125卷 102985-102985页

作者： Dukkanci, Okan Kara, Bahar Y. Bektas, Tolga European Univ Viadrina Fac Business Adm & Econ D-15230 Frankfurt Germany Bilkent Univ Dept Ind Engn TR-06800 Ankara Turkey Univ Liverpool Management Sch Liverpool L69 7ZH Merseyside England

This paper introduces the Energy Minimizing and Range Constrained Drone Delivery Problem (ERDDP) in which drones are used to make deliveries to a number of customers and the drones themselves are transported by traditional vehicles that act as launch points. The ERDDP consists of (i) selecting the launch points from a potential set of sites from where drones will take off to serve a number of customers, (ii) assignments of customers to the launch points, and (iii) the speed at which drones are to travel between the customers and the launch points. The paper presents a nonlinear model for the ERDDP, which minimizes the total operational cost including an explicit calculation of the energy consumption of the drone as a function of the drone speed. The deliveries are limited by both a service time bound and the range of the drone. The model is reformulated using second order cone programming, and subsequently strengthened by the use of perspective cuts, that allows the use of off-the-shelf optimization software to solve the problem. Computational results are presented on a realistic data set that quantifies the effect of various parameters on location, assignment and speed decisions.

关键词： Drone delivery Energy consumption Freight transportation second order cone programming Perspective cuts

来源：评论

学校读者我要写书评

暂无评论

Power Loss Reduction in the Energy Resource Scheduling of a Local Energy Community 3

Power Loss Reduction in the Energy Resource Scheduling of a ...

引用

3rd International Conference on Smart Energy Systems and Technologies (SEST)

作者： Gambini, Maria Maddalena Orozco, Camilo Borghetti, Alberto Tossani, Fabio Univ Bologna Dept Elect Elect & Informat Engn Bologna Italy

ISBN: (数字)9781728147017

ISBN: (纸本)9781728147017

The paper focuses on the minimization of the energy procurement cost in the day-ahead optimization of the operation of a local energy community. The community is a set of prosumers, each of them equipped with local generation, energy storage systems and loads. The procedure is based on the classical second order cone programming (SOCP) formulation of the distribution optimal power flow and distinguishes between the power exchanged with the external grid and the power exchanges between the prosumers in order to prioritize the use of local energy resources. The performance of the proposed procedure is shown for various operating conditions of a distribution network in which direct transactions between prosumers connected to different feeders of the same substation are allowed.

关键词： battery energy storage energy scheduling local energy community renewable resources second order cone programming

来源：评论

学校读者我要写书评

暂无评论

Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems

引用

EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION 2021年 9卷

作者： Duer, Mirjam Rendl, Franz Augsburg Univ Dept Math D-86135 Augsburg Germany Alpen Adria Univ Klagenfurt Dept Math A-9020 Klagenfurt Austria

A conic optimization problem is a problem involving a constraint that the optimization variable be in some closed convex cone. Prominent examples are linear programs (LP), second order cone programs (SOCP), semidefinite problems (SDP), and copositive problems. We survey recent progress made in this area. In particular, we highlight the connections between nonconvex quadratic problems, binary quadratic problems, and copositive optimization. We review how tight bounds can be obtained by relaxing the copositivity constraint to semidefiniteness, and we discuss the effect that different modelling techniques have on the quality of the bounds. We also provide some new techniques for lifting linear constraints and show how these can be used for stable set and coloring relaxations.

关键词： Semidefinite programming second order cone programming Copositive optimization Binary quadratic optimization

来源：评论

学校读者我要写书评

暂无评论

Formulation of min-max model predictive control as a box-constrained robust least squares estimation problem 21st

Formulation of min-max model predictive control as a box-con...

引用

21st IFAC World Congress on Automatic Control - Meeting Societal Challenges

作者： Jetto, L. Orsini, V Univ Politecn Marche Via Brecce Bianche Ancona Italy

The purpose of this paper is to propose a new approach to the Min-Max Model Predictive Control (MMMPC) of Linear Time-Invariant Discrete-time Polytopic (LTIDP) systems. The purpose is to simplify the treatment of complex issues like stability and feasibility analysis of robust MPC as well as to reduce the complexity of the relative optimization procedure. The new approach is based on a two Degrees Of Freedom (2DOF) control scheme where the output r(k) of the feedforward Input Estimator (IE) is used as input forcing a stable closed-loop system Sigma(f). Sigma(f) is the feedback connection of an LTIDP plant Sigma(p )with an LTI dynamic controller Sigma(g). The task of Sigma(g) is to guarantee the quadratic stability of Sigma(f), as well as the fulfillment of hard constraints on some physical variables of Sigma(f) for any input r(k) satisfying an "a priori" determined admissibility condition. The input r(k) is computed by the feedforward IE through the on-line minimization of a worst case finite-horizon quadratic cost functional and is applied to Sigma(f )according to the usual receding horizon strategy. Rather than resorting to an "ad hoc" software, the numerical complexity issue is here addressed reducing the number of both decision variables and constraints involved in the on-line constrained optimization procedure. This is obtained modeling r(k) as a B-spline function, which is known to be a universal approximator which also admits a parsimonious parametric representation. This allows us to reformulate the minimization of the worst case cost functional as a box-constrained Robust Least Squares (RLS) estimation problem which can be efficiently solved using second order cone programming (SOCP). Copyright (C) 2020 The Authors.

关键词： Model Predictive Control Receding Horizon Constrained Optimization second order cone programming

来源：评论

学校读者我要写书评

暂无评论

Robust Scheduling of Water Distribution Networks 6

Robust Scheduling of Water Distribution Networks

引用

6th Conference on Advances in Control and Optimization of Dynamical Systems (ACODS)

作者： Velmurugan, Sajay Kurian, Varghese Mohandoss, Prasanna Narasimhan, Shankar Narasimhan, Sridharakumar Indian Inst Technol Madras Dept Chem Engn Chennai Tamil Nadu India

Optimal operation of water distribution networks can be posed as a scheduling problem where the objective is to meet the time varying demand while meeting constraints on supply, pressure etc. In the present work, we propose a robust optimization problem to address uncertainty in the parameters of the model used for optimization. The resulting problem is a second order cone program that can be solved efficiently. The formulation ensures a high probability of meeting the demands, adding to the practical significance. Further, we provide the results of applying this technique on a laboratory scale water distribution network. (C) 2020, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Water distribution networks Scheduling algorithms second order cone programming

来源：评论

学校读者我要写书评

暂无评论

Constrained Spacecraft Attitude Optimal Control via Successive Convex Optimization

Constrained Spacecraft Attitude Optimal Control via Successi...

引用

作者： Jiayao Wang Haibin Shang School of Aerospace Engineering Beijing Institute of Technology

Rapid attitude path planning is the key technique in autonomous spacecraft operation *** efficient method is proposed for energy-optimal spacecraft attitude control in presence of ***,Gauss pseudospectral method is utilized to discretize and transcribe the primal continuous problem to a nonlinear programming *** a set of convexification techniques are used to convexify the nonlinear programming problem to a series of second-order cone programming problems,which can be solved iteratively by the interiorpoint method.A solution to the nonlinear programming problem is obtained as the iteration *** results show the method could obtain a valid energy-optimal attitude control plan more rapidly than traditional methods.

关键词： Spacecraft attitude Maneuver path planning second order cone programming

来源：评论

学校读者我要写书评

暂无评论

Smoothed finite element approach for kinematic limit analysis of cohesive frictional materials

引用

EUROPEAN JOURNAL OF MECHANICS A-SOLIDS 2019年第0期76卷 328-345页

作者： Mohapatra, Debasis Kumar, Jyant Indian Inst Sci Dept Civil Engn Bengaluru 560012 India

By employing different smoothed finite element (S-FE) methods, the kinematic limit analysis approach has been presented by using three noded triangular elements to solve plane strain and plane stress stability problems on basis of the Mohr-Coulomb yield criterion. By using the concept of duality in conic programming, the expressions for the power dissipation function and the associated constraints have been written entirely in terms of kinematic variables. The optimization formulation is framed as a second order cone programming problem. Based on the absolute maximum magnitude of the shear strain rate, an algorithm to update the mesh has been provided. Amongst the different approaches, the node-based S-FE formulation has been found to be very accurate as well as efficient to solve large scale stability problems. The selective edge-based and the edge-based with a bubble node approaches also generate quite accurate solutions though require a little more computational time.

关键词： Finite elements Limit analysis Optimization second order cone programming Strain smoothing

来源：评论

学校读者我要写书评

暂无评论

Multi-stage active management of renewable-rich power distribution network to promote the renewable energy consumption and mitigate the system uncertainty

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2019年第Oct.期111卷 436-446页

作者： Zhu, Junpeng Yuan, Yue Wang, Weisheng Hohai Univ Coll Energy & Elect Engn Nanjing 211100 Jiangsu Peoples R China China Elect Power Res Inst State Key Lab Operat & Control Renewable Energy & Beijing 100192 Peoples R China

This paper presents a multi-stage management scheme for renewable-rich medium voltage distribution network (MVDN) to promote the renewable energy consumption and mitigate the system uncertainty. In the first stage, a day-ahead (DA) dispatch model is proposed to promote the renewable distributed generation (RDG) consumption and decrease the power loss. In the second stage, a model predictive control (MPC) based rolling optimization model for intra-day (ID) operation is proposed to minimize the mismatch of the interactive power at the upstream Grid Supply Point (GSP) between the DA schedule and ID operation. Multiple active management elements such as network reconfiguration and soft open point are integrated and a novel second order cone programming (SOCP) model for the centralized optimal power flow in the DA and ID stages is presented. In the third stage, a decentralized P/Q(V) control strategy of RDG inverter for real-time (RT) voltage regulation is proposed to ensure system safety and mitigate the fast voltage fluctuation. The effectiveness of proposed management scheme is demonstrated in a test system integrating a standard network and real-world data of load and RDG output profiles.

关键词： Active distributed network Renewable energy Distributed generator second order cone programming Voltage control

来源：评论

学校读者我要写书评

暂无评论

Green hub location problem

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2019年 125卷 116-139页

作者： Dukkanci, Okan Peker, Meltem Kara, Bahar Y. Bilkent Univ Dept Ind Engn TR-06800 Ankara Turkey

This paper introduces the green hub location problem that finds the best locations for hubs, assignments of demand nodes to these hubs and speed of trucks/flights so as to route the demand between any origin-destination pairs. The aim of the service provider is to minimize the total amount of emissions that depends on vehicle speed and payload while routing the deliveries within a predetermined service time limit. In this study, we first propose a nonlinear model for this problem, which is then reformulated as a second order cone programming formulation. We strengthen the new model by using perspective reformulation approach. An extensive computational study on the CAB and TR datasets demonstrates the benefits of incorporating green transportation service activities to the classic hub location problems. We also provide insights for the carrier companies by analyzing the solutions with different discount factors, service time limits and number of hubs.

关键词： Hub location Green transportation second order cone programming Perspective cuts

来源：评论

学校读者我要写书评

暂无评论

Convex Relaxations and Approximations of Chance-Constrained AC-OPF Problems

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2019年第2期34卷 1459-1470页

作者： Halilbasic, Lejla Pinson, Pierre Chatzivasileiadis, Spyros Tech Univ Denmark Dept Elect Engn DK-2800 Lyngby Denmark

This paper deals with the impact of linear approximations for the unknown nonconvex confidence region of chance-constrained ac optimal power flow problems. Such approximations are required for the formulation of tractable chance constraints. In this context, we introduce the first formulation of a chance-constrained second-order cone (SOC) OPF. The proposed formulation provides convergence guarantees due to its convexity, while it demonstrates high computational efficiency. Combined with an ac feasibility recovery, it is able to identify better solutions than chance-constrained nonconvex ac-OPF formulations. To the best of our knowledge, this paper is the first to perform a rigorous analysis of the ac feasibility recovery procedures for robust SOC-OPF problems. We identify the issues that arise from the linear approximations, and by using a reformulation of the quadratic chance constraints, we introduce new parameters able to reshape the approximation of the confidence region. We demonstrate our method on the IEEE 118-bus system.

关键词： Chance-constrained AC-OPF convex relaxations second order cone programming AC feasibility recovery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：