Search

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]

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 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]

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]

At present, any industry that wanted to be considered a vanguard must be willing to improve itself, developing innovative techniques to generate a competitive advantage against its direct competitors. Hence, many methods are employed to optimize production processes, such as Lot Streaming, which consists of partitioning the productive lots into overlapping small batches to reduce the overall operating times known as Makespan, reducing the delivery time to the final customer. This work proposes carrying out a systematic review following the PRISMA methodology to the existing literature in indexed databases that demonstrates the application of Lot Streaming in the different production systems, giving the scientific community a strong consultation tool, useful to validate the different important elements in the definition of the Makespan reduction objectives and their applicability in the industry. Two hundred papers were identified on the subject of this study. After applying a group of eligibility criteria, 63 articles were analyzed, concluding that Lot Streaming can be applied in different types of industrial processes, always keeping the main objective of reducing Makespan, becoming an excellent improvement tool, thanks to the use of different optimization algorithms, attached to the reality of each industry. [ABSTRACT FROM AUTHOR]

In this paper, a power allocation algorithm of dual-function radar–communication system with limited power is proposed to obtain better overall system performance measured by the weighted summation of radar signal to interference plus noise ratio (SINR) and communication channel capacity. First, a power allocation model is established to maximize the radar SINR and communication channel capacity with limited transmitted power. Then, the Karush–Kuhn–Tucker (KKT) conditions are used to solve the optimal objective function under the condition that only radar SINR or communication channel capacity is considered, respectively. Finally, the optimal value is combined with the original model and transformed into a single objective optimization model, and the optimal power is obtained by solving the model through the iterative optimization algorithm. Simulation results show that, compared with other power allocation algorithms, the proposed algorithm can achieve better radar-communication integration performance under the same transmit power. [ABSTRACT FROM AUTHOR]

INTRODUCTION: The article discusses the key steps in digital visual design reengineering, with a special emphasis on the importance of information decoding and feature extraction for flat cultural heritage. These processes not only minimize damage to the aesthetic heritage itself but also feature high quality, efficiency, and recyclability. OBJECTIVES: The aim of the article is to explore the issues of gene extraction methods in digital visual design reengineering, proposing a visual gene extraction method through an improved K-means clustering algorithm. METHODS: A visual gene extraction method based on an improved K-means clustering algorithm is proposed. Initially analyzing the digital visual design reengineering process, combined with a color extraction method using the improved JSO algorithm-based K-means clustering algorithm, a gene extraction and clustering method for digital visual design reengineering is proposed and validated through experiments. .ASA-RESULT: The results show that the proposed method improves the accuracy, robustness, and real-time performance of clustering. Through comparative analysis with Dunhuang murals, the effectiveness of the color extraction method based on the K-means-JSO algorithm in the application of digital visual design reengineering is verified. The method based on the K-means-GWO algorithm performs best in terms of average clustering time and standard deviation. The optimization curve of color extraction based on the K-means-JSO algorithm converges faster and with better accuracy compared to the K-means-ABC, K-means-GWO, K-means-DE, K-means-CMAES, and K-means-WWCD algorithms. CONCLUSION: The color extraction method of the K-means clustering algorithm improved by the JSO algorithm proposed in this paper solves the problems of insufficient standardization in feature selection, lack of generalization ability, and inefficiency in visual gene extraction methods. [ABSTRACT FROM AUTHOR]

In everyday life, 5G-based localization technology is commonly used, but non-line-of-sight (NLOS) environments can block the propagation of the localization signal, thus preventing localization. In order to solve this problem, this paper proposes a reconfigurable intelligent surface non-line-of-sight time difference of arrival (TDOA) localization (RNTL) algorithm. Firstly, a model of a reflective-surface-based intelligent localization (RBP) system is constructed, which utilizes multiple RISs deployed in the air to reflect signals. Secondly, in order to reduce the localization error, this paper establishes the optimization problem of minimizing the distance between each estimated coordinate and the actual coordinate and solves it via the piecewise linear chaotic map–gray wolf optimization algorithm (PWLCM-GWO). Finally, the simulation results show that the RNTL algorithm significantly outperforms the traditional gray wolf optimization and particle swarm optimization algorithms in different signal-to-noise ratios, and the localization errors are reduced by 46% and 53.5%, respectively. [ABSTRACT FROM AUTHOR]

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

This paper presents a novel hybrid algorithm based on CMOGWO-ADNSGA-II to solve the vibration stability problem during the operation of a EMS-type maglev train dynamics model subjected to strong non-linear magnetic buoyancy. The proposed algorithm optimizes the control system parameters of EMS-type maglev train suspensions by combining an improved multi-objective chaotic grey wolf algorithm (CMOGWO) with an improved non-dominated Sorting genetic algorithm-II (ADNSGA-II) to enhance the search capability of the algorithm and ensure population diversity. The efficacy of the algorithm is demonstrated by applying it to the EMS-type maglev train suspension frame control system to find the optimal control parameters. Experimental results show that the system with the optimal parameters applied significantly reduces the suspension gap amplitude and the corresponding standard deviation, as well as the vertical acceleration amplitude and the corresponding standard deviation during operation. The proposed algorithm provides a good solution for EMS-type maglev train suspension vibration control, which can improve its performance and safety. [ABSTRACT FROM AUTHOR]

