Search

With the development of artificial intelligence, computer intelligent grouping, as a research hotspot of political ideology examination paper proposition, can greatly shorten the time of generating examination papers, reduce the human cost, reduce the human factor, and improve the quality of political ideology teaching evaluation. Aiming at the problem that the current political ideology examination paper-grouping strategy method easily falls into the local optimum, a kind of intelligent paper-grouping method for political ideology examination based on the improved stock market trading optimisation algorithm is proposed. Firstly, by analyzing the traditional steps of political test paper generation, according to the index genus of the grouping problem and the condition constraints, we construct the grouping model of political thought test questions; then, combining the segmented real number coding method and the fitness function, we use the securities market trading optimization algorithm based on the Circle chaotic mapping initialization strategy and adaptive tdistribution variability strategy to solve the grouping problem of the political thought test. The experimental results show that the method can effectively find the optimal strategy of political thought exam grouping, and the test questions have higher knowledge point coverage, moderate difficulty, and more stable performance. [ABSTRACT FROM AUTHOR]

This document is a special issue of the journal Algorithms, featuring selected papers from the journal's editorial board members from 2022 and 2023. The issue includes 16 research papers covering a range of topics such as game theory, fault detection in cellular networks, optimization algorithms, machine learning, cryptocurrency trading, and more. Each paper presents its own unique research findings and methodologies. The issue aims to showcase the diverse research interests and expertise of the journal's editorial board members. [Extracted from the article]

This paper proposes the shortest path optimization algorithm for domestic and overseas e-commerce logistics based on a bilateral search method. This paper uses the logistics distribution route optimization algorithm based on the shortest path to set the collaborative parameters. Then, it builds an adaptive optimization model for the grid planning of domestic and overseas e-commerce logistics path. The route is optimized. Then, the PSO and genetic algorithm are integrated to establish the logistics path planning model of domestic and overseas e-commerce. The superiority of the proposed route optimization algorithm in domestic and overseas e-commerce logistics distribution is verified through simulation experiments. This algorithm has high spatial positioning efficiency and high transportation efficiency. [ABSTRACT FROM AUTHOR]

To improve the beam collection efficiency (BCE) of the microwave wireless power transmission (MWPT) system while reducing the peak sidelobe level outside the receiving area (CSL) and system cost, this paper proposes a new subarray partition technique and a nonuniform sparsely distributed quadrant symmetric planar array (NSDQSPA) model. A particle swarm optimization algorithm based on multiple-objective with nonlinear time-variant inertia and learning factor improved particle swarm optimization (MO-NTVILFIPSO) is also proposed. The one-step multi-objective subarray partition algorithm adopts dynamic weight and dynamic learning factor to carry out one-step optimization on the array element arrangement of the transmitting array. The optimization algorithm simultaneously optimizes two performance indicators: the BCE, which represents the optimization accuracy for the BCE, and the aref, which represents the mean square error of the excitation amplitude before and after the subarray partition. Many simulation results show that the BCE is 94.91%, and the CSL is -13.41 dB when the transmitting array with an aperture of 4.5? × 4.5? is divided into six subarrays. The simulation results further demonstrate that the proposed subarray division method is appropriate for the MWPT system and that the algorithm in this paper, when the array elements with the same excitation amplitude are divided for the planar transmitting array on the array model, and can guarantee relatively high BCE and relatively low complexity of the system feed network. [ABSTRACT FROM AUTHOR]

Based on the applications of BSO algorithms for KSP, the properties of different swarm optimization algorithms can be understood better. The comparison result of the proposed algorithm with other algorithms proves that EDOLSCA also has advantages in heat exchanger optimal design. Finally, the experimental results confirm the efficiency of the proposed scheme in real-world urban scenarios; The last paper by Lidong Zhang et al. on "Elite and dynamic opposite learning enhanced sine cosine algorithm for application to plat-fin heat exchangers design problem" proposes a novel variant of sine and cosine algorithm named EDOLSCA enhanced by dynamic opposite learning algorithm and the elite strategy. [Extracted from the article]

The paper [[10]] considers an assignment problem and some modifications which can be converted to routing, distribution, or scheduling problems. This special issue of I Algorithms i is dedicated to recent developments of scheduling algorithms and new applications. References 1 Werner F., Burtseva L., Sotskov Y. Special Issue on Algorithms for Scheduling Problems. For this problem, a hybrid metaheuristic algorithm is presented which combines a genetic algorithm with a so-called spotted hyena optimization algorithm. [Extracted from the article]

