Objective Function Research Articles

In‐Silico Optimization of a Bi‐Enzymatic Reactor for Mannitol Production Using Pareto‐Optimal Fronts

AbstractFor multi‐enzymatic cases, the determination of the batch reactor (BR) optimal operating policy often translates into a difficult multi‐objective problem. Exemplification is made here for the enzymatic reduction of D‐fructose to mannitol by using the mannitol dehydrogenase (MDH) enzyme and nicotinamide adenine dinucleotide (NADH) cofactor, with in situ regeneration of NADH at the expense of formate degradation by using the FDH enzyme. This paper presents an original rule to in silico generate the problem solution, by using the Pareto optimal‐front approach with accounting for pairs of competing economic goals and constraints. The optimal BR is then compared to an optimal fed‐BR (FBR), or a series of equal BRs (SeqBR). As proved, the Pareto‐optimal front alternative is an advantageous option, compared to the classical nonlinear programming technique, being simple to apply, by considering pairs of opposite objective functions. In the present case study, the Pareto‐optimal BR operating mode predicts an M‐productivity 1.5x better than those of an optimized FBR, with comparable enzymes consumption. The MDH consumption of this Pareto‐optimal BR is 10x smaller than an optimal SeqBR, and 130x smaller vs. heuristic (sub)optimal BR.

A High-Quality and Convenient Camera Calibration Method Using a Single Image

Existing camera calibration methods using a single image have exhibited some limitations. These limitations include relying on large datasets, using inconveniently prepared calibration objects instead of commonly used planar patterns such as checkerboards, and requiring further improvement in accuracy. To address these issues, a high-quality and convenient camera calibration method is proposed, which only requires a single image of the commonly used planar checkerboard pattern. In the proposed method, a nonlinear objective function is derived by leveraging the linear distribution characteristics exhibited among corners. An algorithm based on enumeration theory is designed to minimize this function. It calibrates the first two radial distortion coefficients and principal points. The focal length and extrinsic parameters are linearly calibrated from the constraints provided by the linear projection model and the unit orthogonality of the rotation matrix. Additionally, a guideline is explored through theoretical analysis and numerical simulation to ensure calibration quality. The quality of the proposed method is evaluated by both simulated and real experiments, demonstrating its comparability with the well-known multi-image-based method and its superiority over advanced single-image-based methods.

Masticatory function between chewing with and without wearing clear thermoplastic appliances

BackgroundClear thermoplastic materials are used in a variety of oral appliances. In some situations, patients may wear clear thermoplastic appliances while eating. However, the effect of wearing clear thermoplastic appliances on chewing efficiency is unknown. This study aimed to evaluate the differences in masticatory function between chewing with and without wearing clear thermoplastic retainers over a 6-month period, and its associated factors.MethodsThirty patients who received upper and lower clear retainers after debonding fixed appliances were examined for objective and subjective masticatory function at retainer delivery (T0), 3-month (T1), and 6-month follow-ups (T2) in two conditions: with and without wearing their retainers while chewing. The objective method used multiple sieves reported as the median particle size (MPS). The food intake ability (FIA) test served as the subjective method. Paired t-test was used to compare the outcomes between chewing with and without retainers at each evaluation time point. Repeated measures ANOVA followed by the Bonferroni post-hoc test was used to compare the outcomes between the three evaluating time points. Multivariable linear regression analysis was performed to assess whether age, sex, and extraction/non-extraction was associated with these effects.ResultsThe MPS was significantly greater when chewing with retainers compared with chewing without them at T0 (P < 0.05), however, it was not significantly greater at T1 and T2 (P > 0.05). The MPS with and without the retainers tend to decrease between T0, T1 and T2. In particular, the MPS while chewing with retainers significantly decreased between T0 and T1. The total FIA score and FIA subscores for hard and soft food were significantly lower when eating with retainers at T0 (P < 0.05), however, all FIA scores when eating without retainers did not significantly change between T0, T1, and T2. No significantly associated factors were identified.ConclusionsWearing clear retainers while chewing decreases objective and subjective masticatory function immediately after completing orthodontic treatment. However, this significantly improved to levels comparable to chewing without retainers after a 3-month follow-up. Age, sex, and extraction/non-extraction treatment were not associated with the difference in masticatory function while chewing with and without wearing the retainers.

