Efficient Optimization Algorithm Research Articles

The hybrid approach of genetic algorithm and particle swarm optimization on reduced weld line defect in plastic injection molding

Weld lines are a serious defect observed in plastic injection molded parts, impacting both their cosmetic appearance and mechanical properties. Controlling the conditions of plastic injection is crucial to mitigate these weld lines. This study introduces a novel approach to identify polypropylene injection molding (PIM) conditions aimed at reducing weld lines in polypropylene parts. The PIM conditions considered in this study include melt temperature, injection pressure, packing pressure, packing time, and cooling time. An orthogonal array Taguchi L27 design was employed for the experimental setup, producing 27 polypropylene parts with varying combinations of process conditions. The width of weld lines generated on the parts’ surfaces was measured using an optimum microscope for all trials. Parametric analysis was conducted using response surface plots and contour plots to estimate the process conditions yielding minimum weld lines. Analysis of variance and regression analysis were employed to interpret the experimental data, with the resulting regression equation used to predict weld lines for a set of PIM process conditions. Finally, two efficient optimization algorithms, genetic algorithm (GA), and particle swarm optimization (PSO), were implemented using MATLAB programming to estimate the optimum process conditions for minimizing weld lines. The GA and PSO predicted weld line widths of 6.12302 μm and 6.123 μm, respectively, representing an 18.51% improvement in results. These findings demonstrate that the novel approach presented in this study can be effectively and reliably applied to address plastic product defects in the industry.

Improved Model-Free Predictive Control of a Three-Phase Inverter

Model predictive control (MPC) performance depends on the accuracy of the system model. Moreover, the optimization algorithm of MPC requires numerous online computations. These inherent limitations of MPC hinder its application in power electronics systems. This paper proposes a two-part solution for these challenges for a three-phase inverter with an output LC filter. The first part of the control scheme is a linear and modified model-free approach based on the auto-regressive structure (ARX) with exogenous input. The second part is the computationally efficient optimization algorithm based on the active set method to solve the optimization problem of the MFPC. The objective of the control scheme is to regulate the output voltages of the inverter in the presence of constraints. The constraints are the maximum admissible filter current and optimal duty cycle to avoid any damage to the system. To validate the performance of the proposed control scheme, simulations and hardware-in-loop (HIL) real-time investigations have been performed, comparing the results of the proposed approach with the model-based predictive control. The results showcase the computational efficiency and effectiveness of the MFPC approach, demonstrating its potential for overcoming the limitations of traditional MPC in power electronics systems.

Correction: Alshareef, S.M.; Fathy, A. Efficient Red Kite Optimization Algorithm for Integrating the Renewable Sources and Electric Vehicle Fast Charging Stations in Radial Distribution Networks. Mathematics 2023, 11, 3305

In the published publication [...]

An efficient algorithm for resource optimization in TWDM passive optical network using a C-RAN

The traditional base station in C-RAN is divided into three parts: a pool of centralized baseband units (BBUs), a fronthaul network that links the BBUs and remote radio units (RRUs), and RRUs. This paper proposes a novel cooperative algorithm for resource optimization in a time-wavelength division multiplexed (TWDM) passive optical network (PON) incorporating a cloud radio access network (C-RAN). First, a joint collaborative strategy is deployed to optimize cooperative caching and transmission in the wireless and optical domains. Then, the quality of experience (QoE) is improved by bandwidth configuration and caching. Simulation results show that the average throughput of the proposed QoE-aware video cooperative caching and transmission mechanism (QACCTM) algorithm is approximately 30% higher than that of other algorithms. Compared with the relative average residual clutter power (RARCP) and quality-aware wireless edge caching (QAWEC) algorithms, the proposed QACCTM algorithm reduces the access delay by approximately 27.1% and 15.9%, respectively.

Two-dimensional and high-order directional information modulations for secure communications based on programmable metasurface