The ship piping layout is one of the essential tasks in the detailed design stage of a ship. Traditional manual expert design has disadvantages such as low efficiency, reliance on experience, and subjective influence. Therefore, this paper systematically proposes an intelligent arrangement method for ships' single, parallel, and branch pipelines. Firstly, the traditional genetic algorithm is improved and combined with the A* algorithm to solve the intelligent arrangement problem of a single pipeline in ships. Then, the parallel pipeline and branch pipeline are split into multiple single pipelines by combining with the connection point strategy to solve the arrangement problem of parallel pipeline and branch pipeline. Finally, the optimized A*-genetic algorithm proposed in this paper is compared with the A* algorithm, particle swarm algorithm, and the labyrinth-genetic algorithm used in previous research through simulation experiments. The results show that the A*-genetic algorithm of this paper is optimal in six indexes, including length, number of elbows, energy value, fitness value, number of optimal solutions, and average number of convergence generations, in the arrangement of the single pipeline. In solving the parallel pipeline and branch pipeline arrangement problems, the all-around performance of this paper's algorithm is better than that of A*-genetic algorithm and maze–genetic algorithm, respectively. The A*-genetic algorithm of this paper considers the quality of pipeline arrangement and the solution's efficiency. It verifies the adaptability and superiority of the algorithm for the intelligent arrangement of various types of pipelines in ship pipelines. [ABSTRACT FROM AUTHOR]

The Parker-Oldenburg method, as a classical frequency-domain algorithm, has been widely used in Moho topographic inversion. The method has two indispensable hyperparameters, which are the Moho density contrast and the average Moho depth. Accurate hyperparameters are important prerequisites for inversion of fine Moho topography. However, limited by the nonlinear terms, the hyperparameters estimated by previous methods have obvious deviations. For this reason, this paper proposes a new method to improve the existing ParkerOldenburg method by taking advantage of the invasive weed optimization algorithm in estimating hyperparameters. The synthetic test results of the new method show that, compared with the trial and error method and the linear regression method, the new method estimates the hyperparameters more accurately, and the computational efficiency performs excellently, which lays the foundation for the inversion of more accurate Moho topography. In practice, the method is applied to the Moho topographic inversion in the South China Sea. With the constraints of available seismic data, the crust-mantle density contrast and the average Moho depth in the South China Sea are determined to be 0.535 g/cm3 and 21.63 km, respectively, and the Moho topography of the South China Sea is inverted based on this. The results of the Moho topography show that the Moho depth in the study area ranges from 5.7 km to 32.3 km, with more obvious undulations. Among them, the shallowest part of the Moho topography is mainly located in the southern part of the Southwestern sub-basin and the southern part of the Manila Trench, with a depth of about 6 km. Compared with the CRUST 1.0 model and the model calculated by the improved Bott's method, the RMS between the Moho model and the seismic point difference in this paper is smaller, which proves that the method in this paper has some advantages in Moho topographic inversion. [ABSTRACT FROM AUTHOR]

This review paper synthesizes the recent advancements in voltage regulation techniques for active distribution networks (ADNs), particularly in contexts with high renewable energy source (RES) penetration, using photovoltaics (PVs) as a highlighted example. It covers a comprehensive analysis of various innovative strategies and optimization algorithms aimed at mitigating voltage fluctuations, optimizing network performance, and integrating smart technologies like smart inverters and energy storage systems (ESSs). The review highlights key developments in decentralized control algorithms, multi-objective optimization techniques, and the integration of advanced technologies such as soft open points (SOPs) to enhance grid stability and efficiency. The paper categorizes these strategies into two main types: analytical methods and computational methods. In conclusion, this review underscores the critical need for advanced analytical and computational methods in the voltage regulation of ADNs with high renewable energy penetration levels, highlighting the potential for significant improvements in grid stability and efficiency. [ABSTRACT FROM AUTHOR]

This paper presents a multi-objective optimization analysis to improve the controller tuning of three-element control loop for the best fit to both its servo and regulatory control objectives during the process operations. The existing Proportional-Integral-Derivative (PID) controller tuning for the three-element control loop is challenging because the best setting of each controller is obtained during the concurrent analysis, but all controller settings affect the control performance of other control loops and the output responses. Furthermore, this paper highlights the determination of Upper Limit (UL) and Lower Limit (LL) bounds by using the necessity criterion of Routh-Hurwitz stability analysis. The Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are used as the optimization algorithms to improve the control performances. Both optimization analysis are operated by using a developed Graphical User Interface (GUI) via MATLAB software. At the same time, the optimized PID controller settings are applied to the steam boiler drum function of the LOOP-PRO simulator. Both GA and PSO outperform the manual tuning for the three-element loop. Among them, GA performs better than PSO even though both methods are capable of suggesting highly satisfactory performances. [ABSTRACT FROM AUTHOR]

An optimization algorithm based on the LMPEC algorithm is proposed to rectify the nameplate image to address the problem that overexposure and underexposure of the nameplate image of electrical equipment will make subsequent nameplate recognition difficult. In the network structure, the PS-UNet++ network is based on the sub-pixel convolution upsampling module, and the UNet++ network is constructed as the feature extraction sub-network of the optimization algorithm to extract more detailed information from the model. Smooth L1 loss is substituted for L1 loss in the loss function to prevent model oscillation. In addition, to increase the robustness of the model, an improved method built on the multi-scale training method is applied. The experimental results indicate that, among all comparison algorithms, the optimized algorithm performs the best on the data set of electrical equipment nameplate exposure the experimenter generated. Compared to the original LMPEC algorithm, the SSIM, PSNR, and PI image evaluation indices are enhanced by 5.6%, 5.1%, and 7.96%, respectively. [ABSTRACT FROM AUTHOR]