Application of the Gray Wolf Optimization Algorithm and Neural Networks for Solving Discrete Problems

Relevance. In recent decades, metaheuristic optimization methods have become popular for solving complex problems that require searching for global extrema. Algorithms such as genetic algorithm (GA), ant colony optimization (ACO), particle swarm optimization (PSO), as well as more modern approaches such as cat pack optimization (CSO) and gray wolf pack optimization (GWO) demonstrate high efficiency, but their application is often limited by the conditions of continuity and differentiability of the objective functions. This is a challenge when solving problems with discrete data, where such requirements are not met. In this context, the search for methods that allow adapting metaheuristic algorithms to work with discrete functions is of particular relevance.Aim. The study is aimed at testing the hypothesis about the possibility of using a neural network trained on a limited set of discrete data as an approximation of a function sufficient for the correct execution of the GWO algorithm when searching for a global minimum. The implementation of this hypothesis can significantly expand the scope of GWO, making it available for a wider range of problems where functions are defined on discrete sets.Methods. The study is based on the analysis of existing approaches and experimental verification of the hypothesis on two test functions: a linear function and a Booth function, which are widely used as standards for evaluating the performance of optimization algorithms. Numerical experiments were conducted using neural networks as an approximating model to obtain the results. Solution. During the experiments, an analysis of the applicability of neural networks for approximating discrete functions was carried out, which showed the success of this approach. It was found that neural networks can approximate discrete functions with high accuracy, creating conditions for a successful search for a global minimum using the GWO algorithm.Novelty. For the first time, a hypothesis was proposed and tested on the use of neural networks for approximating objective functions in metaheuristic optimization problems on discrete data. This direction has not previously received due coverage in the scientific literature, which adds significance to the obtained results and confirms the effectiveness of the proposed approach.Practical significance. The results of the study open up new prospects for the application of algorithms such as GWO in optimization problems based on discrete data, expanding the capabilities of metaheuristic methods and facilitating their implementation in a wider class of applied problems, including problems where the use of other methods is limited.

A novel branch and bound algorithm for solving the linear multiplicative programming problems

In this paper, we propose a novel branch and bound algorithm for solving the linear multiplicative programming (LMP) problem. A new quadratic relaxation is proposed. We first show that the Hessian matrix of the multiplication of two linear functions has a decomposition form, given by the difference of two rank-one matrices, resulting in a decomposition of each quadratic term of the objective function. And then the minus term is relaxed into a linear one. To find the global optimal solutions, branch and bound method is adopted. Theoretical analysis is provided that guarantees the convergence of our algorithm. Numerical experiments show that the new algorithm runs faster than several typical algorithms for certain types of LMP.

Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs

AbstractWe provide a new approach to the optimization of trigonometric polynomials with crystallographic symmetry. This approach widens the bridge between trigonometric and polynomial optimization. The trigonometric polynomials considered are supported on weight lattices associated to crystallographic root systems and are assumed invariant under the associated reflection group. On one hand the invariance allows us to rewrite the objective function in terms of generalized Chebyshev polynomials of the generalized cosines; On the other hand the generalized cosines parameterize a compact basic semi algebraic set, this latter being given by an explicit polynomial matrix inequality. The initial problem thus boils down to a polynomial optimization problem that is straightforwardly written in terms of generalized Chebyshev polynomials. The minimum is to be computed by a converging sequence of lower bounds as given by a hierarchy of relaxations based on the Hol–Scherer Positivstellensatz and indexed by the weighted degree associated to the root system. This new method for trigonometric optimization was motivated by its application to estimate the spectral bound on the chromatic number of set avoiding graphs. We examine cases of the literature where the avoided set affords crystallographic symmetry. In some cases we obtain new analytic proofs for sharp bounds on the chromatic number while in others we compute new lower bounds numerically.