The optimal operation of reservoir groups is a strongly constrained, multi-stage, and high-dimensional optimization problem. In response to this issue, this article couples the standard Pelican optimization algorithm with adaptive ε constraint methods, and further improves the optimization performance of the algorithm by initializing the population with a good point set, reverse differential evolution, and optimal individual t-distribution perturbation strategy. Based on this, an improved Pelican algorithm coupled with adaptive ε constraint method is proposed (ε-IPOA). The performance of the algorithm was tested through 24 constraint testing functions to find the optimal ability and solve constraint optimization problems. The results showed that the algorithm has strong optimization ability and stable performance. In this paper, we select Sanmenxia and Xiaolangdi reservoirs as the research objects, establish the maximum peak-cutting model of terrace reservoirs, apply the ε-IPOA algorithm to solve the model, and compare it with the ε-POA (Pelican algorithm coupled with adaptive ε constraint method) and ε-DE (Differential Evolution Algorithm) algorithms, the results indicate that ε. The peak flow rate of the Huayuankou control point solved by the IPOA algorithm is 12,319 m3/s, which is much lower than the safe overflow flow rate of 22,000 m3/s at the Huayuankou control point, with a peak shaving rate of 44%, and other algorithms do not find effective solutions meeting the constraint conditions. This paper provides a new idea for solving the problem of flood control optimal operation of cascade reservoirs. [ABSTRACT FROM AUTHOR]

This paper shows the implementation of the Moth–Flame Optimization algorithm in a Cascade-H multilevel inverter with five and seven levels to determine the optimal switching sequence of the inverter's semiconductor devices. The algorithm was coded in Matlab software, and the obtained switching sequences were implemented in a Cascade-H multilevel inverter laboratory prototype, where the output voltage waveform was obtained using a digital oscilloscope. The experimental Total Harmonic Distortion was obtained using a power quality analyzer. The experimental results show the improvement of the Total Harmonic Distortion in the voltage output. These results were compared with other papers in the literature with different metaheuristic methods concerning the same modulation. These findings demonstrate the feasibility of employing the Moth–Flame Optimization Algorithm to significantly reduce the Total Harmonic Distortion, obtaining a lower value than most analyzed papers. [ABSTRACT FROM AUTHOR]

This document discusses the importance of optimization in various fields such as statistics, biology, finance, economics, and control. It highlights the advancements made in optimization theory and methods, including first-order methods and augmented Lagrangian methods. The document also introduces a special issue on "Symmetry in Optimization Theory, Algorithms and Applications," which features five papers on topics such as ensemble learning, ant colony system algorithms, subspace algorithms, consensus problems in multi-agent systems, and dynamic conditional correlation models. The authors express their gratitude to the contributors and reviewers of the special issue. [Extracted from the article]

In this paper, the Hybrid Grey Wolf and Improved Bat Optimization Algorithm (HWIBO) is proposed to reduce the peak sidelobe level (PSLL) of linear symmetric array synthesis with aperture and element spacing constraints. The HWIBO utilizes both the Grey Wolf Optimization (GWO) and Improved Bat Algorithms (IBA) simultaneously to optimize PSLL. Each iteration generates two sets of results, and the optimal result is chosen for the next loop. Compared to other algorithms used in simulation of antenna sidelobe suppression, the HWIBO not only inherits the fast convergence advantage of the IBA which enhances population diversity but also possesses the strong global search capability of the GWO. This helps the IBA escape local optima and strengthens the global search capability during the later stages of algorithm iterations. Finally, the simulation results demonstrate the successful reduction of PSLL under various constraints, confirming the effectiveness of the hybrid algorithm. [ABSTRACT FROM AUTHOR]

An important issue in interconnected microgrids (MGs) is the realization of balance between the generation side and the demand side. Imbalanced generation and load demands lead to security, power quality, and reliability issues. The load frequency control (LFC) is accountable for regulating MG frequency against generation/load disturbances. This paper proposed an optimized fractional order (FO) LFC scheme with cascaded outer and inner control loops. The proposed controller is based on a cascaded one plus tilt derivative (1+TD) in the outer loop and an FO tilt integrator-derivative with a filter (FOTIDF) in the inner loop, forming the cascaded (1+TD/FOTIDF) controller. The proposed 1+TD/FOTIDF achieves better disturbance rejection compared with traditional LFC methods. The proposed 1+TD/FOTIDF scheme is optimally designed using a modified version of the liver cancer optimization algorithm (MLCA). In this paper, a new modified liver cancer optimization algorithm (MLCA) is proposed to overcome the shortcomings of the standard Liver cancer optimization algorithm (LCA), which contains the early convergence to local optima and the debility of its exploration process. The proposed MLCA is based on three improvement mechanisms, including chaotic mutation (CM), quasi-oppositional based learning (QOBL), and the fitness distance balance (FDB). The proposed MLCA method simultaneously adjusts and selects the best 1+TD/FOTIDF parameters to achieve the best control performance of MGs. Obtained results are compared to other designed FOTID, TI/FOTID, and TD/FOTID controllers. Moreover, the contribution of electric vehicles and the high penetration of renewables are considered with power system parameter uncertainty to test the stability of the proposed 1+TD/FOTIDF LFC technique. The obtained results under different possible load/generation disturbance scenarios confirm a superior response and improved performance of the proposed 1+TD/FOTIDF and the proposed MLCA-based optimized LFC controller. [ABSTRACT FROM AUTHOR]

In Intelligent Transport Systems (ITSs), Internet of Vehicles (IoV) communications and computation offloading technology have been introduced to assist with the burdensome sensing task processing, thus prompting a new design paradigm called mobile sensing–communication–computation (MSCC) synergy. Most researchers have focused on offloading strategy design to reduce energy consumption or execution costs, but ignore the intrinsic characteristics of tasks, which may lead to poor performance. This paper studies the offloading strategy of vehicle MSCC tasks represented by a Directed Acyclic Graph (DAG) structure. According to the DAG dependency of the subtasks, this paper proposes a computation offloading strategy to optimize energy consumption under time constraints. An energy consumption model for task execution is established. Then, the Simulated Annealing and Tabu Search hybrid optimization algorithm (ST-HO) is designed to solve the problem of minimizing the energy consumption. Crucially, this research integrates the concept of symmetry into the typical DAG structure of MSCC tasks, ensuring the integrity and efficiency of task execution in ITS. The simulation results show that ST-HO reduces energy consumption by at least 5.58% compared to the conventional algorithm. Particularly, the convergence speed of ST-HO is improved by 52.63% when the replication strategy of symmetric task is considered. [ABSTRACT FROM AUTHOR]

