Efficient Optimization Algorithm Research Articles

Virtual synchronous generator control with parameters optimization based on new WaOA algorithm for grid-feeding inverters

The widespread integration of renewable energy sources (RESs) within traditional power systems causes a considerable impact, such as a decrease in total inertia, damping properties, and large frequency deviation. To tackle this issue, numerous research have been proposed to introduce the virtual synchronous generator (VSG) control strategy as an effective solution applied to power electronics inverters operating in grid-forming or grid-feeding control modes. However, the proper tunning of the inertia and damping parameters is considered as a significant challenge to ensure the system stability and reliability. In this paper, an efficient meta-heuristic Walrus Optimization Algorithm (WaOA) -based VSG control intended for grid-feeding inverters within a weak grid is proposed. The objective of this work is to offer a proper tuning of the VSG parameters, thereby improving the dynamic characteristics of the microgrid (MG) and guaranteeing a stable operation. In addition, it highlights the adopted optimization technique which is introduced on VSG control while ensuring minimum objective function value. Through offline simulations in MATLAB/Simulink, the superiority of the suggested WaOA method is first confirmed, in which it offers the lowest Integral Square Error (ISE) fitness function value of 0.026, compared to the Mountain Gazelle Optimizer (MGO) and Tunicate Swarm Algorithm (TSA) with 0.027 9 and 0.0281, respectively. Second, the performance of the WaOA-based VSG control is compared to the ones based on MGO and TSA techniques under active and reactive power variations. The obtained results demonstrate that the proposed VSG control ensures a better transient performance, especially in terms of under and overshoots.

Approximate encoding of quantum states using shallow circuits

Quantum algorithms and simulations often require the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of required gates grows exponentially with the number of qubits, becoming unfeasible on near-term quantum devices. Here, we aim at creating an approximate encoding of the target state using a limited number of gates. As a first step, we consider a quantum state that is efficiently represented classically, such as a one-dimensional matrix product state. Using tensor network techniques, we develop and implement an efficient optimization algorithm that approaches the optimal implementation, requiring a polynomial number of iterations. We, next, consider the implementation of the proposed optimization algorithm directly on a quantum computer and overcome inherent barren plateaus by employing a local cost function. Our work offers a universal method to prepare target states using local gates and represents a significant improvement over known strategies.

Optimal allocation of solar photovoltaic distributed generation for performance enhancement of electrical distribution networks considering optimal volt‐var regulation under uncertainty and high load variation

AbstractThis article proposes an optimal placement and sizing of photovoltaic (PV) power systems based distributed generation (DG) in radial electrical distribution networks considering the capability of PV inverters to regulate the voltage by optimal injecting and absorbing reactive power at the point of common coupling (PCC) using honey badger algorithm (HBA), as a recent and efficient optimization algorithm to solve the complicated optimal allocation. Several objective functions are achieved for distribution system performance enhancement: minimizing the power loss and the voltage deviation index (VDI) and maximizing the voltage stability index (VSI). Based on historical data and probabilistic models, seasonal hourly solar irradiance, ambient temperature, and load variation curves have been modeled, which simultaneously consider the light, normal, and heavy load demand. The essential components of distribution power systems have been characterized. To investigate the validity of the proposed approach, IEEE 33 and IEEE 69 BUS radial distribution test systems have been considered for power flow (PF) analyses, where Newton's Raphson method has been applied to solve the PF issue. The simulation results of different numerical scenarios have shown the effectiveness and validity of the newly proposed method to solve the optimal allocation problem considering optimal volt‐var regulation control of PV inverters compared to several valid and robust optimization algorithms.

A Dual-Polarization Programmable Metasurface for Green and Secure Wireless Communication.

Dual-polarization programmable metasurfaces can flexibly manipulate electromagnetic (EM) waves while providing approximately twice the information capacity. Therefore, they hold significant applications in next-generation communication systems. However, there are three challenges associated with the existing dual-polarization programmable metasurfaces. This article aims to propose a novel design to address them. First, the design overcomes the challenge of element- and polarization-independent controls, enabling more powerful manipulations of EM waves. Second, by using more energy-efficient tunable components and reducing their number, the design can be nearly passive (maximum power consumption of 27.7mW), leading to a significant decrease in the cost and power consumption of the system (at least two orders of magnitude lower than the power consumption of conventional programmable metasurfaces). Third, the design can operate in a broad bandwidth, which is attractive for practical engineering applications. Both the element and array of the metasurface are meticulously designed, and their performance has been carefully studied. The experiments demonstrate that 2D wide-angle beam scanning can be realized. Moreover, secure communication based on directional information modulation can be implemented by exploiting the metasurface and an efficient discrete optimization algorithm, showing its programmable, multiplexing, broadband, green, and secure features.