Optimization algorithm of UAV‐assisted federated learning resources based on wireless energy harvesting

AbstractFederated learning (FL) enhances data privacy and security by enabling multiple terminals to collaboratively train a global model without transferring data to a central location. To tackle the challenges of limited terrestrial communication resources and device energy in FL, a UAV‐assisted federated learning and energy collection resource optimization algorithm is proposed. This algorithm harvests the working energy of FL terminals from radio frequency signals transmitted by the UAV via wireless energy collection. Considering energy causality and limited resources, we formulate a problem aimed at minimizing the completion time of FL training tasks. As this problem is NP‐hard, we initially employ a greedy algorithm to optimize the UAV's position, then decompose it into three sub‐problems: computing resources, power control, and bandwidth allocation. We derive and establish the optimization objective function for computing resources as convex, obtaining the expression for optimal computing resources. The Brent algorithm, based on golden section interpolation, iteratively solves the power distribution sub‐problem, while the Lagrange‐quasi‐Newton algorithm optimizes bandwidth allocation for each user. Simulation results demonstrate that the proposed algorithm effectively reduces training completion time while maintaining training quality.

Optimal power dispatch in microgrids using mixed-integer linear programming

Abstract As greenhouse gases emissions continue to rise, society is actively seeking methods to reduce them. Microgrids (MGs), which predominantly consist of renewable energy sources, play a significant role in achieving this objective. This paper proposes an optimized methodology for power dispatch in MGs using mixed-integer linear programming (MILP). The MGs include photovoltaic systems, wind turbines, biogas (BG) generators, battery energy storage systems (BESS), electric vehicles (EV), and loads. The model features an objective function focused on cost minimization, power balance, and the necessary limits and constraints for the system’s safe operation. Real-time pricing is employed for energy transactions between the MGs and the main grid. The results demonstrate a cost-efficient operation for the proposed system comprising two MGs and the main grid. During periods of negative power balance, the demand was met by discharging the BESS, EV’s battery, or purchasing energy from the grid. The BESS was charged when energy prices were low and discharged during peak demand periods and high energy prices. The intermittent nature of renewable sources necessitates an efficient management system to ensure reliable operation. Additionally, storage systems help mitigate the variability in generation. The BG generator was another crucial component for power supply due to its flexibility. Integrating these components into the system improved reliability and ensured a secure and balanced operation.

Switch monitoring algorithm for 220 kV terminal substation startup process based on multi time scale graph model

The switch monitoring in the startup process of 220 kV terminal substation is a dynamic and changeable process, which has obvious characteristics of diversified scales in time, so as to solve the problem of switch monitoring under multivariable and multi-scale interference. The switch monitoring framework for the startup process of 220KV terminal substation is built. The process layer uses the graphic configuration software and combines the internal and external models of the substation to build the objective function for the generation of the substation graphic model. The particle swarm optimization algorithm is used to solve it to generate the optimal substation graphic model. Through the online monitoring device, the signals such as sensors, normally open and normally closed contacts are collected in real time, and the status of the switchgear is obtained through processing, the reduced half trapezoidal cloud model multivariable multi-scale sample entropy similarity tolerance criterion is used for softening treatment, and the multivariable multi-scale cloud sample entropy is determined to achieve the extraction of multiple time scale switch fault feature vectors, which are used as the input of the SE-DSCNN fault diagnosis model. Combined with the substation diagram, the switch fault identification during the startup process of the substation is realized, and the fault switch position is located. The experimental results show that the algorithm can accurately generate the substation model, which includes all the equipment in the substation, accurately describes the connection relationship and operation status of the equipment, and has high accuracy, integrity and aesthetics; The algorithm can effectively extract and analyze the MMCES entropy characteristics of different types of switch faults; The algorithm can realize the switch monitoring during the startup of substation C, and determine the fault switch and fault location.