Software usability is usually used in reference to the hierarchical software usability model by researchers and is an important aspect of user experience and software quality. Thus, evaluation of software usability is an essential parameter for managing and regulating a software. However, it has been difficult to establish a precise evaluation method for this problem. A large number of usability factors have been suggested by many researchers, each covering a set of different factors to increase the degree of user friendliness of a software. Therefore, the selection of the correct determining features is of paramount importance. This paper proposes an innovative metaheuristic algorithm for the selection of most important features in a hierarchical software model. A hierarchy-based usability model is an exhaustive interpretation of the factors, attributes, and its characteristics in a software at different levels. This paper proposes a modified version of grey wolf optimisation algorithm (GWO) termed as modified grey wolf optimization (MGWO) algorithm. The mechanism of this algorithm is based on the hunting mechanism of wolves in nature. The algorithm chooses a number of features which are then applied to software development life cycle models for finding out the best among them. The outcome of this application is also compared with the conventional grey wolf optimization algorithm (GWO), modified binary bat algorithm (MBBAT), modified whale optimization algorithm (MWOA), and modified moth flame optimization (MMFO). The results show that MGWO surpasses all the other relevant optimizers in terms of accuracy and produces a lesser number of attributes equal to 8 as compared to 9 in MMFO and 12 in MBBAT and 19 in MWOA. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Natural Fibers is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In computerized tool path programming, the operator/user can generate the tool path based on the shape and geometry of the part to be produced by choosing from a set of predefined strategies available in the library of Computer Aided Manufacturing (CAM) software. These tool paths are typically not optimum, specifically for complex geometries. This paper employed Travelling Salesman Problem (TSP) as a foundation to propose a new tool path optimization algorithm for drilling to minimize the tool path length and subsequently reduce the time spent on nonproductive movements. The proposed algorithm was solved using local search approach in the presence of multiple constraints including geometric obstacles and initial location of tool origin. The outcome was a near-optimum tool path for drilling operations with no collision with workpiece features. The computational efficiency of the proposed algorithm was also compared with other methods in available literature using a standard workpiece as a benchmark. The results confirmed that for given examples, the near-optimum collision-free tool paths using the developed model in this paper were almost 50% shorter than the tool path generated by a commercial CAM software. [ABSTRACT FROM AUTHOR]

The field of computer science has undergone rapid expansion due to the increasing interest in improving system performance. This has resulted in the emergence of advanced techniques, such as neural networks, intelligent systems, optimization algorithms, and optimization strategies. These innovations have created novel opportunities and challenges in various domains. This paper presents a thorough examination of three intelligent methods: neural networks, intelligent systems, and optimization algorithms and strategies. It discusses the fundamental principles and techniques employed in these fields, as well as the recent advancements and future prospects. Additionally, this paper analyzes the advantages and limitations of these intelligent approaches. Ultimately, it serves as a comprehensive summary and overview of these critical and rapidly evolving fields, offering an informative guide for novices and researchers interested in these areas. [ABSTRACT FROM AUTHOR]

Flow Direction Algorithm (FDA) has better searching performance than some traditional optimization algorithms. To give the basic Flow Direction Algorithm more effective searching ability and avoid multiple local minima under the searching space, and enable it to obtain better search results, an improved FDA based on the Lévy flight strategy and the self-renewable method (LSRFDA) was proposed in this paper. The Lévy flight strategy and the self-renewable approach were added to the basic Flow Direction Algorithm. Random parameters generated by the Lévy flight strategy can increase the algorithm's diversity of feasible solutions in a short calculation time and greatly enhance the operational efficiency of the algorithm. The self-renewable method lets the algorithm quickly obtain a better possible solution and jump to the local solution space. Then, this paper tested different mathematical testing functions, including low-dimensional and high-dimensional functions, and the test results were compared with those of different algorithms. This paper includes iterative figures, box plots, and search paths to show the different performances of the LSRFDA. Finally, this paper calculated different engineering optimization problems. The test results show that the proposed algorithm in this paper has better searching ability and quicker searching speed than the basic Flow Direction Algorithm. [ABSTRACT FROM AUTHOR]

The optimization and allocation of transport cost savings among stakeholders are two important issues that influence the satisfaction of information providers, drivers and passengers in ridesharing recommendation systems. For optimization issues, finding optimal solutions for nonconvex constrained discrete ridesharing optimization problems poses a challenge due to computational complexity. For the allocation of transport cost savings issues, the development of an effective method to allocate cost savings in ridesharing recommendation systems is an urgent need to improve the acceptability of ridesharing. The hybridization of different metaheuristic approaches has demonstrated its advantages in tackling the complexity of optimization problems. The principle of the hybridization of metaheuristic approaches is similar to a marriage of two people with the goal of having a happy ending. However, the effectiveness of hybrid metaheuristic algorithms is unknown a priori and depends on the problem to be solved. This is similar to a situation where no one knows whether a marriage will have a happy ending a priori. Whether the hybridization of the Firefly Algorithm (FA) with Particle Swarm Optimization (PSO) or Differential Evolution (DE) can work effectively in solving ridesharing optimization problems needs further study. Motivated by deficiencies in existing studies, this paper focuses on the effectiveness of hybrid metaheuristic algorithms for solving ridesharing problems based on the hybridization of FA with PSO or the hybridization of FA with DE. Another focus of this paper is to propose and study the effectiveness of a new method to allocate ridesharing cost savings to the stakeholders in ridesharing systems. The developed hybrid metaheuristic algorithms and the allocation method have been compared with examples of several application scenarios to illustrate their effectiveness. The results indicate that hybridizing FA with PSO creates a more efficient algorithm, whereas hybridizing FA with DE does not lead to a more efficient algorithm for the ridesharing recommendation problem. An interesting finding of this study is very similar to what happens in the real world: "Not all marriages have happy endings". [ABSTRACT FROM AUTHOR]

