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

Optimal allocation of electric vehicle charging stations and distributed generation in radial distribution networks

ENGINEERING SCIENCE AND TECHNOLOGY-AN INTERNATIONAL JOURNAL-JESTECH 2024年 60卷

作者： Soliman, Ismail A. Tulsky, Vladimir Abd el-Ghany, Hossam A. Elgebaly, Ahmed E. Tanta Univ Fac Engn Elect Power & Machines Engn Dept Tanta Egypt NRU Moscow Power Engn Inst Elect Power Syst Dept Moscow 111250 Russia

The widespread spread of electric vehicles requires the establishment of charging stations (EVCSs), and this is considered a large load on the network. This gives priority to distributing the stations in a way that reduces the load on the network, and in parallel, re-planning the network and supplying it with the necessary energy to maintain energy efficiency and power quality. Total energy loss minimization, voltage deviation minimization, and voltage stability index improvement are the considered power quality indices in the multi-objective function. Vehicle to grid (V2G) feature, distributed generation units (DG), and capacitor banks are used for improving system performance, by injecting the required active and reactive power. In addition, the initial and running costs of V2G, DG units, and capacitor banks are considered in the multi-objective function. The optimal sizing and allocation of charging stations, V2G, DG units, and capacitor banks are performed using a proposed SelfAdaptive Multi-Population Elitist JAYA (SAMPE-JAYA) algorithm and checked using the genetic algorithm (GA). The proposed algorithm is tested using various scenarios, two standard IEEE test systems. To emphasize the effectiveness and applicability of the proposed algorithm, it is applied on a real-world distribution system. To accommodate the optimal allocation of EVCS, which constitute 80.7% and 78.9% of the base active load for the IEEE 33 and 69 bus systems, respectively. Integrating DG amounting to 17.35 % and 18.25 % of the base load is necessary. Additionally, capacitor banks, contributing 36.84 % and 31.166% of the reactive power load, are also required for effective voltage support and system reliability in each respective case.

关键词： Electric vehicle charging stations optimization algorithms Vehicle to grid Power quality Capacitors allocation Distributed generation

来源：评论

学校读者我要写书评

暂无评论

On Robustness in optimization-Based Constrained Iterative Learning Control

引用

IEEE CONTROL SYSTEMS LETTERS 2022年 6卷 2846-2851页

作者： Liao-McPherson, Dominic Balta, Efe C. Rupenyan, Alisa Lygeros, John Swiss Fed Inst Technol Automat Control Lab CH-8092 Zurich Switzerland Inspire AG Automat Optimierung & Mechatron English Automat O CH-8005 Zurich Switzerland

Iterative learning control (ILC) is a control strategy for repetitive tasks wherein information from previous runs is leveraged to improve future performance. optimization-based ILC (OB-ILC) is a powerful design framework for constrained ILC where measurements from the process are integrated into an optimization algorithm to provide robustness against noise and modelling error. This paper proposes a robust ILC controller for constrained linear processes based on the forward-backward splitting algorithm. It demonstrates how structured uncertainty information can be leveraged to ensure constraint satisfaction and provides a rigorous stability analysis in the iteration domain by combining concepts from monotone operator theory and robust control. Numerical simulations of a precision motion stage support the theoretical results.

关键词： optimization Convergence Uncertainty Robustness Task analysis Robust control Noise measurement optimization algorithms robust control iterative learning control manufacturing systems and automation

来源：评论

学校读者我要写书评

暂无评论

Global Convergence and Asymptotic Optimality of the Heavy Bell Method for a Class of Nonconvex optimization Problems

引用

IEEE CONTROL SYSTEMS LETTERS 2022年 6卷 2449-2454页

作者： Ugrinovskii, V Petersen, I. R. Shames, I Australian Natl Univ Res Sch Engn Canberra ACT 2601 Australia Australian Natl Univ Sch Engn CIICADA Lab Canberra ACT 2601 Australia

In this letter we revisit the famous heavy ball method and study its global convergence for a class of non-convex problems with sector-bounded gradient. We characterize the parameters that render the method globally convergent and yield the best R-convergence factor. We show that for this family of functions, this convergence factor is superior to the factor obtained from the triple momentum method.

关键词： optimization algorithms robust control

来源：评论

学校读者我要写书评

暂无评论

QPALM-OCP: A Newton-Type Proximal Augmented Lagrangian Solver Tailored for Quadratic Programs Arising in Model Predictive Control

引用

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 1349-1354页

作者： Lowenstein, Kristoffe Fink Bernardini, Daniele Patrinos, Panagiotis Politecn Milan Dipartimento Elettron Informaz & Bioingn I-20133 Milan Italy ODYS Srl I-20159 Milan Italy Katholieke Univ Leuven Dept Elect Engn ESAT STADIUS B-3001 Leuven Belgium