PangeBlocks: customized construction of pangenome graphs via maximal blocks

BackgroundThe construction of a pangenome graph is a fundamental task in pangenomics. A natural theoretical question is how to formalize the computational problem of building an optimal pangenome graph, making explicit the underlying optimization criterion and the set of feasible solutions. Current approaches build a pangenome graph with some heuristics, without assuming some explicit optimization criteria. Thus it is unclear how a specific optimization criterion affects the graph topology and downstream analysis, like read mapping and variant calling.ResultsIn this paper, by leveraging the notion of maximal block in a Multiple Sequence Alignment (MSA), we reframe the pangenome graph construction problem as an exact cover problem on blocks called Minimum Weighted Block Cover (MWBC). Then we propose an Integer Linear Programming (ILP) formulation for the MWBC problem that allows us to study the most natural objective functions for building a graph. We provide an implementation of the ILP approach for solving the MWBC and we evaluate it on SARS-CoV-2 complete genomes, showing how different objective functions lead to pangenome graphs that have different properties, hinting that the specific downstream task can drive the graph construction phase.ConclusionWe show that a customized construction of a pangenome graph based on selecting objective functions has a direct impact on the resulting graphs. In particular, our formalization of the MWBC problem, based on finding an optimal subset of blocks covering an MSA, paves the way to novel practical approaches to graph representations of an MSA where the user can guide the construction.

Assessment Tools for Masticatory Function in Periodontitis Patients: A Scoping Review.

The aim of this scoping review was to map the available evidence on assessment tools for masticatory function for periodontitis patients. It also aimed to examine the methodology of masticatory function assessment and to identify the elements of subjective masticatory function evaluation for periodontitis patients reported in the literature. A scoping review was conducted following the methodological guidance for the conduct of scoping reviews. Embase, MEDLINE, Web of Science, and Scopus were systematically searched for published studies in English reporting objective or subjective masticatory function assessment in periodontitis patients. Forty-five studies were included in the analysis. The identified assessment tools for masticatory function were summarized using the terminology described by the recent consensus. Heterogeneity was observed in the approach of assessment, the type(s) and design of assessment tools, and the methods of measurement employed. Most studies utilized only one assessment tool. Seven studies reported composite objective assessment and five studies utilized assessment tools for both objective and subjective masticatory function. Items from the included instruments for subjective masticatory function were analyzed and categorized into seven potentially clinically relevant elements of subjective masticatory function evaluation. Unclear reporting on validation status was found in all included instruments for subjective masticatory function. Variable methodologies have been reported to assess masticatory function in periodontitis patients. Future research is needed to discern the clinical utility of these assessment tools for masticatory function in periodontitis patients.

Optimal performance design of bat algorithm: An adaptive multi‐stage structure