With the rapid development of wireless communication networks and Internet of Things technology (IoT), higher requirements have been put forward for spectrum resource utilization and system performance. In order to further improve the utilization of spectrum resources and system performance, this paper proposes an intelligent reflecting surface (IRS)-assisted fair energy allocation algorithm for cognitive multiple-input single-output (MISO) wireless-powered networks. The goal of this paper is to maximize the minimum energy receiving power in the energy receiver, which is constrained by the signal-to-interference-plus-noise ratio (SINR) threshold of the information receiver in the secondary network, the maximum transmission power at the cognitive base station (CBS), and the interference power threshold of the secondary network on the main network. Due to the coupling between variables, this paper uses iterative optimization algorithms to optimize and solve different variables. That is, when solving the active beamforming variables, the passive beamforming variables are fixed; then, the obtained active beamforming variables are fixed, and the passive beamforming variables are solved. Through continuous iterative optimization, the system converges. The simulation results have verified the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Multifactorial optimization (MFO) is a kind of optimization problem that has attracted considerable attention in recent years. The multifactorial evolutionary algorithm utilizes the implicit genetic transfer mechanism characterized by knowledge transfer to conduct evolutionary multitasking simultaneously. Therefore, the effectiveness of knowledge transfer significantly affects the performance of the algorithm. To achieve positive knowledge transfer, this paper proposed an evolutionary multitasking optimization algorithm with adaptive transfer strategy based on the decision tree (EMT-ADT). To evaluate the useful knowledge contained in the transferred individuals, this paper defines an evaluation indicator to quantify the transfer ability of each individual. Furthermore, a decision tree is constructed to predict the transfer ability of transferred individuals. Based on the prediction results, promising positive-transferred individuals are selected to transfer knowledge, which can effectively improve the performance of the algorithm. Finally, CEC2017 MFO benchmark problems, WCCI20-MTSO and WCCI20-MaTSO benchmark problems are used to verify the performance of the proposed algorithm EMT-ADT. Experimental results demonstrate the competiveness of EMT-ADT compared with some state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

The parameter extraction of Photovoltaic (PV) cell and module is a necessary to simulate and evaluate the performance of the PV system. The parameter extraction is a complex and challenging task due to its non-linear nature. Researchers are used several metaheuristic algorithms to solve the non-linear problem of parameter extraction. However, the demand for most accurate and reliable methods is increasing to get precise estimation of parameters. In this paper, a novel hybrid optimization algorithm is proposed based on the Spotted-Hyena optimization (SHO) and Ant Lion Optimization (ALO). The hybrid method is called as Spotted Hyena - Ant Lion (SH-AL) optimization. The optimization algorithm is applied in two stages. In stage 1, essential parameters are identified and extracted using SHO and passed to stage 2. In stage 2, identified parameters are optimized using ALO for accurate model of PV cell. Different type of PV cells such as thin film, mono and multi crystalline are examined under various irradiance conditions to extract the parameters. The proposed algorithm is validated by comparing the results with other algorithms and proposed algorithm is proved its superiority. [ABSTRACT FROM AUTHOR]

The quantum alternating operator ansatz (QAOA) and its predecessor, the quantum approximate optimization algorithm, are one of the most widely used quantum algorithms for solving combinatorial optimization problems. However, as there is yet no rigorous proof of convergence for the QAOA, we provide one in this paper. The proof involves retracing the connection between the quantum adiabatic algorithm and the QAOA, and naturally suggests a refined definition of the 'phase separator' and 'mixer' keywords. [ABSTRACT FROM AUTHOR]

Operational amplifiers (Op-Amps) are critical to sensor systems because they enable precise, reliable, and flexible signal processing. Current automated Op-Amp generation methods suffer from extremely low efficiency because the time-consuming SPICE-in-the-loop sizing is normally involved as its inner loop. In this paper, we propose an efficiently automated Op-Amp generation tool using a hybrid sizing method, which combines the merits together from a deterministic optimization algorithm and differential evolution algorithm. Thus, it can not only quickly find a decent local optimum, but also eventually converge to a global optimum. This feature is well fit to be serving as an acute filter in the circuit structure evaluation flow to efficiently eliminate any undesirable circuit structures in advance of detailed sizing. Our experimental results demonstrate its superiority over traditional sizing approaches and show its efficacy in highly boosting the efficiency of automated Op-Amp structure generation. [ABSTRACT FROM AUTHOR]

The growth optimizer (GO) is a novel metaheuristic algorithm designed to tackle complex optimization problems. Despite its advantages of simplicity and high efficiency, GO often encounters localized stagnation when dealing with discretized, high-dimensional, and multi-constraint problems. To address these issues, this paper proposes an enhanced version of GO called CODGBGO. This algorithm incorporates three strategies to enhance its performance. Firstly, the Circle-OBL initialization strategy is employed to enhance the quality of the initial population. Secondly, an exploration strategy is implemented to improve population diversity and the algorithm's ability to escape local optimum traps. Finally, the exploitation strategy is utilized to enhance the convergence speed and accuracy of the algorithm. To validate the performance of CODGBGO, it is applied to solve the CEC2017, CEC2020, 18 feature selection problems, and 4 real engineering optimization problems. The experiments demonstrate that the novel CODGBGO algorithm effectively addresses the challenges posed by complex optimization problems, offering a promising approach. [ABSTRACT FROM AUTHOR]

With the rapid development of new power systems, diverse new power services have imposed stricter requirements on network resources and performance. However, the traditional method of transmitting request data to the IoT management platform for unified processing suffers from large delays due to long transmission distances, making it difficult to meet the delay requirements of new power services. Therefore, to reduce the transmission delay, data transmission, storage and computation need to be performed locally. However, due to the limited resources of individual nodes in the local power wireless communication network, issues such as tight coupling between devices and resources and a lack of flexible allocation need to be addressed. The collaborative allocation of resources among multiple nodes in the local network is necessary to satisfy the multi-dimensional resource requirements of new power services. In response to the problems of limited node resources, inflexible resource allocation, and the high complexity of multi-dimensional resource allocation in local power wireless communication networks, this paper proposes a multi-objective joint optimization model for the collaborative allocation of communication, storage, and computing resources. This model utilizes the computational characteristics of communication resources to reduce the dimensionality of the objective function. Furthermore, a mouse swarm optimization algorithm based on multi-strategy improvements is proposed. The simulation results demonstrate that this method can effectively reduce the total system delay and improve the utilization of network resources. [ABSTRACT FROM AUTHOR]