Debris flow risk assessment can provide some reference for debris flow prevention and control projects. In risk assessment, researchers often only focus on the impact of objective or subjective indicators. For this purpose, this paper proposed a weight calculation method based on t-distribution and linear programming optimization algorithm (LPOA). Taking 72 mudslides in Beichuan County as an example, this paper used analytic hierarchy process (AHP), entropy weight method (EWM) and variation coefficient method (VCM) to obtain the initial weights. Based on the initial weights, weight intervals with different confidence levels were obtained by t-distribution. Subsequently, the final weights were obtained by LOPA in the 90% confidence interval. Finally, the final weights were used to calculate the risk score for each debris flow, thus delineating the level of risk for each debris flow. The results showed that this paper's method can avoid overemphasizing the importance of a particular indicator compared to EWM and VCM. In contrast, EWM and VCM ignored the effect of debris flow frequency on debris flow risk. The assessment results showed that the 72 debris flows in Beichuan County were mainly dominated by moderate and light risks. Of these, there were 8 high risk debris flows, 24 medium risk debris flows, and 40 light risk debris flows. The excellent triggering conditions provide favorable conditions for the formation of high-risk debris flows. Slightly and moderate risk debris flows are mainly located on both sides of highways and rivers, still posing a minor threat to Beichuan County. The proposed fusion weighting method effectively avoids the limitations of single weight calculating method. Through comparison and data analysis, the rationality of the proposed method is verified, which can provide some reference for combination weighting method and debris flow risk assessment. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a novel Multi-scale and Auto-tuned Semi-supervised Deep Subspace Clustering (MAS-DSC) algorithm, aimed at addressing the challenges of deep subspace clustering in high-dimensional real-world data, particularly in the field of medical imaging. Traditional deep subspace clustering algorithms, which are mostly unsupervised, are limited in their ability to effectively utilize the inherent prior knowledge in medical images. Our MAS-DSC algorithm incorporates a semi-supervised learning framework that uses a small amount of labeled data to guide the clustering process, thereby enhancing the discriminative power of the feature representations. Additionally, the multi-scale feature extraction mechanism is designed to adapt to the complexity of medical imaging data, resulting in more accurate clustering performance. To address the difficulty of hyperparameter selection in deep subspace clustering, this paper employs a Bayesian optimization algorithm for adaptive tuning of hyperparameters related to subspace clustering, prior knowledge constraints, and model loss weights. Extensive experiments on standard clustering datasets, including ORL, Coil20, and Coil100, validate the effectiveness of the MAS-DSC algorithm. The results show that with its multi-scale network structure and Bayesian hyperparameter optimization, MAS-DSC achieves excellent clustering results on these datasets. Furthermore, tests on a brain tumor dataset demonstrate the robustness of the algorithm and its ability to leverage prior knowledge for efficient feature extraction and enhanced clustering performance within a semi-supervised learning framework. [ABSTRACT FROM AUTHOR]

This paper proposes an optimal power flow model that takes into account the uncertainty in the probability distribution of wind power. The model can schedule controllable generators under any possible distribution of wind power to ensure the safe and economic operation of the system. Firstly, considering the incompleteness of historical wind power data, the paper models the uncertainty of wind power using second-order moments of probability distribution and their fluctuation intervals. Subsequently, a robust optimal power flow model based on probability distribution model and joint chance constraints is established. The Lagrangian duality theorem is then employed to eliminate random variables from the optimization model, transforming the uncertainty model into a deterministic linear matrix inequality problem. Finally, a convex optimization algorithm is used to solve the deterministic problem, and the results are compared with traditional chance-constrained optimal power flow model. The feasibility and effectiveness of the proposed method are validated through case study simulations. [ABSTRACT FROM AUTHOR]

Reservoir flood control scheduling is a challenging optimization task, particularly due to the complexity of various constraints. This paper proposes an innovative algorithm design approach to address this challenge. Combining the basic walrus optimization algorithm with the adaptive ε-constraint method and introducing the SPM chaotic mapping for population initialization, spiral search strategy, and local enhancement search strategy based on Cauchy mutation and reverse learning significantly enhances the algorithm's optimization performance. On this basis, innovate an adaptive approach ε A New Algorithm for Constraints and Multi Strategy Optimization Improvement (ε-IWOA). To validate the performance of the ε-IWOA algorithm, 24 constrained optimization test functions are used to test its optimization capabilities and effectiveness in solving constrained optimization problems. Experimental results demonstrate that the ε-IWOA algorithm exhibits excellent optimization ability and stable performance. Taking the Taolinkou Reservoir, Daheiting Reservoir, and Panjiakou Reservoir in the middle and lower reaches of the Luanhe River Basin as a case study, this paper applies the ε-IWOA algorithm to practical reservoir scheduling problems by constructing a three-reservoir flood control scheduling system with Luanxian as the control point. A comparative analysis is conducted with the ε-WOA, ε-DE and ε-PSO (particle swarm optimization) algorithms.The experimental results indicate that ε-IWOA algorithm performs the best in optimization, with the occupied flood control capacity of the three reservoirs reaching 89.32%, 90.02%, and 80.95%, respectively. The control points in Luan County can reduce the peak by 49%.This provides a practical and effective solution method for reservoir optimization scheduling models. This study offers new ideas and solutions for flood control optimization scheduling of reservoir groups, contributing to the optimization and development of reservoir scheduling work. [ABSTRACT FROM AUTHOR]