AbstractThe bat algorithm (BA) is a metaheuristic algorithm for global optimisation that simulates the echolocation behaviour of bats with varying pulse rates of emission and loudness, which can be used to find the globally optimal solutions for various optimisation problems. Knowing the recent criticises of the originality of equations, the principle of BA is concise and easy to implement, and its mathematical structure can be seen as a hybrid particle swarm with simulated annealing. In this research, the authors focus on the performance optimisation of BA as a solver rather than discussing its originality issues. In terms of operation effect, BA has an acceptable convergence speed. However, due to the low proportion of time used to explore the search space, it is easy to converge prematurely and fall into the local optima. The authors propose an adaptive multi‐stage bat algorithm (AMSBA). By tuning the algorithm's focus at three different stages of the search process, AMSBA can achieve a better balance between exploration and exploitation and improve its exploration ability by enhancing its performance in escaping local optima as well as maintaining a certain convergence speed. Therefore, AMSBA can achieve solutions with better quality. A convergence analysis was conducted to demonstrate the global convergence of AMSBA. The authors also perform simulation experiments on 30 benchmark functions from IEEE CEC 2017 as the objective functions and compare AMSBA with some original and improved swarm‐based algorithms. The results verify the effectiveness and superiority of AMSBA. AMSBA is also compared with eight representative optimisation algorithms on 10 benchmark functions derived from IEEE CEC 2020, while this experiment is carried out on five different dimensions of the objective functions respectively. A balance and diversity analysis was performed on AMSBA to demonstrate its improvement over the original BA in terms of balance. AMSBA was also applied to the multi‐threshold image segmentation of Citrus Macular disease, which is a bacterial infection that causes lesions on citrus trees. The segmentation results were analysed by comparing each comparative algorithm's peak signal‐to‐noise ratio, structural similarity index and feature similarity index. The results show that the proposed BA‐based algorithm has apparent advantages, and it can effectively segment the disease spots from citrus leaves when the segmentation threshold is at a low level. Based on a comprehensive study, the authors think the proposed optimiser has mitigated the main drawbacks of the BA, and it can be utilised as an effective optimisation tool.

Deephive: A Reinforcement Learning Approach for Automated Discovery of Swarm-Based Optimization Policies

We present an approach for designing swarm-based optimizers for the global optimization of expensive black-box functions. In the proposed approach, the problem of finding efficient optimizers is framed as a reinforcement learning problem, where the goal is to find optimization policies that require a few function evaluations to converge to the global optimum. The state of each particle within the swarm is defined as its current position and function value within a design space, and the particles learn to take favorable actions that maximize the reward, which is based on the final value of the objective function. The proposed approach is tested on 50 benchmark optimization functions and compared to the performance of other global optimization strategies. Furthermore, the generalization capabilities of the trained particles on the four categories of optimization benchmark functions are investigated. The results show superior performance compared to the other optimizers, desired scaling when the dimension of the functions is varied, and acceptable performance even when applied to unseen functions. On a broader scale, the results show promise for the rapid development of domain-specific optimizers.

Optimization of Rotary Drilling Rig Mast Structure Based on Multi-Dimensional Improved Salp Swarm Algorithm

The mast is a critical component of rotary drilling rigs, which has a cross-section consisting of a rectangular shape formed by two web plates and two flange plates. Structural optimization of the mast is necessary to address the issue of excessive weight. The shortcomings of the traditional structural optimization algorithms are summarized as follows: the optimized steel plate thickness is a non-integer, where rounding upwards may increase the cost to a certain extent, but it can ensure the safety of the structure; rounding downwards its load carrying capacity may not satisfy the requirements, and thus a novel Salp Swarm Algorithm is proposed to solve the optimization problem. First, this study improves the initialization and update strategy in the traditional Salp Swarm Algorithm. In order to obtain a solution for engineering, an innovative multi-dimensional running comparison is carried out. Secondly, the optimization model of rotary drilling rigs is established based on the division of the working conditions. The objective function of the optimization model is to minimize the weight of the mast while considering the constraints of strength, stiffness, stability, and welding process. Finally, the proposed optimization algorithm and the established optimization model are applied to optimize the design of the mast for a rotary drilling rig. The empirical results demonstrate that the weight of the mast has been reduced by 20%. In addition, the Improved Salp Swarm Algorithm exhibits higher solution quality, faster iteration capability, and extreme stability in optimizing welded box sections compared to the conventional algorithm. The example shows that the Improved Salp Swarm Algorithm is applicable to the optimization problem of box sections.

Robustifying Conditional Portfolio Decisions via Optimal Transport