Unified scheme design and control optimization of flapping wing for next-generation manta ray robot

An efficient global optimization (EGO) algorithm has been used in the geometry design and motion for a manta ray-like flapping wing to optimize the best swimming performance. To this end, we combine a three-dimensional simulation using STAR-CCM+ with this framework to generate the optimal flapping wing geometry that maximizes the lift-to-drag ratio. The drag and moment coefficients between the original and optimized flapping wings were further compared in a servo-driven towing tank to validate the optimization effects. In addition, by associating the force experiments in a water tunnel, we successfully predict the motion trajectory for the largest thrust with the same EGO algorithm. A free-swimming test is carried out to verify the optimization. This study gives a unified scheme design optimization for the next-generation manta ray robot.

Optimal design of offshore jacket platform using enhanced colliding bodies optimization algorithm

Given the considerable volume of materials used in jacket platforms, structural optimization of these structures is always of interest. In the design optimization of offshore jacket platforms, the objective function is iteratively evaluated through a number of complex and time-consuming analyses making the optimization process computationally expensive. To reduce the computational costs, therefore, it is imperative to investigate efficient optimization algorithms with a high convergence rate to achieve optimal solutions for offshore jacket structures as a large-scale and complex problem. Accordingly, this research studies the application of a novel metaheuristic algorithm called Enhanced Colliding Bodies Optimization (ECBO) for the design optimization of a real jacket platform, SPD19A. The optimization constraints comprise stress and buckling in the members, horizontal displacements at the working point, and structural adequacy control of connections. The optimization results are subsequently compared to a design optimized by the Genetic Algorithm (GA), as an example, to evaluate the efficiency of the ECBO algorithm for the offshore jacket structure. The outcomes indicate that ECBO optimizes the jacket more effectively by 15%, while the optimization ratio of GA is 11%. Hence, the results confirm that ECBO has great and favorable efficiency and can potently escape from local optima to reach a better design for the jacket structure.

Joint Anchor Graph Embedding and Discrete Feature Scoring for Unsupervised Feature Selection.

The success of existing unsupervised feature selection (UFS) methods heavily relies on the assumption that the intrinsic relationships among original high-dimensional (HD) data samples exist in the discriminative low-dimension (LD) subspace. However, previous UFS methods commonly construct pairwise graphs and employ l2,1 -norm regularization to severally preserve the local structure and calculate the score of features, which is computationally complex and easy to get stuck into local optimum, so that those approaches cannot be applied in dealing with large-scale datasets in practice. To overcome this challenge, we propose a novel UFS method, in which a novel anchor graph embedding paradigm is designed to extract the local neighborhood relationships among data samples by reducing the computational complexity of graph construction to be linear in the number of data. Moreover, to improve the optimality of selected features as well as the performance of downstream tasks, we propose a discrete feature scoring mechanism, which imposes orthogonal l2,0 -norm constraints on learned projections, in order to enhance the distinction of feature scores as well as reduce the probability of falling into local optimum. In addition, solving the proposed nonconvex and nonsmooth NP-hard problem is challenging, and we present an efficient optimization algorithm to address it and acquire a closed-form solution of the transformation matrix. Extensive experiments demonstrate the effectiveness and efficiency of the proposed UFS by comparison with several state-of-the-art approaches to clustering and image segmentation tasks.

IFKMHC: Implicit Fuzzy K-Means Model for High-Dimensional Data Clustering.

The graph-information-based fuzzy clustering has shown promising results in various datasets. However, its performance is hindered when dealing with high-dimensional data due to challenges related to redundant information and sensitivity to the similarity matrix design. To address these limitations, this article proposes an implicit fuzzy k-means (FKMs) model that enhances graph-based fuzzy clustering for high-dimensional data. Instead of explicitly designing a similarity matrix, our approach leverages the fuzzy partition result obtained from the implicit FKMs model to generate an effective similarity matrix. We employ a projection-based technique to handle redundant information, eliminating the need for specific feature extraction methods. By formulating the fuzzy clustering model solely based on the similarity matrix derived from the membership matrix, we mitigate issues, such as dependence on initial values and random fluctuations in clustering results. This innovative approach significantly improves the competitiveness of graph-enhanced fuzzy clustering for high-dimensional data. We present an efficient iterative optimization algorithm for our model and demonstrate its effectiveness through theoretical analysis and experimental comparisons with other state-of-the-art methods, showcasing its superior performance.