Objective. The percutaneous puncture lung mass biopsy procedure, which relies on preoperative CT (Computed Tomography) images, is considered the gold standard for determining the benign or malignant nature of lung masses. However, the traditional lung puncture procedure has several issues, including long operation times, a high probability of complications, and high exposure to CT radiation for the patient, as it relies heavily on the surgeon's clinical experience. Approach. To address these problems, a multi-constrained objective optimization model based on clinical criteria for the percutaneous puncture lung mass biopsy procedure has been proposed. Additionally, based on fuzzy optimization, a multidimensional spatial Pareto front algorithm has been developed for optimal path selection. The algorithm finds optimal paths, which are displayed on 3D images, and provides reference points for clinicians' surgical path planning. Main results. To evaluate the algorithm's performance, 25 data sets collected from the Second People's Hospital of Zigong were used for prospective and retrospective experiments. The results demonstrate that 92% of the optimal paths generated by the algorithm meet the clinicians' surgical needs. Significance. The algorithm proposed in this paper is innovative in the selection of mass target point, the integration of constraints based on clinical standards, and the utilization of multi-objective optimization algorithm. Comparison experiments have validated the better performance of the proposed algorithm. From a clinical standpoint, the algorithm proposed in this paper has a higher clinical feasibility of the proposed pathway than related studies, which reduces the dependency of the physician's expertise and clinical experience on pathway planning during the percutaneous puncture lung mass biopsy procedure. [ABSTRACT FROM AUTHOR]

This document is a special issue of the journal Mathematics dedicated to recent advances in discrete optimization and scheduling. The issue includes 10 papers covering a range of topics such as batch loading and scheduling, optimization algorithms, scheduling surgeries, routing problems, and mathematical models for simplification. The papers present various approaches and algorithms for solving these problems, and they have been reviewed by experts in the field. The authors express their gratitude to the contributors, reviewers, and editorial staff, and hope that the readers will find stimulating ideas for further research in this area. [Extracted from the article]

The significance of big data are prone to complication in solving optimization issues. In several scenarios, one requires adapting several contradictory goals and satisfies various criterions. This made the research on multi-objective optimization more vital and has become main topic. This paper presents theoretical analysis and comparative study of top ten optimization algorithms with respect to DMS. The performance analysis and study of optimization algorithms in big data streaming are explicated. Here, the top ten algorithms of optimization based on recency and popularity are considered. In addition, the performance analysis based on Efficiency, Reliability, Quality of solution, and superiority of DMS algorithm over other top 10 algorithms are examined. From analysis, the DMS provides better efficiency as it endeavours less computational effort to generate better solution, due to acquisition of both DA and MS algorithm's benefits and DMS takes less time to process a task. Moreover, the DMS needs less number of iterations in the process of optimization and helps to stop optimization process in local optimum. In addition, the DMS has better reliability as it poses the potential to handle specific level of performance. In addition, the DMS utilizes heuristic information for attaining high reliability. Moreover, the DMS produced high computation accuracy, which reveals its solution quality. From the analysis, it is noted that DMS attained improved outcomes in terms of efficiency, reliability and solution quality in contrast to other top 10 optimization algorithms. [ABSTRACT FROM AUTHOR]

This paper attempts to elucidate the transformative integration of computational techniques within power systems, underscoring their critical role in enhancing system modeling, control, and the efficient integration of renewable energy. It breaks down the two-sided nature of technological progress, highlighting both gains in operational efficiency and new challenges such as real-time processing, data management, and cybersecurity. Through meticulous analysis of query-based research patterns and mathematical frameworks, this study delves into the balancing act between specificity and breadth in scholarly inquiries while evaluating the impact and evolution of research trends through citation analysis. The convergence of interests and transient research trends is evident, particularly in Artificial Intelligence and optimization. This comprehensive narrative anticipates a sophisticated trajectory for power systems, advocating for continuous innovation and strategic research to foster sustainable, resilient, and intelligent energy networks. [ABSTRACT FROM AUTHOR]