Optimization algorithms have a wide range of applications in symmetry problems, such as graphs, networks, and pattern recognition. In this paper, a dynamic periodic multi-depot multi-trip vehicle routing model for scheduling test samples is constructed, which considers the differences in testing unit price and testing capacity of various agencies and introduces a cross-depot collaborative transport method. Both the cost and the testing time are minimized by determining the optimal sampling routes and testing agencies, subjecting to the constraints of vehicle capacity, number of vehicles, and delivery time. To solve the model, a knowledge-guided multi-objective shuffled frog leaping algorithm (KMOSFLA) is proposed. KMOSFLA adopts a convertible encoding mechanism to realize the diversified search in different search spaces. Three novel strategies are designed: the population initialization with historical information reuse, the leaping rule based on the greedy crossover and genetic recombination, and the objective-driven enhanced search. Systematic experimental studies are implemented. First, feasibility analyses of the model are carried out, where effectiveness of the cross-depot collaborative transport is validated and sensitivity analyses on two parameters (vehicle capacity and proportion of the third-party testing agencies) are performed. Then, the proposed algorithm KMOSFLA is compared with five state-of-the-art algorithms. Experimental results indicate that KMOSFLA can provide a set of non-dominated schedules with lower cost and shorter testing time in each scheduling period, which provides a reference for the dispatcher to make a final decision. [ABSTRACT FROM AUTHOR]

Community structure is a very interesting attribute and feature in complex networks, which has attracted scholars' attention and research on community detection. Many single-objective optimization algorithms have been migrated and modified to serve community detection problems. Due to the limitation of resolution, the final algorithm implementation effect is not ideal. In this paper, a multi-objective community detection method based on a pigeon-inspired optimization algorithm, MOPIO-Net, is proposed. Firstly, the PIO algorithm is discretized in terms of the solution space representation, position, and velocity-updating strategies to adapt to discrete community detection scenarios. Secondly, by minimizing the two objective functions of community score and community fitness at the same time, the community structure with a tight interior and sparse exterior is obtained. Finally, for the misclassification caused by boundary nodes, a mutation strategy is added to improve the accuracy of the final community recognition. Experiments on synthetic and real networks verify that the proposed algorithm is more accurate in community recognition compared to 11 benchmark algorithms, confirming the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Targeting the issues of slow speed and inadequate precision of optimal solution calculation for multi-user detection in complex noise environments, this paper proposes a multi-user detection algorithm based on a Hybrid Cheetah Optimizer (HCO). The algorithm first optimizes the control parameters and individual update mechanism of the Cheetah Optimizer (CO) algorithm using a nonlinear strategy to improve the uniformity and discretization of the individual search range, and then dynamically introduces a differential evolutionary algorithm into the improved selection mechanism of the CO algorithm, which is utilized to fine-tune the solution space and maintain the local diversity during the fast search process. Simulation results demonstrate that this detection algorithm not only realizes fast convergence with a very low bit error rate (BER) at eight iterations but also has obvious advantages in terms of noise immunity, resistance to far and near effects, communication capacity, etc., which greatly improves the speed and accuracy of optimal position solving for multi-user detection and can achieve the purpose of accurate solving in complex environments. [ABSTRACT FROM AUTHOR]

The Manta Ray Foraging Optimization Algorithm (MRFO) is a metaheuristic algorithm for solving real-world problems. However, MRFO suffers from slow convergence precision and is easily trapped in a local optimal. Hence, to overcome these deficiencies, this paper proposes an Improved MRFO algorithm (IMRFO) that employs Tent chaotic mapping, the bidirectional search strategy, and the Levy flight strategy. Among these strategies, Tent chaotic mapping distributes the manta ray more uniformly and improves the quality of the initial solution, while the bidirectional search strategy expands the search area. The Levy flight strategy strengthens the algorithm's ability to escape from local optimal. To verify IMRFO's performance, the algorithm is compared with 10 other algorithms on 23 benchmark functions, the CEC2017 and CEC2022 benchmark suites, and five engineering problems, with statistical analysis illustrating the superiority and significance of the difference between IMRFO and other algorithms. The results indicate that the IMRFO outperforms the competitor optimization algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes a new optimization algorithm for backpropagation (BP) neural networks by fusing integer-order differentiation and fractional-order differentiation, while fractional-order differentiation has significant advantages in describing complex phenomena with long-term memory effects and nonlocality, its application in neural networks is often limited by a lack of physical interpretability and inconsistencies with traditional models. To address these challenges, we propose a mixed integer-fractional (MIF) gradient descent algorithm for the training of neural networks. Furthermore, a detailed convergence analysis of the proposed algorithm is provided. Finally, numerical experiments illustrate that the new gradient descent algorithm not only speeds up the convergence of the BP neural networks but also increases their classification accuracy. [ABSTRACT FROM AUTHOR]

The traditional golden jackal optimization algorithm (GJO) has slow convergence speed, insufficient accuracy, and weakened optimization ability in the process of finding the optimal solution. At the same time, it is easy to fall into local extremes and other limitations. In this paper, a novel golden jackal optimization algorithm (SCMGJO) combining sine–cosine and Cauchy mutation is proposed. On one hand, tent mapping reverse learning is introduced in population initialization, and sine and cosine strategies are introduced in the update of prey positions, which enhances the global exploration ability of the algorithm. On the other hand, the introduction of Cauchy mutation for perturbation and update of the optimal solution effectively improves the algorithm's ability to obtain the optimal solution. Through the optimization experiment of 23 benchmark test functions, the results show that the SCMGJO algorithm performs well in convergence speed and accuracy. In addition, the stretching/compression spring design problem, three-bar truss design problem, and unmanned aerial vehicle path planning problem are introduced for verification. The experimental results prove that the SCMGJO algorithm has superior performance compared with other intelligent optimization algorithms and verify its application ability in engineering applications. [ABSTRACT FROM AUTHOR]