We propose a data-driven portfolio selection model that integrates side information, conditional estimation, and robustness using the framework of distributionally robust optimization. Conditioning on the observed side information, the portfolio manager solves an allocation problem that minimizes the worst-case conditional risk-return tradeoff, subject to all possible perturbations of the covariate-return probability distribution in an optimal transport ambiguity set. Despite the nonlinearity of the objective function in the probability measure, we show that the distributionally robust portfolio allocation with a side information problem can be reformulated as a finite-dimensional optimization problem. If portfolio decisions are made based on either the mean-variance or the mean-conditional value-at-risk criterion, the reformulation can be further simplified to second-order or semidefinite cone programs. Empirical studies in the U.S. equity market demonstrate the advantage of our integrative framework against other benchmarks. Funding: The material in this paper is based on work supported by the Air Force Office of Scientific Research [Award FA9550-20-1-0397]. Additional support is gratefully acknowledged from the National Science Foundation [Grants 1915967, 1820942, and 1838676], the Natural Sciences and Engineering Research Council of Canada [Grant RGPIN-2016-05208], and the China Merchant Bank. V. A. Nguyen gratefully acknowledges the generous support from the Chinese University of Hong Kong [Improvement on Competitiveness in Hiring New Faculties Funding Scheme] and the Chinese University of Hong Kong [Direct Grant 4055191]. S. Wang is partially supported by the National Natural Science Foundation of China [Grant 72371022]. Finally, this research was enabled in part by support provided by Compute Canada. Supplemental Material: The computer code and data that support the findings of this study and the online appendix are available within this article’s supplemental material at https://doi.org/10.1287/opre.2021.0243 .

Point-feature label placement with maximum entropy principle

A map becomes readable and translatable only after the use of labels. High-quality label placement (i.e., labelling) is a combinatorial optimization problem, where one or more objective functions are required. However, such objective functions are still not well achieved in existing methods with commonly used labelling rules (e.g., “avoidance of overlapping labels” and “placement at priority positions”). In this study, we define a new objective function using the maximum entropy principle and employ a modified genetic algorithm in the optimization process. Comparative experiments have been conducted with 29 existing labelling methods in a dataset of 1000 points. Experimental results show that the average percentage of non-overlapping labels by this new method reaches 94.73% (i.e., being ranked second in all 30 methods) and has no statistically significant difference from the best one (i.e., 94.87%). By further analysis, it is found that this new method not only can place more labels in priority positions than the method being ranked first but also has the potential to place labels for line and area features. Such results indicate that the maximum entropy principle may pave the way for further research in cartography.

Multi-objective optimization and exergoeconomic analysis of a novel solar desalination system with absorption cooling

This paper presents a novel design for a solar-powered desalination system utilizing a single-effect absorption refrigeration cycle with a flat-plate solar collector. The NH3-H2O working fluid pair in the refrigeration subsystem produces chilled water while the rejected heat from the condenser drives a humidification-dehumidification (HDH) subsystem for freshwater generation. This cycle has been analyzed thermodynamically and exergetically to understand its key performance parameters. Furthermore, for a detailed examination and optimization, an exergoeconomic analysis was also conducted. Design parameters for this study include the tilt angle of the solar collector, Volume fraction of nanoparticles in the CuO nanofluid, Solar collector area, Base fluid mass flow rate in the collector, Mass flow rate of the strong solution, Absorber and condenser temperatures, Mass ratio and Humidifier effectiveness. The Objective functions used to evaluate the system, performance are the Cooling effect of performance (COP), Energy performance (EP), Exergy efficiency (μExe), and the Total product cost rate of the system (Ċp,Tot). The genetic algorithm optimization is employed to find the best system performance using two sets of three objective functions. The effectiveness of multi-objective optimization using LINMAP, TOPSIS, and Shannon Entropy methods is demonstrated. LINMAP and TOPSIS consistently achieved improvements in COP (32–42 %), exergy efficiency (33–48 %), and reduced total cost (89–90 %) compared to the base point, while Shannon Entropy offered slightly lower gains. These methods consistently identify superior system configurations, achieving significant improvements in performance while minimizing the total product cost rate.