This paper presents a survey for optimization approaches that analyze and classify electroencephalogram (EEG) signals. The automatic analysis of EEG presents a significant challenge due to the high-dimensional data volume. Optimization algorithms seek to achieve better accuracy by selecting practical features and reducing unwanted features. Forty-seven reputable research papers are provided in this work, emphasizing the developed and executed techniques divided into seven groups based on the applied optimization algorithm particle swarm optimization (PSO), ant colony optimization (ACO), artificial bee colony (ABC), grey wolf optimizer (GWO), Bat, Firefly, and other optimizer approaches). The main measures to analyze this paper are accuracy, precision, recall, and F1-score assessment. Several datasets have been utilized in the included papers like EEG Bonn University, CHB-MIT, electrocardiography (ECG) dataset, and other datasets. The results have proven that the PSO and GWO algorithms have achieved the highest accuracy rate of around 99% compared with other techniques. [ABSTRACT FROM AUTHOR]

This paper proposes a weakly-supervised structural surface crack detection algorithm that can detect the crack area in an image with low data labeling cost. The algorithm consists of a convolutional neural networks Vgg16-Crack for classification, an improved and optimized class activation map (CAM) algorithm for accurately reflecting the position and distribution of cracks in the image, and a method that combines superpixel segmentation algorithm simple linear iterative clustering (SLIC) with CAM for more accurate semantic segmentation of cracks. In addition, this paper uses Bayesian optimization algorithm to obtain the optimal parameter combination that maximizes the performance of the model. The test results show that the algorithm only requires image-level labeling, which can effectively reduce the labor and material consumption brought by pixel-level labeling while ensuring accuracy. [ABSTRACT FROM AUTHOR]

Considering that social network provides a channel for nodes to exchange information, resources, and interests, the fundamental task of social network search is to find the best path from the source node to the target node. The search strategy based on the shortest path principle ignores the strength and direction of the social relationship between nodes in the social network, and ignores the difference of influence between nodes, so that the search results cannot meet the needs of searchers. Considering the important role of the influence of nodes and the influence intensity between nodes in social network search, this paper proposes the path optimization principle of maximizing the comprehensive influence, and constructs a new search algorithm based on this strategy by applying the modified Dijkstra algorithm to solve the optimal path between nodes. Using the data of typical real social networks, it is verified that the path optimization algorithm based on the principle of maximizing comprehensive impact is better than the optimization algorithm based on the shortest path, and the search results are better interpretable to users. This paper had proposed a new influence maximization algorithm which has more advantages for solving social network search with high costs or benefits consideration by taking the influence intensity of nodes or between nodes into account. [ABSTRACT FROM AUTHOR]

Since various dance teaching systems have attracted much attention with the development of Artificial Intelligence (AI) technology, this paper improves the recognition performance of Latin dance teaching systems by optimizing the action recognition model. Firstly, the object detection and action recognition technology under the current AI technology is analyzed, and the Two-stage object detection algorithm and One-stage object detection algorithm are evaluated. Secondly, the technologies and functions contained in the adolescent health Latin dance teaching system are described, including image acquisition, feature extraction, object detection, and action recognition. Finally, the action recognition algorithm is optimized based on object detection, and the rationality and feasibility of the proposed algorithm are verified by experiments. The experimental results show that the optimization algorithm can search the optimal feature subset after five iterations on Undefine Classes of 101 (UCF101) dataset, but it needs seven iterations on Human Motion Database 51 (HMDB51) dataset. Meanwhile, when using support vector machine classifier, the optimization algorithm can achieve the highest accuracy of motion recognition. Regressive Function, Multinomial Naive Bayes and Gaussian Naive Bayes Algorithms have lower prediction delay, as low as 0.01s. Therefore, this paper has certain reference significance for the design and implementation of adolescent health Latin dance teaching system. [ABSTRACT FROM AUTHOR]

Cutting parameters have a significant impact on the machining effect. In order to reduce the machining time and improve the machining quality, this paper proposes an optimization algorithm based on Bp neural networkImproved Multi-Objective Particle Swarm (Bp-DWMOPSO). Firstly, this paper analyzes the existing problems in the traditional multi-objective particle swarm algorithm. Secondly, the Bp neural network model and the dynamic weight multi-objective particle swarm algorithm model are established. Finally, the Bp-DWMOPSO algorithm is designed based on the established models. In order to verify the effectiveness of the algorithm, this paper obtains the required data through equal probability orthogonal experiments on a typical Computer Numerical Control (CNC) turning machining case and uses the Bp-DWMOPSO algorithm for optimization. The experimental results show that the Cutting speed is 69.4 mm/min, the Feed speed is 0.05 mm/r, and the Depth of cut is 0.5 mm. The results show that the Bp-DWMOPSO algorithm can find the cutting parameters with a higher material removal rate and lower spindle load while ensuring the machining quality. This method provides a new idea for the optimization of turning machining parameters. [ABSTRACT FROM AUTHOR]