As a classical combinatorial optimization problem, the traveling salesman problem (TSP) has been extensively investigated in the fields of Artificial Intelligence and Operations Research. Due to being NP-complete, it is still rather challenging to solve both effectively and efficiently. Because of its high theoretical significance and wide practical applications, great effort has been undertaken to solve it from the point of view of intelligent search. In this paper, we propose a two-stage probe-based search optimization algorithm for solving both symmetric and asymmetric TSPs through the stages of route development and a self-escape mechanism. Specifically, in the first stage, a reasonable proportion threshold filter of potential basis probes or partial routes is set up at each step during the complete route development process. In this way, the poor basis probes with longer routes are filtered out automatically. Moreover, four local augmentation operators are further employed to improve these potential basis probes at each step. In the second stage, a self-escape mechanism or operation is further implemented on the obtained complete routes to prevent the probe-based search from being trapped in a locally optimal solution. The experimental results on a collection of benchmark TSP datasets demonstrate that our proposed algorithm is more effective than other state-of-the-art optimization algorithms. In fact, it achieves the best-known TSP benchmark solutions in many datasets, while, in certain cases, it even generates solutions that are better than the best-known TSP benchmark solutions. [ABSTRACT FROM AUTHOR]

Sub-Nyquist synthetic aperture radar (SAR) based on pseudo-random time–space modulation has been proposed to increase the swath width while preserving the azimuthal resolution. Due to the sub-Nyquist sampling, the scene can be recovered by an optimization-based algorithm. However, these methods suffer from some issues, e.g., manually tuning difficulty and the pre-definition of optimization parameters, and a low signal–noise ratio (SNR) resistance. To address these issues, a reweighted optimization algorithm, named pseudo-ℒ0-norm optimization algorithm, is proposed for the sub-Nyquist SAR system in this paper. A modified regularization model is first built by applying the scene prior information to nearly acquire the number of nonzero elements based on Bayesian estimation, and then this model is solved by the Cauchy–Newton method. Additionally, an error correction method combined with our proposed pseudo-ℒ0-norm optimization algorithm is also present to eliminate defocusing in the motion-induced model. Finally, experiments with simulated signals and strip-map TerraSAR-X images are carried out to demonstrate the effectiveness and superiority of our proposed algorithm. [ABSTRACT FROM AUTHOR]

In recent years, distributed optimization problem have a wide range of applications in various fields. This paper considers the prescribed-time distributed optimization problem with/without constraints. Firstly, we assume the state of each agent is constrained, and the prescribed-time distributed optimization algorithm with constraints is designed on the basis of gradient projection algorithm and consensus algorithm. Secondly, the constrained distributed optimization problem is transformed into the unconstrained distributed optimization problem, and according to the gradient descent algorithm and consensus algorithm, we also propose the prescribed-time distributed optimization algorithm without constraints. By designing the appropriate objective functions, we prove the multi-agent system can converge to the optimal solution within any prescribed-time, and the convergence time is fully independent of the initial conditions and system parameters. Finally, three simulation examples are provided to verify the validity of the designed algorithms. • For distributed optimization problem with convex constraints, we design an effective prescribed-time distributed algorithm which can guarantee the multi-agent system converge to the optimal solution. • The designed algorithm in this paper can achieve convergence within any prescribed-time, and the convergence time is fully independent of the initial conditions and system parameters. • In this paper, we not only consider the condition that the agents' states are constrained, but also ensure that the multi-agent system can reach the optimal solution within any prescribed-time, which is more practical. [ABSTRACT FROM AUTHOR]

Spam emails have become a pervasive issue in recent years, as internet users receive increasing amounts of unwanted or fake emails. To combat this issue, automatic spam detection methods have been proposed, which aim to classify emails into spam and non-spam categories. Machine learning techniques have been utilized for this task with considerable success. In this paper, we introduce a novel approach to spam email detection by presenting significant advancements to the Dandelion Optimizer (DO) algorithm. The DO is a relatively new nature-inspired optimization algorithm inspired by the flight of dandelion seeds. While the DO shows promise, it faces challenges, especially in high-dimensional problems such as feature selection for spam detection. Our primary contributions focus on enhancing the DO algorithm. Firstly, we introduce a new local search algorithm based on flipping (LSAF), designed to improve the DO's ability to find the best solutions. Secondly, we propose a reduction equation that streamlines the population size during algorithm execution, reducing computational complexity. To showcase the effectiveness of our modified DO algorithm, which we refer to as the Improved DO (IDO), we conduct a comprehensive evaluation using the Spam base dataset from the UCI repository. However, we emphasize that our primary objective is to advance the DO algorithm, with spam email detection serving as a case study application. Comparative analysis against several popular algorithms, including Particle Swarm Optimization (PSO), the Genetic Algorithm (GA), Generalized Normal Distribution Optimization (GNDO), the Chimp Optimization Algorithm (ChOA), the Grasshopper Optimization Algorithm (GOA), Ant Lion Optimizer (ALO), and the Dragonfly Algorithm (DA), demonstrates the superior performance of our proposed IDO algorithm. It excels in accuracy, fitness, and the number of selected features, among other metrics. Our results clearly indicate that the IDO overcomes the local optima problem commonly associated with the standard DO algorithm, owing to the incorporation of LSAF and the reduction in equation methods. In summary, our paper underscores the significant advancement made in the form of the IDO algorithm, which represents a promising approach for solving high-dimensional optimization problems, with a keen focus on practical applications in real-world systems. While we employ spam email detection as a case study, our primary contribution lies in the improved DO algorithm, which is efficient, accurate, and outperforms several state-of-the-art algorithms in various metrics. This work opens avenues for enhancing optimization techniques and their applications in machine learning. [ABSTRACT FROM AUTHOR]