GREAT: A scientific software platform for satellite geodesy and multi-source fusion navigation

The software platform named GNSS + REsearch, Application and Teaching (GREAT) has been designed and developed by Wuhan University for satellite geodesy and multi-source fusion navigation. GREAT is a comprehensive software platform based on C++ language, with modular structure, cross-platform capabilities and efficient performance. The software mainly focuses on space geodetic data processing, precise positioning and orbit determination, and multi-source fusion navigation. With the integration of multiple space geodetic techniques at observation level, GREAT can achieve the determination of global geodetic parameters. Meanwhile, GREAT can also achieve real-time precise orbit and clock determination by processing GNSS data from globally distributed stations, and the accuracies are about 3–6 cm for orbit and 0.1–0.4 ns for clock. Based on high-precision orbit and clock products, centimeter-level onboard positioning accuracies can be achieved with PPP-RTK in open-sky scenarios. Furthermore, centimeter-level multi-source fusion navigation can be achieved in urban scenarios though the integrated system of PPP-RTK/MEMS/VIS/LiDAR. Additionally, efficiency optimization algorithms such as parallel computing are applied to enable the software to handle the data-intensive and calculation-intensive situations.

Heuristic algorithms for design of integrated monitoring of geologic carbon storage sites

Designs for Risk Evaluation and Management (DREAM) is a tool developed under the National Risk Assessment Partnership (NRAP) to enhance geologic carbon storage safety and efficiency. Using potential leakage scenarios generated externally by the users preferred history-matching approach, DREAM constructs ideal combinations of sensor locations in the right place at the right time to detect as many leaks as possible, detect them as early as possible, and minimize cost. This user-friendly tool, developed in Java, features a window-based GUI for input and a 3D visualization tool for viewing the domain space and optimized monitoring plans. DREAM's latest version accommodates real-world usage by allowing for joint optimization of wellbore point sensor placements and surface geophysics survey geometries, and by using more efficient multi-objective optimization algorithms. In an example shown here, these two improvements combined allow us to support containment assurance and go from detecting 80–90 % of the potential CO2 leakage to +99.7 %, a step-change improvement that can make the deciding difference in whether a site is suitable for geologic carbon storage. Though developed for geologic carbon storage, this tool would be equally applicable in many surface or offshore environmental monitoring projects.

An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation

An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation

Multi-view and Multi-order Graph Clustering via Constrained [formula omitted]-norm

The graph-based multi-view clustering algorithms achieve decent clustering performance by consensus graph learning of the first-order graphs from different views. However, the first-order graphs are often sparse, lacking essential must-link information, which leads to suboptimal consensus graph. While high-order graphs can address this issue, a two-step strategy involving the selection of a fixed number of high-order graphs followed by their fusion may result in information loss or redundancy, restricting the exploration of high-order information. To address these challenges, we propose Multi-view and Multi-order Graph Clustering via Constrained l1,2-norm (MoMvGC), which mitigates the impact of graph sparsity on multi-view clustering. By innovatively designing constrained l1,2-norm, the model ingeniously integrates the selection of multi-order graphs and corresponding weight learning into a unified framework. Furthermore, MoMvGC not only enable sparse selection of multi-order graphs but also simultaneous selection of views. Afterwards, we design an efficient alternative optimization algorithm to solve the optimization problems in MoMvGC. The proposed model achieves state-of-the-art clustering performance on nine real-world datasets, with particularly notable improvements observed on the MSRC dataset, where the clustering accuracy is increased by 5.24% compared to the best baseline. Comprehensive experiments demonstrate the effectiveness and superiority of our model. The code is available at https://github.com/haonanxin/MoMvGC_code.

A numerical model simulating cyclic behavior of high-strength steel