The optimization of the cutting path of the sample can effectively reduce the cutting time, thereby improving the production efficiency of numerical control processing. This paper comprehensively considers the impact of the cutting order and the position of the knife entry point on the cutting path, converts the cutting path problem into a type of traveling salesman problem (TSP), and proposes an improved genetic-particle swarm optimization algorithm. The selection mechanism of the algorithm combines the elitist retention strategy and roulette wheel selection method to accelerate the search for the optimal solution; the mutation strategy designs a linear decreasing mutation rate, which enhances the global search ability; at the same time, introduces the ant colony optimization algorithm to process the fitness function, adjusts the population evolution difference, and speeds up the optimization process. Through this hybrid algorithm, the cutting order of the sample can be quickly optimized, and the nearest neighbor algorithm is used to determine the position of the knife entry point. Tests are conducted on clothing patterning charts and standard examples. Compared with several commonly used algorithms, experimental results verify the feasibility and effectiveness of this algorithm. [ABSTRACT FROM AUTHOR]

In a long-distance wireless power transmission system with a non-uniform distribution of laser irradiation, it will significantly reduce the output power of the photovoltaic array, resulting in a large amount of power loss in the system and a decrease in conversion efficiency. This paper proposes an efficient and reliable optimal circuit connection algorithm for the 5 × 5 scale photovoltaic array. Under the laser illumination of 300 W, a 20 m wireless power transmission experiment was performed on four 5 × 5 scale photovoltaic arrays. The results show a 56.49% increase in the maximum output power of the 5 × 5 scale photovoltaic array. [ABSTRACT FROM AUTHOR]

Flexible job shop scheduling problem (FJSP) is the core decision-making problem of intelligent manufacturing production management. The Harris hawk optimization (HHO) algorithm, as a typical metaheuristic algorithm, has been widely employed to solve scheduling problems. However, HHO suffers from premature convergence when solving NP-hard problems. Therefore, this paper proposes an improved HHO algorithm (GNHHO) to solve the FJSP. GNHHO introduces an elitism strategy, a chaotic mechanism, a nonlinear escaping energy update strategy, and a Gaussian random walk strategy to prevent premature convergence. A flexible job shop scheduling model is constructed, and the static and dynamic FJSP is investigated to minimize the makespan. This paper chooses a twosegment encoding mode based on the job and the machine of the FJSP. To verify the effectiveness of GNHHO, this study tests it in 23 benchmark functions, 10 standard job shop scheduling problems (JSPs), and 5 standard FJSPs. Besides, this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company's FJSP. The optimized scheduling scheme demonstrates significant improvements in makespan, with an advancement of 28.16% for static scheduling and 35.63% for dynamic scheduling. Moreover, it achieves an average increase of 21.50% in the on-time order delivery rate. The results demonstrate that the performance of theGNHHO algorithm in solving FJSP is superior to some existing algorithms. [ABSTRACT FROM AUTHOR]

Over the past decade, solving complex optimization problems with metaheuristic algorithms has attracted many experts and researchers. Nature has always been a model for humans to draw the best mechanisms and the best engineering out of it and use it to solve their problems. The concept of optimization is evident in several natural processes, such as the evolution of species, the behavior of social groups, the immune system, and the search strategies of various animal populations. For this purpose, the use of nature-inspired optimization algorithms is increasingly being developed to solve various scientific and engineering problems due to their simplicity and flexibility. Anything in a particular situation can solve a significant problem for human society. This paper presents a comprehensive overview of the metaheuristic algorithms and classifications in this field and offers a novel classification based on the features of these algorithms. [ABSTRACT FROM AUTHOR]

Technological advancements for diverse aspects of life have been made possible by the swift development and application of Internet of Things (IoT) based technologies. IoT technologies are primarily intended to streamline various processes, guarantee system (technology or process) efficiency, and ultimately enhance the quality of life. An effective method for pandemic detection is the combination of deep learning (DL) techniques with the IoT. IoT proved beneficial in many healthcare domains, especially during the last worldwide health crisis: the COVID-19 pandemic. Using studies published between 2019 and 2024, this review seeks to examine the various ways that IoT-DL models contribute to pandemic detection. We obtained the titles, keywords, and abstracts of the chosen papers by using the Scopus and Web of Science (WoS) databases. This study offers a comprehensive review of the literature and unresolved problems in applying IoT and DL to pandemic detection in 19 papers that were eligible to be read from start to finish out of 2878 papers that were initially accessed. To provide practitioners, policymakers, and researchers with useful information, we examine a range of previous study goals, approaches used, and the contributions made in those studies. Furthermore, by considering the numerous contributions of IoT technologies and DL as they help in pandemic preparedness and control, we provide a structured overview of the current scientific trends and open issues in this field. This review provides a thorough overview of the state-of-the-art routing approaches currently in use, as well as their limits and potential future developments, making it an invaluable resource for DL researchers and practitioners and it is a useful tool for multidisciplinary research. [ABSTRACT FROM AUTHOR]