The Ultra-Wideband (UWB) indoor positioning method is widely used in areas where no satellite signals are available. However, during the measurement process of UWB, the collected data contain random errors. To alleviate the effect of random errors on positioning accuracy, an improved adaptive sparrow search algorithm (IASSA) based on the sparrow search algorithm (SSA) is proposed in this paper by introducing three strategies, namely, the two-step weighted least squares algorithm, adaptive adjustment of search boundary, and producer–scrounger quantity adaptive adjustment. The simulation and field test results indicate that the IASSA algorithm achieves significantly higher localization accuracy than previous methods. Meanwhile, the IASSA algorithm requires fewer iterations, which overcomes the problem of the long computation time of the swarm intelligence optimization algorithm. Therefore, the IASSA algorithm has advantages in indoor positioning accuracy and robustness performance. [ABSTRACT FROM AUTHOR]

With the continued development of artificial intelligence technology, unmanned surface vehicles (USVs) have attracted the attention of countless domestic and international specialists and academics. In particular, path planning is a core technique for the autonomy and intelligence process of USVs. The current literature reviews on USV path planning focus on the latest global and local path optimization algorithms. Almost all algorithms are optimized by concerning metrics such as path length, smoothness, and convergence speed. However, they also simulate environmental conditions at sea and do not consider the effects of sea factors, such as wind, waves, and currents. Therefore, this paper reviews the current algorithms and latest research results of USV path planning in terms of global path planning, local path planning, hazard avoidance with an approximate response, and path planning under clustering. Then, by classifying USV path planning, the advantages and disadvantages of different research methods and the entry points for improving various algorithms are summarized. Among them, the papers which use kinematic and dynamical equations to consider the ship's trajectory motion planning for actual sea environments are reviewed. Faced with multiple moving obstacles, the literature related to multi-objective task assignment methods for path planning of USV swarms is reviewed. Therefore, the main contribution of this work is that it broadens the horizon of USV path planning and proposes future directions and research priorities for USV path planning based on existing technologies and trends. [ABSTRACT FROM AUTHOR]

High precision is a very important index in target tracking. In order to improve the prediction accuracy of target tracking, an optimized Kalman filter approach based on improved Gray Wolf algorithm (IGWO-OKF) is proposed in this paper. Since the convergence speed of traditional Gray Wolf algorithm is slow, meanwhile, the number of gray wolves and the choice of the maximum number of iterations has a great influence on the algorithm, a nonlinear control parameter combination adjustment strategy is proposed. An improved Grey Wolf Optimization algorithm (IGWO) is formed by determining the best combination of adjustment parameters through the fastest iteration speed of the algorithm. The improved Grey Wolf Optimization algorithm (IGWO) is formed, and the process noise covariance matrix and observation noise covariance matrix in Kalman filter are optimized by IGWO. The proposed approach is applied into. The experiment results show that the proposed IGWO-OKF approach has low error, high accuracy and good prediction effect. [ABSTRACT FROM AUTHOR]

Photocatalysts have made great contributions to the degradation of pollutants to achieve environmental purification. The traditional method of developing new photocatalysts is to design and perform a large number of experiments to continuously try to obtain efficient photocatalysts that can degrade pollutants, which is time-consuming, costly, and does not necessarily achieve the best performance of the photocatalyst. The rapid development of photocatalysis has been accelerated by the rapid development of artificial intelligence. Intelligent algorithms can be utilized to design photocatalysts and predict photocatalytic performance, resulting in a reduction in development time and the cost of new catalysts. In this paper, the intelligent algorithms for photocatalyst design and photocatalytic performance prediction are reviewed, especially the artificial neural network model and the model optimized by an intelligent algorithm. A detailed discussion is given on the advantages and disadvantages of the neural network model, as well as its application in photocatalysis optimized by intelligent algorithms. The use of intelligent algorithms in photocatalysis is challenging and long term due to the lack of suitable neural network models for predicting the photocatalytic performance of photocatalysts. The prediction of photocatalytic performance of photocatalysts can be aided by the combination of various intelligent optimization algorithms and neural network models, but it is only useful in the early stages. Intelligent algorithms can be used to design photocatalysts and predict their photocatalytic performance, which is a promising technology. [ABSTRACT FROM AUTHOR]

The sun serves as the primary energy source, providing our planet with the essential energy for sustaining life. To efficiently harness this energy, photovoltaic cells, commonly known as PV cells, are employed. These cells convert the solar energy they receive into electrical energy. The operational point of the solar cell, delivering maximum output power, is referred to as the maximum power point (MPP). However, as light availability and temperature fluctuate throughout the day, the MPP also varies accordingly. To maintain constant operation at the MPP, Maximum Power Point Tracking (MPPT) algorithms are employed to trace the MPP during module operation. These algorithms can be categorized into four groups: classical, intelligent, optimization, and hybrid, based on the tracking algorithm utilized. Each MPPT algorithm, existing in these categories, comes with its own set of advantages and limitations. This paper extensively reviews fifteen algorithms categorized under different groups. The review concludes with a comparative analysis of these algorithms, considering various parameters such as cost, complexity, tracking accuracy, and sensed parameters in a succinct manner. The paper focuses on elucidating the necessity of MPPT algorithms, their classification as per existing literature, and a comparative assessment of the studied MPPT algorithms. This comprehensive review aims to address advancements in this field, paving the way for further research. [ABSTRACT FROM AUTHOR]