In model predictive control fast and reliable quadratic programming solvers are of fundamental importance. The inherent structure of the subsequent optimal control problems can lead to substantial performance improvements if exploited. Therefore, we present a structure-exploiting solver based on proximal augmented Lagrangian, extending the general-purpose quadratic programming solver QPALM. Our solver relies on semismooth Newton iterations to solve the inner sub-problem while directly accounting for the optimal control problem structure via efficient and sparse matrix factorizations. The matrices to be factorized depend on the active-set and therefore low-rank factorization updates can be employed like in active-set methods resulting in cheap iterates. We compare our solver with QPALM and other well-known solvers and show its benefits in a numerical example.

关键词： optimization algorithms optimal control predictive control for nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

Accelerated algorithms for Constrained Nonconvex-Nonconcave Min-Max optimization and Comonotone Inclusion

arXiv

引用

arXiv 2022年

作者： Cai, Yang Oikonomou, Argyris Zheng, Weiqiang Department of Computer Science Yale University New Haven United States

We study constrained comonotone min-max optimization, a structured class of nonconvex-nonconcave min-max optimization problems, and their generalization to comonotone inclusion. In our first contribution, we extend the Extra Anchored Gradient (EAG) algorithm, originally proposed by Yoon & Ryu (2021) for unconstrained min-max optimization, to constrained comonotone min-max optimization and comonotone inclusion, achieving an optimal convergence rate of O T1 among all first-order methods. Additionally, we prove that the algorithm’s iterations converge to a point in the solution set. In our second contribution, we extend the Fast Extra Gradient (FEG) algorithm, as developed by Lee & Kim (2021), to constrained comonotone min-max optimization and comonotone inclusion, achieving the same O T1 convergence rate. This rate is applicable to the broadest set of comonotone inclusion problems yet studied in the literature. Our analyses are based on simple potential function arguments, which might be useful for analyzing other accelerated algorithms. Copyright © 2022, The Authors. All rights reserved.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhanced efficiency and quality in wind turbine gearbox assembly: a new parallel assembly sequence planning (PASP) model

引用

INTERNATIONAL JOURNAL OF SUSTAINABLE ENGINEERING 2024年第1期17卷 1048-1065页

作者： Mutale, Sydney Wang, Yong Yasir, Jan North China Elect Power Univ Sch New Energy Changping Beijing Peoples R China Univ Zambia Sch Engn Lusaka Zambia

This paper presents two major advances in parallel assembly sequence planning (PASP) for complex systems, specifically wind turbine gearboxes. The proposed time-cost-quality PASP hybrid model (PASP-TCQ) aims to enhance efficiency, reduce costs, and improve quality by aligning optimisation parameters with real-world demands. This model is designed to optimise complex assembly processes by addressing constraints on time, cost, and quality effectively. Additionally, we introduce a particle swarm-bacteria foraging optimisation (PSBFO) algorithm that integrates the global search capability of particle swarm optimisation (PSO) with the local optimisation strengths of bacteria foraging optimisation (BFO). Integrating PSBFO into PASP-TCQ achieves significant improvements: a 17% reduction in assembly time to 100 hours, a 10% cost reduction to $94,500, and a quality index improvement to 0.93. Statistical tests, including analysis of variance (ANOVA) and tukey's honest significant difference (HSD), confirmed the PSBFO's superiority, with significant gains of 8.44 units over BFO and 13.02 units over PSO in objective function values (p < 0.05). Extensive simulations on a 10 MW wind turbine gearbox validate the effectiveness of the PASP-TCQ and PSBFO, demonstrating their potential to enhance efficiency and productivity in industrial assembly operations.

关键词： Parallel assembly sequence planning time-cost-quality hybrid model particle swarm-bacteria foraging optimisation optimization algorithms industrial assembly efficiency wind turbine gearboxes

来源：评论

学校读者我要写书评

暂无评论

Sequential Linear Programming With Adaptive Linearization Error Limits for All-Time Feasibility

引用

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 3051-3056页

作者： Leko, Dorijan Vasak, Mario Univ Zagreb Fac Elect Engn & Comp Dept Control & Comp Engn Zagreb 10000 Croatia

This letter presents an enhanced Trust Region Method (TRM) for Sequential Linear Programming (SLP) designed to improve the initial feasible solution to a constrained nonlinear programming problem while maintaining the interim solutions feasibility throughout the SLP iterations. The method employs a polytopic sub-approximation of the feasible region, defined around the interim solution as a level set based on variable limits for the linearization error. This polytopic feasible region is established by using a trust region that ensures that maximum limits of the linearization errors are respected. The method adaptively adjusts the size of the feasible region during iterations to achieve convergence to a local optimum by employing variable linearization error limits. Local convergence is attained by reducing the size of the trust radius. A case study illustrates the effectiveness of the proposed method, which is compared to the benchmark TRM that uses heuristic limits on the permissible changes in manipulated variables.

关键词： Transmission line measurements Benchmark testing Level set Convergence Navigation Linear programming Heuristic algorithms Vectors Taylor series Programming optimization algorithms optimization computational methods

来源：评论

学校读者我要写书评

暂无评论

Evaluation Of Fracture Energy Of Concrete By Hybrid SVR Analysis