Vehicle-to-grid (V2G) systems play a key role in the integration of electric vehicles (EVs) into smart grids by enabling bidirectional energy flows between EVs and the grid. Optimizing V2G operations poses significant challenges due to the dynamic nature of energy demand, grid constraints, and user preferences. This paper addresses the optimization challenges in V2G systems and explores the use of artificial intelligence (AI) methods to tackle these challenges. The paper provides a comprehensive analysis of existing work on optimization in V2G systems and identifies gaps where AI-driven algorithms, machine learning, metaheuristic extensions, and agile optimization concepts can be applied. Case studies and examples demonstrate the efficacy of AI-driven algorithms in optimizing V2G operations, leading to improved grid stability, cost optimization, and user satisfaction. Furthermore, agile optimization concepts are introduced to enhance flexibility and responsiveness in V2G optimization. The paper concludes with a discussion on the challenges and future directions for integrating AI-driven methods into V2G systems, highlighting the potential for these intelligent algorithms and methods. [ABSTRACT FROM AUTHOR]

As an emerging energy allocation method, shared energy storage devices play an important role in modern power systems. At the same time, with the continuous improvement in renewable energy penetration, modern power systems are facing more uncertainties from the source side. Therefore, a robust optimization algorithm that considers both shared energy storage devices and source-side uncertainty is needed. Responding to the above issues, this paper first establishes an optimal model of a regional integrated energy system with shared energy storage. Secondly, the uncertainty problem is transformed into a dynamic optimization problem with time-varying parameters, and a modified robust optimization over time algorithm combined with scenario analysis is proposed to solve such optimization problems. Finally, an optimal scheduling objective function with the lowest operating cost of the system as the optimization objective is established. In the experimental part, this paper first establishes a dynamic benchmark test function to verify the validity of proposed method. Secondly, the multi-mode actual verification of the proposed algorithm is carried out through a regional integrated energy system. The simulation results show that the modified robust optimization over time (ROOT) algorithm could find solutions with better robustness in the same dynamic environment based on the two-stage evaluation strategy. Compared with the existing algorithms, the average fitness and survival time of the robust solution obtained by the modified ROOT algorithm are increased by 94.41% and 179.78%. At the same time, the operating cost of the system is reduced by 11.65% by using the combined optimization scheduling method proposed in this paper. [ABSTRACT FROM AUTHOR]

A stratospheric pseudolite (SP) is a pseudolite installed on a stratospheric airship. A stratospheric pseudolite network (SPN) is composed of multiple SPs, which shows promising potential in navigation applications because of its station-keeping capability, long service duration, and flexible deployment. Most traditional research about SPN geometry optimization has centered on geometric dilution of precision (GDOP). However, previous research rarely dealt with the topic of how SPN geometry configuration not only affects its GDOP, but also affects its energy balance. To obtain an optimal integrated performance, this paper employs the proportion of energy consumption in energy production as an indicator to assess SPN energy status and designs a composite indicator including GDOP and energy status to assess SPN geometry performance. Then, this paper proposes an SPN geometry optimization algorithm based on gray wolf optimization. Furthermore, this paper implements a series of simulations with an SPN composed of six SPs in a specific service area. Simulations show that the proposed algorithm can obtain SPN geometry solutions with good GDOP and energy balance performance. Also, simulations show that in the supposed scenarios and the specific area, a higher SP altitude can improve both GDOP and energy balance, while a lower SP latitude can improve SPN energy status. [ABSTRACT FROM AUTHOR]

In this paper, a joint optimization algorithm of offloading decision, energy harvesting time, and unmanned aerial vehicle (UAV) location is proposed for user equipment (UEs)'s task completion latency problem in a communication–sensing–computing integration scenario with wireless energy supply. Under the constraints of causality of energy harvesting consumption by the UEs and conditional mutual information, the total latency minimization problem of the UEs is established. Firstly, the optimization variables of the problem are transformed from three variables of offloading decision, energy harvesting time, and UAV location to two variables of offloading decision and UAV location by means of the derived closed expression, and then the transformed optimization problem is decomposed into the offloading decision optimization sub-problem and the UAV location optimization sub-problem to be solved alternately and iteratively. The genetic algorithm is employed to tackle the optimization sub-problem of offloading decisions, and the successive convex approximation algorithm is applied to the drone positioning optimization sub-problem. Simulation results show that the proposed algorithm in this paper reduces the average task completion latency by 35 percent and 15 percent, respectively, compared to the two baseline algorithms for different numbers of UEs. [ABSTRACT FROM AUTHOR]