High-strength steel (HSS) can effectively and economically design structural members that withstand large forces induced by extreme events such as earthquakes. To evaluate the seismic performance of HSS members and structures using nonlinear finite element (FE) analyses, using an accurate material model is important, which can simulate the inelastic cyclic behavior of the HSS. The peculiar material behavior of HSS needs to be considered in the model. This study used a combined hardening model to construct the material model. The configuration of the model and the constituent model parameter values are determined to precisely simulate the low-cycle fatigue (LCF) behavior of HSS. An efficient particle swarm optimization (PSO) algorithm is used to determine parameter values with LCF test data of 54 individual HSS coupons. In additions, to conveniently determine the model parameter values with only monotonic tensile test data instead of conducting expensive LCT tests, empirical equations are proposed. It is shown that the LCF curves of HSS can be accurately simulated using the constructed material model with the proposed equations.

ETE-SRSP: An Enhanced Optimization of Tramp Ship Routing and Scheduling

In the contemporary tramp shipping industry, route optimization and scheduling are directly linked to enhancements in operations, economics, and the environment, making them key factors for the effective management of maritime transportation. To enhance effective ship-to-cargo matching and the refinement of maritime transportation itineraries, this paper introduces a time efficiency and carbon dioxide emission multi-objective optimization algorithm named ETE-SRSP (efficiency–time–emission multi-optimization algorithm). ETE-SRSP incorporates several factors, including the initial positions of ships, time windows for loading and unloading operations, and varying sailing speeds. Within the ETE-SRSP framework, pioneering an approach that integrates ballast and laden sailing velocities as decisional parameters, it employs a multi-objective optimization technique to investigate the intricate interplay between temporal efficiency and carbon dioxide emissions. Additionally, the model’s proficiency in mitigating emissions and managing costs is clearly demonstrated through the optimization of these objectives, thereby offering a robust framework for decision support. The experimental results show that the optimal sailing speeds derived from the ETE-SRSP, under typical time-weight scenarios, can achieve an optimal balance between emission reduction and cost control. In summary, this study underscores the optimization strategy’s potential to effectively address the maritime sector’s need for economic growth and ecological conservation, showcasing its practical value in the industry.

The Alternating Direction Method of Multipliers for Sufficient Dimension Reduction

The minimum average variance estimation (MAVE) method has proven to be an effective approach to sufficient dimension reduction. In this study, we apply the computationally efficient optimization algorithm named alternating direction method of multipliers (ADMM) to a particular approach (MAVE or minimum average variance estimation) to the problem of sufficient dimension reduction (SDR). Under some assumptions, we prove that the iterative sequence generated by ADMM converges to some point of the associated augmented Lagrangian function. Moreover, that point is stationary. It also presents some numerical simulations on synthetic data to demonstrate the computational efficiency of the algorithm.

Improve robustness of machine learning via efficient optimization and conformal prediction

AbstractThe advance of machine learning (ML) systems in real‐world scenarios usually expects safe deployment in high‐stake applications (e.g., medical diagnosis) for critical decision‐making process. To this end, provable robustness of ML is usually required to measure and understand how reliable the deployed ML system is and how trustworthy their predictions can be. Many studies have been done to enhance the robustness in recent years from different angles, such as variance‐regularized robust objective functions and conformal prediction (CP) for uncertainty quantification on testing data. Although these tools provably improve the robustness of ML model, there is still an inevitable gap to integrate them into an end‐to‐end deployment. For example, robust objectives usually require carefully designed optimization algorithms, while CP treats ML models as black boxes. This paper is a brief introduction to our recent research focusing on filling this gap. Specifically, for learning robust objectives, we designed sample‐efficient stochastic optimization algorithms that achieves the optimal (or faster compared to existing algorithms) convergence rates. Moreover, for CP‐based uncertainty quantification, we established a framework to analyze the expected prediction set size (smaller size means more efficiency) of CP methods in both standard and adversarial settings. This paper elaborates the key challenges and our exploration towards efficient algorithms with details of background methods, notions for robustness measure, concepts of algorithmic efficiency, our proposed algorithms and results. All of them further motivate our future research on risk‐aware ML that can be critical for AI–human collaborative systems. The future work mainly targets designing conformal robust objectives and their efficient optimization algorithms.

Dynamic optimization of die-less spinning process through autonomous modeling of time-varying forming law