Conventional wireless communication schemes indiscriminately transmit information into the whole space and pose inherent security risks. Recently, directional information modulation (DIM) has attracted enormous attention as a promising technology. DIM generates correct constellation symbols in the desired directions and distorts them in undesired directions, thus ensuring the security of the transmitted information. Although several DIM schemes have been reported, they suffer from defects of bulkiness, energy consumption, high cost, and inability to support two-dimensional (2D) and high-order modulations. Here, we propose a DIM scheme based on a 2-bit programmable metasurface (PM) that overcomes these defects. A fast and efficient discrete optimization algorithm is developed to optimize the digital coding sequences, and the correct constellation symbols can be generated and transmitted in multi-directional beams. As a proof-of-concept, three sets of constellation diagrams (8 phase shift keying (PSK), 16 quadrature amplitude modulation (QAM), and 64QAM) are realized in the multi-channel modes. This work provides an important route of employing DIM for ensuring physical-layer security and serves as a stepping stone toward endogenous secure communications.

A new adaptive elastic loss for robust unsupervised feature selection

The sparse-based unsupervised dimension reduction technique has been demonstrated to be an effective tool for dealing with high-dimensional data. Among them, the sparse regularization technique is used to introduce the prior knowledge of the model and helps unsupervised dimension reduction algorithms to complete the feature selection. However, the sparse regularization only considers the sparsity of representation. It ignores the group effect of variables among which the pairwise correlations are very high. To solve these issues, we present a novel regularization approach based on adaptive elastic loss in this study. Then, utilizing the regularization method, an efficient unsupervised feature selection methodology is given. Additionally, we devise an efficient alternative optimization algorithm to resolve the complex optimization issue of our proposed method and conduct a theoretical analysis of its computational complexity and convergence. Eventually, we conduct comprehensive experiments to test the validity of our proposed method, and real-world data and a simulation study demonstrate that our proposed method outperforms many state-of-the-art unsupervised feature selection methods in terms of clustering and classification.

TIHN: Tensor Improved Huber Norm for low-rank tensor recovery

Tensor Robust Principal Component Analysis (TRPCA) has received much attention in many real-world applications which aims to recover a low-rank tensor corrupted by sparse noise. Most existing TRPCA methods usually regularize the low-rank component by minimizing its Tensor Nuclear Norm (TNN). However, the original TNN shrinks all of the singular values with the same penalty which generally leads to suboptimal results. The reason is that the large singular values should be less penalized since they usually correspond to salient information of the real-world tensor. In this work, we develop a Tensor Improved Huber Norm (TIHN) which considers the difference between the singular values of tensor. The TIHN can achieve better performance by recovering the large and significant singular values exactly. We also establish the Huber TRPCA (HTRPCA) method by utilizing the proposed TIHN. In addition, an efficient optimization algorithm based on the half-quadratic theory and Alternating Direction Method of Multipliers (ADMM) framework is designed to implement the HTRPCA. Finally, experiments on color image recovery and video recovery validate the effectiveness of the proposed method.

Column generation for the collaborative multi-stop truckload shipping problem in daily regional distribution

Multi-stop truckload shipping offers less-than-truckload shippers a promising way to reduce their freight costs by consolidating freights en route, which is similar to ridesharing in the mobility industry. One significant challenge in practical implementation is designing attractive multi-stop routes that to shippers while conforming to carriers' requirements. It is crucial to develop an efficient optimisation algorithm to automate bundling decisions. However, this routeing problem is complicated by a nonlinear inseparable cost structure and new routeing decisions in the first pickup and last delivery points. We introduce a new variant of pickup and delivery model and propose a column generation algorithm to efficiently solve real-world multi-stop routeing problems. The algorithm utilises a new specialised labelling procedure that exclusively generates labels for pickup sequences and establishes new dominance rules. Theoretical results on the label dominance, algorithm complexity, and optimality gap are also established. We conduct a real-world case study, comparing our methodology against the enumeration method and a heuristic method documented in the literature. The computational results demonstrate the high efficiency of our method and reveal important insights for practitioners.

Differential Privacy-Preserving IoT Data Sharing Through Enhanced PSO