Due to the shortage of wireless resources and the emergence of a large number of users, determining how to guarantee the quality-of-service (QoS) requirements of users and make more users work in the same spectrum has become an urgent research topic. In this paper, we study a multi-user MIMO (MU-MIMO) cellular network system model in which cellular users (CUs) share the same spectrum resource with multiple device-to-device (D2D) pairs. To maximize the number of admitted D2D pairs sharing the same spectrum with the CUs, a joint power allocation and channel gain (JPACG) algorithm is proposed. The optimization problem is divided into two steps to be solved. First, the power allocation of CUs without D2D pairs admitted is solved. Then, the optimization problem is transformed into minimizing the interference to CUs when CUs are treated as primary users. The admittance order of D2D pairs is determined by the transmission power and channel gain. The proposed algorithm uses a convex optimization algorithm to solve the problem of power allocation joint interference channel gain in order to maximize the number of admitted D2D pairs under the constraints of the signal-to-interference-plus-noise ratio (SINR) threshold and maximum transmission power. In addition, the effect of the number of admitted D2D pairs on the total sum rate of all users is also analyzed. The simulation results show that the proposed JPACG algorithm can achieve better performance in admitting D2D pairs. [ABSTRACT FROM AUTHOR]

We propose an adaptive fractional multi-scale optimization optical flow algorithm, which for the first time improves the over-smoothing of optical flow estimation under the total variation model from the perspective of global feature and local texture balance, and solves the problem that the convergence of fractional optical flow algorithms depends on the order parameter. Specifically, a fractional-order discrete L1-regularization Total Variational Optical Flow model is constructed. On this basis, the Ant Lion algorithm is innovatively used to realize the iterative calculation of the optical flow equation, and the fractional order is dynamically adjusted to obtain an adaptive optimization algorithm with strong search accuracy and high efficiency. In this paper, the flexibility of optical flow estimation in weak gradient texture scenes is increased, and the optical flow extraction rate of target features at multiple scales is greatly improved. We show excellent recognition performance and stability under the MPI_Sintel and Middlebury benchmarks. [ABSTRACT FROM AUTHOR]

The objective of task allocation in unmanned systems is to complete tasks at minimal costs. However, the current algorithms employed for coordinating multiple unmanned systems in task allocation tasks frequently converge to local optima, thus impeding the identification of the best solutions. To address these challenges, this study builds upon the sheep flock optimization algorithm (SFOA) by preserving individuals eliminated during the iterative process within a prior knowledge set, which is continuously updated. During the reproduction phase of the algorithm, this prior knowledge is utilized to guide the generation of new individuals, preventing their rapid reconvergence to local optima. This approach aids in reducing the frequency at which the algorithm converges to local optima, continually steering the algorithm towards the global optimum and thereby enhancing the efficiency of task allocation. Finally, various task scenarios are presented to evaluate the performances of various algorithms. The results show that the algorithm proposed in this paper is more likely than other algorithms to escape from local optima and find the global optimum. [ABSTRACT FROM AUTHOR]

In numerous scientific disciplines and practical applications, addressing optimization challenges is a common imperative. Nature-inspired optimization algorithms represent a highly valuable and pragmatic approach to tackling these complexities. This paper introduces Dendritic Growth Optimization (DGO), a novel algorithm inspired by natural branching patterns. DGO offers a novel solution for intricate optimization problems and demonstrates its efficiency in exploring diverse solution spaces. The algorithm has been extensively tested with a suite of machine learning algorithms, deep learning algorithms, and metaheuristic algorithms, and the results, both before and after optimization, unequivocally support the proposed algorithm's feasibility, effectiveness, and generalizability. Through empirical validation using established datasets like diabetes and breast cancer, the algorithm consistently enhances model performance across various domains. Beyond its working and experimental analysis, DGO's wide-ranging applications in machine learning, logistics, and engineering for solving real-world problems have been highlighted. The study also considers the challenges and practical implications of implementing DGO in multiple scenarios. As optimization remains crucial in research and industry, DGO emerges as a promising avenue for innovation and problem solving. [ABSTRACT FROM AUTHOR]

Compared to terrestrial transportation systems, the expansion of urban traffic into airspace can not only mitigate traffic congestion, but also foster establish eco-friendly transportation networks. Additionally, unmanned aerial vehicle (UAV) task allocation and trajectory planning are essential research topics for an Urban Air Mobility (UAM) scenario. However, heterogeneous tasks, temporary flight restriction zones, physical buildings, and environment prerequisites put forward challenges for the research. In this paper, multigene and improved anti-collision RRT* (IAC-RRT*) algorithms are proposed to address the challenge of task allocation and path planning problems in UAM scenarios by tailoring the chance of crossover and mutation. It is proved that multigene and IAC-RRT* algorithms can effectively minimize energy consumption and tasks' completion duration of UAVs. Simulation results demonstrate that the strategy of this work surpasses traditional optimization algorithms, i.e., RRT algorithm and gene algorithm, in terms of numerical stability and convergence speed. [ABSTRACT FROM AUTHOR]

Today, the IoT has become a vital part of our lives because it has entered into the precise details of human life, like smart homes, healthcare, eldercare, vehicles, augmented reality, and industrial robotics. Cloud computing and fog computing give us services to process IoT tasks, and we are seeing a growth in the number of IoT devices every day. This massive increase needs huge amounts of resources to process it, and these vast resources need a lot of power to work because the fog and cloud are based on the term pay-per-use. We make to improve the performance and cost (PC) algorithm to give priority to the high-profit cost and to reduce energy consumption and Makespan; in this paper, we propose the performance and cost–gray wolf optimization (PC-GWO) algorithm, which is the combination of the PCA and GWO algorithms. The results of the trial reveal that the PC-GWO algorithm reduces the average overall energy usage by 12.17%, 11.57%, and 7.19%, and reduces the Makespan by 16.72%, 16.38%, and 14.107%, with the best average resource utilization enhanced by 13.2%, 12.05%, and 10.9% compared with the gray wolf optimization (GWO) algorithm, performance and cost algorithm (PCA), and Particle Swarm Optimization (PSO) algorithm. [ABSTRACT FROM AUTHOR]