Die-less spinning is a typical incremental forming technology with flexible processing parameters, including the roller path and loading parameters, whose forming law changes dynamically and easy-to-produce defects of excessive thinning and flange wrinkling. This brings a great challenge to the process design of die-less spinning. In this study, we proposed a novel dynamic optimization approach and system considering the time-varying forming law for the processing parameters in die-less spinning. The idea of proposed approach is that simulating the spinning process step by step through autonomous finite element modeling, real-time extracting and modeling the simulated spinning status at each forming step to capture the time-varying forming law, then gradually optimizing the processing parameters through efficient multi-objective optimization algorithm. By conducting the proposed dynamic optimization approach to the first spinning pass of die-less spinning, series of polynomial response surface models (PRSM) of wall thickness and flange wrinkling at various forming steps were developed to describe the time-varying forming law. On this basis, the roller path and matching loading parameters in each step were gradually optimized through a differential evolution algorithm with the multi-objective of minimizing wall thickness reduction, reducing flange wrinkling and maximizing forming efficiency. The optimized process produced better spun part than the traditional spinning process, presenting the wall thickness reduction ≤5 % and the flange wrinkling ≤2.5 mm. Furthermore, the time-varying influence of processing parameters on the wall thickness and flange wrinkling were elucidated based on the PRSM of spinning status at various forming steps.

Physics-informed deep learning and linear programming for efficient optimization of combined cycle power plants

Efficient operation of combined cycle power plants (CCPP) involves solving mixed-integer nonlinear optimization problems, constrained by thermodynamic differential equations, thermal constraints, and temporal dependencies between variables. The optimization problem aims to maximize profit for day-ahead operation by minimizing short-term and long-term costs, and accounting for volatility in ambient conditions and energy price. In operational terms, the challenge lies in developing an efficient and robust optimization algorithm capable of determining optimal values for thousands of temporal variables. It must also have the capacity to evaluate a multitude of scenarios encompassing various weather and market conditions. To address this challenge, this paper proposes a hybrid optimizer that utilizes deep learning models trained on historical operational data of a real CCPP, along with a surrogate physics-driven piecewise-linear model of CCPP, to determine the optimal values of thousands of control setpoints, with strong temporal co-dependencies, within a two-minute runtime required by industry constraints. A multi-resolution architecture is proposed to efficiently implement this optimizer. The algorithm sequentially solves the problem in coarse and fine resolutions to accelerate convergence. Final results are checked for feasibility using pre-trained deep learning models, ensuring accuracy and validity. The study shows that the proposed model provides comparable results to the exact solution while reducing computational costs, up to 95%. This research has practical implications for power plant system operators, as well as traders and dispatchers, enabling them to make optimal decisions for day-ahead contracting purposes and CCPP operation in a reasonable time, ultimately leading to more efficient and cost-effective power plant management. Furthermore, the methodology introduced in this work could potentially be extended to other industrial applications that require large-scale, complex optimizations, where the precise governing principles of a process can be approximated by piecewise-linear functions.

Dual-learning Multi-hop Nonnegative Matrix Factorization for community detection

As an important branch of network science, community detection has garnered significant attention. Among various community detection methods, nonnegative matrix factorization (NMF)-based community detection approaches have become a popular research topic. However, most NMF-based methods overlook the network’s multi-hop information, let alone the community detection results specific to each hop of the network. In this paper, we propose Dual-learning Multi-hop NMF (DL-MHNMF), a method that considers not only the multi-hop connectivity between two nodes but also factors in the shared results across multiple hops and the impact of differences in the specific results at each hop on the shared outcomes. An efficient iterative optimization algorithm with guaranteed theoretical convergence is proposed for solving DL-MHNMF. Methodologically, by iteratively removing the specific results during the optimization process of DL-MHNMF, we achieve enhanced detection accuracy, which is also verified by subsequent experiments. Specifically, we compare fourteen algorithms on eleven publicly available datasets, and experimental results show that our algorithm outperforms most state-of-the-art methods. The source code is availiable at https://github.com/bx20000827/DL-MHNMF.git.

A novel metaheuristic based on object-oriented programming concepts for engineering optimization

This paper presents a novel, robust, efficient, and simple optimization algorithm called the Object-Oriented Programming Optimization Algorithm (OOPOA) for tackling constrained and unconstrained optimization problems. The algorithm is inspired by the inheritance concept of Object-Oriented programming languages, where the features of a class are classified into three types according to inheritance probability: public, private, and protected. The object-oriented programming inheritance concept is implemented in the algorithm to update the population for the next generations. The proposed algorithm ensures exploitation by selecting the solution with the highest fitness to be inherited in each iteration. It ensures exploration by applying a mutation process that helps explore wide regions in the search space. The performance of this technique is demonstrated by solving 34 different optimization tasks, including 20 standard benchmark problems, ten IEEE Congress of Evolutionary Computation benchmark test functions, and four constrained real-world engineering design problems.