JOURNAL OF APPLIED SCIENCE AND ENGINEERING

引用

JOURNAL OF APPLIED SCIENCE AND ENGINEERING 2024年第12期27卷 3645-3661页

作者： Jiang, Pan Ge, Nan Hebei Univ Water Resources & Elect Engn Dept Civil Engn Cangzhou 061001 Peoples R China North China Univ Sci & Technol Coll Civil & Architectural Engn Tangshan 063210 Peoples R China

Regression techniques were developed to determine the concrete initial (Gf) and total (GF) fracture energy based on prior data using mechanical features and mixed design elements. There were 264 samples retrieved from prior investigations in all. Research contributes to the field by improving the accuracy of predicting concrete fracture energy, offering a methodology for optimizing hyperparameters, and providing a model comparison that demonstrates the practical value of the new approach. These findings can benefit the construction and engineering industries by enhancing the accuracy of material property predictions and improving the quality and safety of constructed structures. This study merged support vector regression (SVR) assessment with arithmetic optimization algorithm (AOA) and whale optimization algorithm (WOA) to predict the Gf and GFF of concrete. The aim of combining the optimization algorithms with SVR analysis was to determine the optimal values of hyperparameters that play pivotal role in developed models' accuracy. The computation and analysis for Gf and GF using five criteria shows that optimized SVR-AOA and SVR-WOA analyses can do admirably well throughout the forecasting model. When the outperforming SVR analysis was compared to the library, it was discovered that the newly constructed SVR-AOA also present a small raise in accuracy, with modification in all metrics. In conclusion, while the SVR-WOA demonstrates its effectiveness in the forecasting outline, the SVR-AOA analysis appears to be a reliable approach for determining accurate Gf values (R2train = 0.921, and R2test = 0.9853) and GF values (R2train = 0.9281, and R2test = 0.9236, as supported by the arguments and feasibility of the models.

关键词： Concrete Fracture energy Support vector regression optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Prediction of shallow foundation settlement: usage of hybridized support vector regression model

引用

MULTISCALE AND MULTIDISCIPLINARY MODELING EXPERIMENTS AND DESIGN 2024年第1期7卷 281-290页

作者： Yang, Xiaochuan Chongqing Coll Finance & Econ Coll Appl Technol Chongqing 402160 Peoples R China

Because of the intricacy of cohesion soil texture, settlement simulation in cohesion materials is a critical subject to address. According to the literature study, shallow foundation prediction did not much considered, so developing optimized models can enhance the forecast accuracy in this field. It is the focus of this research to put newly developed machine learning models, such as hybridized support vector regression (SVR) with firefly algorithm (FFA) and cuckoo optimization algorithm (COA), into practice as efficient approaches to predict settlement (S-m) of shallow foundations over cohesion soil properties. The footing width, footing pressure, footing geometry, count of SPT blow, and footing embedment ratio are chosen as estimation parameters. The use of optimization techniques served the aim of determining the ideal value for the major variables of the investigated model. In the COA-SVR system, the values of R-2 and RMSE in the learning phase are 0.9649 and 4.7693, suitable than ANFIS-PSO by 0.9025 and 8.09, and in the examining phase are 0.9937 and 2.5485, considerably proper compared to ANFIS-PSO at 0.739 and 14.10, respectively. By considering another metric-like PI index, the COA-SVR network results more properly than the FFA-SVR model, with a decline of 0.0206 and 0.0717 in the learning and examining data sets, respectively. Furthermore, VAF index also depicts the same trend with outperforming the COA-SVR to FFA-SVR, especially in the examining stage, with a rise of about 3.2%. In conclusion, it is clear that the COA-SVR system could perform better than those integrated with FFA, as well as ANFI-PSO, where the proposed system can be known as the proposed system in the estimation procedure of shallow foundation S-m.

关键词： Shallow foundation Settlement Estimation Hybrid SVR optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Learning to Optimize With Convergence Guarantees Using Nonlinear System Theory

引用

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 1355-1360页

作者： Martin, Andrea Furieri, Luca Ecole Polytech Fed Lausanne Inst Mech Engn CH-1015 Lausanne Switzerland

The increasing reliance on numerical methods for controlling dynamical systems and training machine learning models underscores the need to devise algorithms that dependably and efficiently navigate complex optimization landscapes. Classical gradient descent methods offer strong theoretical guarantees for convex problems;however, they demand meticulous hyperparameter tuning for non-convex ones. The emerging paradigm of learning to optimize (L2O) automates the discovery of algorithms with optimized performance leveraging learning models and data - yet, it lacks a theoretical framework to analyze convergence of the learned algorithms. In this letter, we fill this gap by harnessing nonlinear system theory. Specifically, we propose an unconstrained parametrization of all convergent algorithms for smooth non-convex objective functions. Notably, our framework is directly compatible with automatic differentiation tools, ensuring convergence by design while learning to optimize.

关键词： Machine learning nonlinear optimal control optimization algorithms system theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：