ABSTRACT With the proliferation of Internet of Things (IoT) devices and the generation of massive amounts of sensitive data, preserving privacy while enabling data sharing has become a critical concern. In this research, we propose a novel approach for achieving differential privacy in IoT data sharing through an improved Particle Swarm Optimization (PSO) algorithm. Our objective is to find the optimal configuration of privacy-preserving mechanisms that maximizes privacy while maintaining data utility. The research begins with a comprehensive overview of differential privacy in IoT data sharing, highlighting the limitations of existing optimization algorithms. We then present our proposed improvements to the traditional PSO algorithm, including the design of a suitable fitness function, the use of a dynamic inertia weight, exploration of different neighborhood topologies, and adaptive acceleration coefficients. We define a set of performance metrics, including privacy metrics (e.g. ε-differential privacy parameter) and utility measures (e.g. accuracy, utility loss), to assess the algorithm’s effectiveness. The results of our experiments demonstrate that the improved PSO algorithm achieves higher privacy guarantees while maintaining competitive levels of data utility compared to existing approaches. The proposed algorithm exhibits faster convergence, better exploration of the search space, and improved scalability. Our research contributes to the field of privacy-preserving IoT data sharing by providing an efficient and effective optimization algorithm that enables secure and privacy-aware data sharing while facilitating valuable insights and analysis.

Consensus and discriminative non-negative matrix factorization for multi-view unsupervised feature selection

Multi-view unsupervised feature selection (MUFS) has been proven to be an efficient dimensionality reduction technique for multi-view data. Existing methods have two main challenges: (1) The consistency information from different views is not fully exploited. (2) The cluster structure of the original data is not well utilized. To settle these problems, we propose a novel consensus and discriminative non-negative matrix factorization (CDNMF) for multi-view unsupervised feature selection. Specifically, CDNMF obtains a robust low-dimensional latent space by NMF with an ℓ2,1-norm constraint. To select more discriminative features, we further impose a sparsity constraint on the learned latent features. Moreover, CDNMF performs k-means clustering on all views separately to obtain the pseudo-labels of each view, which are used to guide the learning of consensus information among views. To solve our model, we develop an efficient iterative optimization algorithm. Extensive experimental results on ten benchmark datasets demonstrate that the proposed significantly outperforms several existing feature selection methods in clustering tasks.

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.

Informative relationship multi-task learning: Exploring pairwise contribution across tasks’ sharing knowledge

Multi-task learning is a machine learning paradigm, that aims to leverage useful domain information to help improve the generalization performance of all tasks. Learning the relationships of tasks helps to identify the latent tasks’ associations and access a better performance. However, most of the existing methods hardly pay attention to the determination of knowledge interaction among tasks and instead concentrate solely on certain aspects of task affinity. This compulsory similarity among all tasks leads to deficiencies in both task diversity and model robustness. To address this issue, we emphasize the task relationships within mutual information interaction. We propose a regularized framework from an informative perspective to quantify pairwise contributions during the knowledge-sharing stage, meanwhile utilizing an exclusive Lasso to identify the exclusive characteristics of tasks. An efficient optimization algorithm is developed to solve the proposed objective function. Detailed theoretical analyses and extensive experiments on both synthetic and real-world datasets are provided to demonstrate the effectiveness of our proposed method.

An efficient two-stage optimization algorithm for a flexible job shop scheduling problem with worker shift arrangement

Due to the involvement of workers, scheduling production jobs necessitates consideration of worker shifts in most production activities. In this study, we address a flexible job shop scheduling problem with worker shift arrangement, considering constraints such as job priority, limited resources, and resource unavailability. To minimize the overdue days of low-priority jobs and ensure the timely delivery of high-priority jobs, we establish a mixed-integer programming model to allocate production resources, process sequencing, and schedule worker shifts. An improved differential evolution algorithm is proposed and designed such that overdue days and worker overtime of all jobs are calculated. Furthermore, we develop a two-stage intelligent optimization algorithm. First, we design a two-segment chromosome encoding and decoding method. Then, we propose generation strategies that follow the urgency of the priority rule to generate high-quality initial chromosomes. In adaptive worker shift adjustment, we prioritize high-priority jobs to align with delivery times. We conducted experiments to validate our model and algorithm by comparing them against four well-known intelligent optimization algorithms. Our improved algorithm proves to be highly beneficial in job and worker scheduling as it effectively minimizes overdue days and arranges worker overtime.

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.