Capacity Optimization of Wind–Solar–Storage Multi-Power Microgrid Based on Two-Layer Model and an Improved Snake Optimization Algorithm

A two-layer optimization model and an improved snake optimization algorithm (ISOA) are proposed to solve the capacity optimization problem of wind–solar–storage multi-power microgrids in the whole life cycle. In the upper optimization model, the wind–solar–storage capacity optimization model is established. It takes wind–solar power supply and storage capacity as decision variables and the construction cost of the whole life cycle as the objective function. At the lower level, the optimal scheduling model is established, considering the output characteristics of various types of power supplies and energy storage, microgrid sales, and purchases of power as constraints. At the same time, the model considers constraints, such as the power balance, the operating state of the energy storage system, the power sales and purchases, and the network fluctuations, to ensure the system operates efficiently. Taking a microgrid in South China as an application scenario, the model is solved and the optimal capacity allocation scheme of the microgrid is obtained. Meanwhile, the demand response mechanism and the influence of planning years are introduced to further optimize the configuration scheme, and the impact of different rigid–flexible load ratios and various planning horizons on microgrid capacity optimization is analyzed, respectively, by a numerical example. The comparison shows that the ISOA has better optimization performance in solving the proposed two-layer model.

Euler Kernel Mapping for Hyperspectral Image Clustering via Self-Paced Learning

Clustering, as a classical unsupervised artificial intelligence technology, is commonly employed for hyperspectral image clustering tasks. However, most existing clustering methods designed for remote sensing tasks aim to solve a non-convex objective function, which can be optimized iteratively, beginning with random initializations. Consequently, during the learning phase of the clustering model, it may easily fall into bad local optimal solutions and finally hurt the clustering performance. Additionally, prevailing approaches often exhibit limitations in capturing the intricate structures inherent in hyperspectral images and are very sensitive to noise and outliers that widely exist in remote sensing data. To address these issues, we proposed a novel Euler kernel mapping for hyperspectral image clustering via self-paced learning (EKM-SPL). EKM-SPL first employs self-paced learning to learn the clustering model in a meaningful order by progressing samples from easy to complex, which can help to remove bad local optimal solutions. Secondly, a probabilistic soft weighting scheme is employed to measure complexity across the data sample, which makes the optimization process more reasonable. Thirdly, in order to more accurately characterize the intricate structure of hyperspectral images, Euler kernel mapping is used to convert the original data into a reproduced kernel Hilbert space, where the nonlinearly inseparable clusters may become linearly separable. Moreover, we innovatively integrate the coordinate descent technique into the optimization algorithm to circumvent the computational inefficiencies and information loss typically associated with conventional kernel methods. Extensive experiments conducted on classic benchmark hyperspectral image datasets illustrate the effectiveness and superiority of our proposed model.

Maximizing energy efficiency and system throughput using a self-adaptive penalty function with a whale optimization algorithm in social-aware device-to-device communications

Device-to-device (D2D) communication is an emerging approach for 5 G networks. It allows for high capacity, low latency, and increased bandwidth. These features have prompted several research studies to focus on meeting customers’ expectations. This research concentrates on obtaining optimal resource and power allocation, better quality of service, and reliable connectivity between D2D clients through a whale optimization algorithm (WOA). The WOA possesses greater stability, faster integration speeds, a powerful global search ability, and greater accuracy than traditional methods. The WOA utilizes an unconstrained objective function obtained through a self-adaptive penalty function. This unconstrained objective function yields optimal solutions for the resource as well as power allocation, higher throughputs, and energy and spectral efficiencies in D2D communications. For D2D communications, the energy efficiency of the WOA is 47.12 % higher than a genetic algorithm (GA) and 70.33 % higher than particle swarm optimization (PSO), and it yields high spectral efficiency and system throughput. Obviously, the WOA in this proposal is more efficient than a GA or PSO and shows the advantages of combining physical and social parameters for improved wireless network performance.