Efficient and rapid deployment of maritime search and rescue(MSAR) resources is a prerequisite for maritime emergency search and rescue, in order to improve the efficiency and accuracy of MSAR. This paper proposes an integrated approach for emergency resource allocation. The approach encompasses three main steps: identifying accident black spots, assessing high-risk areas, and optimizing the outcomes through a synergistic combination of an optimization algorithm and reinforcement learning. In the initial step, the paper introduces the iterative self-organizing data analysis technology (ISODATA) for identifying accident spots at sea. A comparative analysis is conducted with other clustering algorithms, highlighting the superiority of ISODATA in effectively conducting dense clustering. This can effectively carry out dense clustering, instead of the situation where the data spots are too dispersed or obvious anomalies that affect the clustering. Furthermore, this approach incorporates entropy weighting to reassess the significance of accident spots by considering both the distance and the frequency of accidents. This integrated approach enhances the allocation of search and rescue forces, ensuring more efficient resource utilization. To address the MSAR vessel scheduling problem at sea, the paper employs the non-dominated sorting genetic algorithm II combined with reinforcement learning (NSGAII-RL). Comparative evaluations against other optimization algorithms reveal that the proposed approach can save a minimum of 7% in search and rescue time, leading to enhanced stability and improved efficiency in large-scale MSAR operations. Overall, the integrated approach presented in this paper offers a robust solution to the ship scheduling problem in maritime search and rescue operations. Its effectiveness is demonstrated through improved resource allocation, enhanced timeliness, and higher efficiency in responding to maritime accidents. [ABSTRACT FROM AUTHOR]

The flying foxes optimization (FFO) algorithm, as a newly introduced metaheuristic algorithm, is inspired by the survival tactics of flying foxes in heat wave environments. FFO preferentially selects the best-performing individuals. This tendency will cause the newly generated solution to remain closely tied to the candidate optimal in the search area. To address this issue, the paper introduces an opposition-based learning-based search mechanism for FFO algorithm (IFFO). Firstly, this paper introduces niching techniques to improve the survival list method, which not only focuses on the adaptability of individuals but also considers the population's crowding degree to enhance the global search capability. Secondly, an initialization strategy of opposition-based learning is used to perturb the initial population and elevate its quality. Finally, to verify the superiority of the improved search mechanism, IFFO, FFO and the cutting-edge metaheuristic algorithms are compared and analyzed using a set of test functions. The results prove that compared with other algorithms, IFFO is characterized by its rapid convergence, precise results and robust stability. [ABSTRACT FROM AUTHOR]

Twin Support Vector Machine (TSVM) is a powerful machine learning method that is usually used to solve binary classification problems. But although the classification speed and performance of TSVM is better than that of primitive support vector machine, TSVM still faces the problem of difficult parameter selection; therefore, to overcome the problem of parameter selection of TSVM, this paper proposes a Chaotic Mapping Dung Beetle Optimization Algorithm-based Twin Support Vector Machine (CMDBO-TSVM) for automatic parameter selection. Due to the uncertainty of the random initialization population of the original Dung Beetle Optimization Algorithm, this paper additionally adds chaotic mapping initialization to improve the Dung Beetle Optimization Algorithm. Experiments on the dataset through this paper show that the classification accuracy of the CMDBO-TSVM has a better performance. [ABSTRACT FROM AUTHOR]

At present, low-speed high-torque permanent magnet motors are widely used in the sampling industry, manufacturing industry and energy industry. However, the research on low-speed high-torque permanent magnet motors is far from enough. The primary difficulty in the initial design of low-speed high-torque permanent magnet motors is the selection of pole–slot ratio. The pole–slot ratio has a great influence on the electromagnetic performance such as torque ripple and the maximum output torque of low-speed motors. Choosing the appropriate pole–slot ratio scheme can make the design of a low-speed motor more efficient. In addition, the optimization design of the motor is also a necessary process. At present, there are many studies on optimization algorithms. However, the research on sample point sampling and surrogate model fitting is not enough. Choosing the appropriate sample point sampling method and surrogate model fitting method can help one obtain a more accurate surrogate model, which lays a foundation for the optimization of the motor. Based on the above analysis, this paper first selects four representative pole–slot ratio schemes for comprehensive comparison of their electromagnetic performances. Secondly, two sample point sampling methods and three surrogate model fitting methods are combined to obtain six surrogate models, and the accuracy of the six surrogate models is compared and analyzed. Finally, a 37kW,160rpm prototype is made, and the comparison of the surrogate model optimization prediction results, the finite element simulation calculation results and the measured results is carried out to further prove the accuracy of the selected surrogate model. The work performed in this paper provides a certain reference value for the initial design and optimization experiment design of low-speed high-torque permanent magnet motor. [ABSTRACT FROM AUTHOR]

In recent years, Internet of Things security incidents occur frequently, which is often accompanied by malicious events. Therefore, anomaly detection is an important part of Internet of Things security defense. In this paper, we create a process whitelist based on the K-Core decomposition method for detecting anomalous processes in IoT devices. The method first constructs an IoT process network according to the relationships between processes and IoT devices. Subsequently, it creates a whitelist and detect anomalous processes. Our work innovatively transforms process data into a network framework, employing K-Core analysis to identify core processes that signify high popularity. Then, a threshold-based filtering mechanism is applied to formulate the process whitelist. Experimental results show that the unsupervised method proposed in this paper can accurately detect anomalous processes on real-world datasets. Therefore, we believe our algorithm can be widely applied to anomaly process detection, ultimately enhancing the overall security of the IoT. [ABSTRACT FROM AUTHOR]