Search

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]

Economic Dispatch Problems (EDP) refer to the process of determining the power output of generation units such that the electricity demand of the system is satisfied at a minimum cost while technical and operational constraints of the system are satisfied. This procedure is vital in the efficient energy management of electricity networks since it can ensure the reliable and efficient operation of power systems. As power systems transition from conventional to modern ones, new components and constraints are introduced to power systems, making the EDP increasingly complex. This highlights the importance of developing advanced optimization techniques that can efficiently handle these new complexities to ensure optimal operation and cost-effectiveness of power systems. This review paper provides a comprehensive exploration of the EDP, encompassing its mathematical formulation and the examination of commonly used problem formulation techniques, including single and multi-objective optimization methods. It also explores the progression of paradigms in economic dispatch, tracing the journey from traditional methods to contemporary strategies in power system management. The paper categorizes the commonly utilized techniques for solving EDP into four groups: conventional mathematical approaches, uncertainty modelling methods, artificial intelligence-driven techniques, and hybrid algorithms. It identifies critical research gaps, a predominant focus on single-case studies that limit the generalizability of findings, and the challenge of comparing research due to arbitrary system choices and formulation variations. The present paper calls for the implementation of standardized evaluation criteria and the inclusion of a diverse range of case studies to enhance the practicality of optimization techniques in the field. [ABSTRACT FROM AUTHOR]

This paper presents an optimized quantum circuit for the s c r y p t cryptographic algorithm. We applied various optimization techniques to reduce the DW cost, which is the product of the time and space complexity of quantum circuits. In our proposed method, the number of ancilla qubits was significantly reduced through the use of optimized inverse operations, while the depth was minimized by implementing parallel structures. For the SHA-256, we devised a structure that achieves a substantial reduction in the number of ancilla qubits with only a slight increase in quantum circuit depth. By cleaning the dirty ancilla qubits used in the previous round through inverse operations, we enabled their reuse in each subsequent round. Specifically, we reduced the number of 8128 ancilla qubits, achieving this with an increase of only 6 in the full depth of the quantum circuit. Additionally, within Salsa20/8 in SMix, we reused qubits through inverse operations and performed some operations in parallel to reduce both the number of qubits and the overall quantum circuit depth. Finally, our quantum circuit for s c r y p t demonstrates a significant reduction in the width (the number of qubits) with only a minimal increase in the full quantum circuit depth. [ABSTRACT FROM AUTHOR]

This paper proposes a parameter coordination optimization design of a power system stabilizer (PSS) based on an improved quasi-affine transformation evolutionary (QUATRE) algorithm to suppress low-frequency oscillation and improve the dynamic stability of power systems. To begin, the simulated annealing (SA) algorithm randomly updates the globally optimal solution of each QUATRE iteration and matches the inferior solution with a certain probability to escape the local extreme point. This new algorithm is first applied to the power system. Since the damping ratio is one of the criteria with which to measure the dynamic stability of the power system, this paper sets the objective function according to the principle of maximization of the damping coefficient of the electromechanical mode, and uses SA-QUATRE to search a group of global optimal PSS parameter combinations to improve the safety factor of the system as much as possible. Finally, the method's rationality and validity were validated by applying it to the simulation examples of the IEEE 4-machine 2-area system with different operation states. The comparison with the traditional optimization algorithm shows that the proposed method has more advantages for multi-machine PSS parameter coordination optimization, can restrain the low-frequency oscillation of the power system more effectively and can enhance the system's stability. [ABSTRACT FROM AUTHOR]

With the increasingly widespread application of UAV intelligence, the need for autonomous navigation and positioning is becoming more and more important. To solve the problem that UAV cannot perform localization in complex scenes, a new multi-source fusion framework factor graph optimization algorithm is used for UAV localization state estimation in this paper, which is based on IMU/GNSS/VO multi-source sensors. Based on the factor graph model and the iSAM incremental inference algorithm, a multi-source fusion model of IMU/GNSS/VO is established, including the IMU pre-integration factor, IMU bias factor, GNSS factor, and VO factor. Mathematical simulations and validations on the EuRoC dataset show that, when the selected sliding window size is 30, the factor graph optimization (FGO) algorithm can not only meet the requirements of real time and accuracy at the same time, but it also achieves a plug-and-play function in the event of local sensor failures. Finally, compared with the traditional federated Kalman algorithm and the adaptive federated Kalman algorithm, the positioning accuracy of the FGO algorithm in this paper is improved by 1.5–2-fold, and can effectively improve autonomous navigation system robustness and flexibility in complex scenarios. Moreover, the multi-source fusion framework in this paper is a general algorithm framework that can satisfy other scenarios and other types of sensor combinations. [ABSTRACT FROM AUTHOR]

The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc.) is reduced to the problem of discrete optimization in the following mathematical method. We were provided a network and graphs in its leaves, for which we needed to find a rearrangement of graphs by non-leaf nodes, in which the given functional reached its minimum. Such a problem, even in the simplest case, is NP-hard, which means unavoidable restrictions on the network, on graphs, or on the functional. In this publication, this problem is addressed in the case of all graphs being so-called "structures", meaning directed-loaded graphs consisting of paths and cycles, and the functional as the sum (over all edges in the network) of distances between structures at the endpoints of every edge. The distance itself is equal to the minimal length of sequence from the fixed list of operations, the composition of which transforms the structure at one endpoint of the edge into the structure at its other endpoint. The list of operations (and their costs) on such a graph is fixed. Under these conditions, the given discrete optimization problem is called the reconstruction problem. This paper presents novel algorithms for solving the reconstruction problem, along with full proofs of their low error and low polynomial complexity. For example, for the network, the problem is solved with a zero error algorithm that has a linear polynomial computational complexity; and for the tree the problem is solved using an algorithm with a multiplicative error of at most two, which has a second order polynomial computational complexity. [ABSTRACT FROM AUTHOR]

With the gradual emergence of customized manufacturing, intelligent manufacturing systems have experienced widespread adoption, leading to a surge in research interests in the associated problem of intelligent scheduling. In this paper, we study the flexible job shop scheduling problem (FJSP) with setup time, handling time, and processing time in a multi-equipment work center production environment oriented toward smart manufacturing and make-to-order requirements. A mathematical model with the optimization objectives of minimizing the maximum completion time, the total number of machine adjustments, the total number of workpieces handled and the total load of the machine is constructed, and an improved discrete particle swarm algorithm based on Pareto optimization and a nonlinear adaptive inertia weighting strategy is proposed to solve the model. By integrating the model characteristics and algorithm features, a hybrid initialization method is designed to generate a higher-quality initialized population. Next, three cross-variance operators are used to implement particle position updates to maintain information sharing among particles. Then, the performance effectiveness of this algorithm is verified by testing and analyzing 15 FJSP test instances. Finally, the feasibility and effectiveness of the designed algorithm for solving multi-objective FJSPs are verified by designing an FJSP test example that includes processing time, setup time and handling time. [ABSTRACT FROM AUTHOR]

The efficiency and the effectiveness of a machine learning (ML) model are greatly influenced by feature selection (FS), a crucial preprocessing step in machine learning that seeks out the ideal set of characteristics with the maximum accuracy possible. Due to their dominance over traditional optimization techniques, researchers are concentrating on a variety of metaheuristic (or evolutionary) algorithms and trying to suggest cutting-edge hybrid techniques to handle FS issues. The use of hybrid metaheuristic approaches for FS has thus been the subject of numerous research works. The purpose of this paper is to critically assess the existing hybrid FS approaches and to give a thorough literature review on the hybridization of different metaheuristic/evolutionary strategies that have been employed for supporting FS. This article reviews pertinent documents on hybrid frameworks that were published in the period from 2009 to 2022 and offers a thorough analysis of the used techniques, classifiers, datasets, applications, assessment metrics, and schemes of hybridization. Additionally, new open research issues and challenges are identified to pinpoint the areas that have to be further explored for additional study. [ABSTRACT FROM AUTHOR]

Clean and renewable energy is the only way to achieve sustainable energy development, with considerable social and economic benefits. As a key technology for clean and renewable energy, it is very important to research the reliability optimization of microgrids. This paper reviews the research progress in microgrid reliability optimization. This paper first classifies and summarizes the existing research on microgrid control strategies and reliability assessment. Then, the system reliability optimization framework is summarized in terms of both microgrid systems and optimization objectives. Next, we summarize the most commonly used optimization algorithms for microgrid reliability for different microgrid systems. Finally, we provide a bibliometric analysis of the literature on the reliability research of microgrids. In addition, we propose some research challenges in the future for the reliability of microgrids. [ABSTRACT FROM AUTHOR]

In this paper, a heuristic approach to doubly fed induction generator (DFIG) protection and low voltage ride through (LVRT) is carried out. DFIG-based wind systems are rapidly penetrating the power generation section. Despite their advantages, their direct coupling grid makes them highly sensitive to symmetrical faults. A well-known solution to this is the crowbar method of DFIG protection. This paper provides a method to determine the optimal crowbar resistance value, to ensure a strong trade-off between the rotor current and DC voltage transients. Further, since the crowbar method requires disconnection from the grid, the linear quadratic regulator (LQR) is applied to the system. This is to ensure fault ride through compliance with recent grid code requirements. The well-known PSO, as well as the recently developed African vultures optimization algorithm (AVOA), was applied to the problem. The first set of results show that for severe symmetrical voltage dips, the AVOA provides a good option for crowbar magnitude optimization, whereas PSO performed better for moderately severe dips. Secondly, when the LQR was optimized via the AVOA, it exhibited superiority over the conventional PSO-based PI controller. This superiority was in terms of rotor current transient magnitude, DC voltage transient magnitude, and reactive power steady-state ripple and were in the order of 67.5%, 20.35%, and 37.55%, respectively. When comparing the crowbar method and the LQR, it was observed that despite the LQR exhibiting superiority in terms of transient performance, the crowbar method offered a unanimously superior settling time. [ABSTRACT FROM AUTHOR]

Unconstrained continuous large-scale global optimization (LSGO) is still a challenging task for a wide range of modern metaheuristic approaches. A cooperative coevolution approach is a good tool for increasing the performance of an evolutionary algorithm in solving high-dimensional optimization problems. However, the performance of cooperative coevolution approaches for LSGO depends significantly on the problem decomposition, namely, on the number of subcomponents and on how variables are grouped in these subcomponents. Also, the choice of the population size is still an open question for population-based algorithms. This paper discusses a method for selecting the number of subcomponents and the population size during the optimization process ("on fly") from a predefined pool of parameters. The selection of the parameters is based on their performance in the previous optimization steps. The main goal of the study is the improvement of coevolutionary decomposition-based algorithms for solving LSGO problems. In this paper, we propose a novel self-adapt evolutionary algorithm for solving continuous LSGO problems. We have tested this algorithm on 15 optimization problems from the IEEE LSGO CEC'2013 benchmark suite. The proposed approach, on average, outperforms cooperative coevolution algorithms with a static number of subcomponents and a static number of individuals. [ABSTRACT FROM AUTHOR]

Featured Application: This article belongs to the Section Computing and Artificial Intelligence. Ineffective protein feature representation poses problems in protein classification in hierarchical structures. Discrete wavelet transform (DWT) is a feature representation method which generates global and local features based on different wavelet families and decomposition levels. To represent protein sequences, the proper wavelet family and decomposition level must be selected. This paper proposed a hybrid optimization method using particle swarm optimization and the firefly algorithm (FAPSO) to choose the suitable wavelet family and decomposition level of wavelet transformation for protein feature representation. The suggested approach improved on the work of earlier researchers who, in most cases, manually selected the wavelet family and level of decomposition based solely on experience and not on data. The paper also applied the virtual class methods to overcome the error propagation problems in hierarchical classification. The effectiveness of the proposed method was tested on a G-Protein Coupled Receptor (GPCR) protein data set consisting of 5 classes at the family level, 38 classes at the subfamily level, and 87 classes at the sub-subfamily level. Based on the result obtained, the most selected wavelet family and decomposition level chosen to represent GPCR classes by FAPSO are Biorthogonal wavelets and decomposition level 1, respectively. The experimental results show that the representation of GPCR protein using the FAPSO algorithm with virtual classes can yield 97.9%, 86.9%, and 81.3% classification accuracy at the family, subfamily, and sub-subfamily levels, respectively. In conclusion, the result shows that the selection of optimized wavelet family and decomposition level by the FAPSO algorithm, and the virtual class method can be potentially used as the feature representation method and a hierarchical classification method for GPCR protein. [ABSTRACT FROM AUTHOR]

In view of the slow convergence speed of traditional particle swarm optimization algorithms, which makes it easy to fall into local optimum, this paper proposes an OTSU multi-threshold image segmentation based on an improved particle swarm optimization algorithm. After the particle swarm completes the iterative update speed and position, the method of calculating particle contribution degree is used to obtain the approximate position and direction, which reduces the scope of particle search. At the same time, the asynchronous monotone increasing social learning factor and the asynchronous monotone decreasing individual learning factor are used to balance global and local search. Finally, chaos optimization is introduced to increase the diversity of the population to achieve OTSU multi-threshold image segmentation based on improved particle swarm optimization (IPSO). Twelve benchmark functions are selected to test the performance of the algorithm and are compared with the traditional meta-heuristic algorithm. The results show the robustness and superiority of the algorithm. The standard dataset images are used for multi-threshold image segmentation experiments, and some traditional meta-heuristic algorithms are selected to compare the calculation efficiency, peak signal to noise ratio (PSNR), structural similarity (SSIM), feature similarity (FSIM), and fitness value (FITNESS). The results show that the running time of this paper is 30% faster than other algorithms in general, and the accuracy is also better than other algorithms. Experiments show that the proposed algorithm can achieve higher segmentation accuracy and efficiency. [ABSTRACT FROM AUTHOR]

Aiming at the relative pose estimation of non-cooperative targets in space traffic management tasks, a two-step pose estimation method, based on spatially intersecting straight lines, is proposed, which mainly includes three aspects: (1) Use binocular vision to reconstruct the straight space line, and based on the direction vector of the straight line and the intersection of the straight line, solve the pose of the measured target in the measurement coordinate system, and obtain the initial value of the pose estimation. (2) Analyze the uncertainty of the spatial straight-line imaging, construct the uncertainty description matrix of the line, and filter the line features, accordingly. (3) Analyze the problems existing in the current linear distance measurement, construct the spatial linear back-projection error in the parametric coordinate space, and use the linear imaging uncertainty to weigh the projection error term to establish the optimization objective function of the pose estimation. Finally, the nonlinear optimization algorithm is used to iteratively solve the above optimization problem, to obtain high-precision pose estimation results. The experimental results show that the two-step pose estimation algorithm, proposed in this paper, can effectively achieve a high-precision and robust pose estimation for non-cooperative spatial targets. When the measurement distance is 10 m, the position accuracy can reach 10 mm, and the attitude measurement accuracy can reach 1°, which meets the pose estimation accuracy requirements of space traffic management. [ABSTRACT FROM AUTHOR]

This article considers a box-constrained global optimization problem for Lipschitz continuous functions with an unknown Lipschitz constant. The well-known derivative-free global search algorithm DIRECT (DIvide RECTangle) is a promising approach for such problems. Several studies have shown that recent two-step (global and local) Pareto selection-based algorithms are very efficient among all DIRECT-type approaches. However, despite its encouraging performance, it was also observed that the candidate selection procedure has two possible shortcomings. First, there is no limit on how small the size of selected candidates can be. Secondly, a balancing strategy between global and local candidate selection is missing. Therefore, it may waste function evaluations by over-exploring the current local minimum and delaying finding the global one. This paper reviews and employs different strategies in a two-step Pareto selection framework (1-DTC-GL) to overcome these limitations. A detailed experimental study has revealed that existing strategies do not always improve and sometimes even worsen results. Since 1-DTC-GL is a DIRECT-type algorithm, the results of this paper provide general guidance for all DIRECT-type algorithms on how to deal with excessive local refinement more efficiently. [ABSTRACT FROM AUTHOR]

Accurate and effective wind power prediction plays an important role in wind power generation, distribution, and management. Inthis paper, a hybrid algorithm based on gradient descent and meta-heuristic optimization is designed to improve the accuracy of prediction and reduce the computational burden. The hybrid algorithm includes three steps: in the first step, we use the gradient descent algorithm to get the initial parameters. Secondly, we input the initial parameters into the meta-heuristic optimization algorithm to search for the "best parameters" (high-quality inferior solutions). Finally, we input optimized parameters into the RMSProp optimization algorithm and conduct gradient descent again to find a better solution. We used 2021 wind power data from Guangxi, China for the experiment. The results show that the hybrid prediction algorithm has better performance than the traditional Back Propagation (BP) in accuracy, stability, and efficiency. [ABSTRACT FROM AUTHOR]

Golden jackal optimization (GJO) is an effective metaheuristic algorithm that imitates the cooperative hunting behavior of the golden jackal. However, since the update of the prey's position often depends on the male golden jackal and there is insufficient diversity of golden jackals in some cases, it is prone to falling into a local optimal optimum. In order to address these drawbacks of GJO, this paper proposes an improved algorithm, called a hybrid GJO and golden sine (S) algorithm (Gold-SA) with dynamic lens-imaging (L) learning (LSGJO). First, this paper proposes novel dual golden spiral update rules inspired by Gold-SA. These rules give GJO the ability to think like a human (Gold-SA), making the golden jackal more intelligent in the process of preying, and improving the ability and efficiency of optimization. Second, a novel nonlinear dynamic decreasing scaling factor is introduced into the lens-imaging learning operator to maintain the population diversity. The performance of LSGJO is verified through 23 classical benchmark functions and 3 complex design problems in real scenarios. The experimental results show that LSGJO converges faster and more accurately than 11 state-of-the-art optimization algorithms, the global and local search ability has improved significantly, and the proposed algorithm has shown superior performance in solving constrained problems. [ABSTRACT FROM AUTHOR]

In this paper, a new Modified Meta-Heuristic algorithm is proposed. This method contains some modifications to improve the performance of the simulated-annealing algorithm (SA). Most authors who deal with improving the SA algorithm presented some improvements and modifications to one or more of the five standard features of the SA algorithm. In this paper, we improve the SA algorithm by presenting some suggestions and modifications to all five standard features of the SA algorithm. Through these suggestions and modifications, we obtained a new algorithm that finds the approximate solution to the global minimum of a non-convex function. The new algorithm contains novel parameters, which are updated at each iteration. Therefore, the variety and alternatives in choosing these parameters demonstrated a noticeable impact on the performance of the proposed algorithm. Furthermore, it has multiple formulas by which the candidate solutions are generated. Diversity in these formulas helped the proposed algorithm to escape a local point while finding the global minimizer of a non-convex function. The efficiency of the proposed algorithm is reported through extensive numerical experiments on some well-known test problems. The performance profiles are used to evaluate and compare the performance of our proposed algorithm against the other five meta-heuristic algorithms. The comparison results between the performance of our suggested algorithm and the other five algorithms indicate that the proposed algorithm is competitive with, and in all cases superior to, the five algorithms in terms of the efficiency, reliability, and effectiveness for finding the global minimizers of non-convex functions. This superiority of the new proposed algorithm is due to those five modified standard features. [ABSTRACT FROM AUTHOR]

Automatic parking path optimization is a key point for automatic parking. However, it is difficult to obtain the smooth, accurate and optimal parking path by using traditional automatic parking optimization algorithms. So, based on the automatic parking path optimization model for cubic spline interpolation, an improved automatic parking path optimization based on the immune moth flame algorithm is proposed for intelligent vehicles. Firstly, to enhance the global optimization performance, an automatic parking path optimization model for cubic spline interpolation is designed by using shortest parking path as optimization target. Secondly, an improved immune moth flame algorithm (IIMFO) based on the immune mechanism, Gaussian mutation mechanism and opposition-based learning strategy is proposed, and an adaptive decreasing inertia weight coefficient is integrated into the moth flame algorithm so that these strategies can improve the balance quality between global search and local development effectively. Finally, the optimization results on the several common test functions show that the IIMFO algorithm proposed in this paper has higher optimization precision. Furthermore, the simulation and semi-automatic experiment results of automatic parking path optimization practical cases show that the improved automatic parking path optimization based on the immune moth flame algorithm for intelligent vehicles has a better optimization effect than that of the traditional automatic parking optimization algorithms. [ABSTRACT FROM AUTHOR]

The pursuit of achieving total power network observability in smart grids using Phasor Measurement Units (PMUs) carries a significant promise of real-time Wide-Area Monitoring, Protection, and Control (WAMPAC). PMU applications eliminate periodical measurements, thereby increasing accuracy through a high sampling rate of the measured power systems quantities. The high costs of installation of PMUs for total power system observability presents a challenge in the implementation of PMUs. This is due to the expensive costs of PMU devices. This has led to a prominent optimal PMU placement (OPP) problem that researchers tirelessly aim to solve by ensuring a complete power network observability while using the least installed PMU devices possible. In this paper, a novel Binary Firefly Algorithm (BFA) based on the node degree centrality scores of each bus is proposed to minimize PMU installations. The BFA solves the OPP problem in consideration of the effect of Zero Injection Buses (ZIBs) under normal operation and single PMU outage (SPO). The robustness and efficiency of the proposed algorithm is tested on IEEE-approved test systems and visualized with a force-directed technique on an undirected power network graph. The proposed BFA yields the same but better optimal PMU numbers, obtained by existing meta-heuristic optimization techniques found in the literature for each of the IEEE test cases, as well as highlighting the cost–benefit of having a robust system against single PMU loss while considering the ZIB effect for an improved system measurement availability. [ABSTRACT FROM AUTHOR]

The optimization of industrial processes is a critical task for leveraging profitability and sustainability. To ensure the selection of optimum process parameter levels in any industrial process, numerous metaheuristic algorithms have been proposed so far. However, many algorithms are either computationally too expensive or become trapped in the pit of local optima. To counter these challenges, in this paper, a hybrid metaheuristic called PSO-GSA is employed that works by combining the iterative improvement capability of particle swarm optimization (PSO) and gravitational search algorithm (GSA). A binary PSO is also fused with GSA to develop a BPSO-GSA algorithm. Both the hybrid algorithms i.e., PSO-GSA and BPSO-GSA, are compared against traditional algorithms, such as tabu search (TS), genetic algorithm (GA), differential evolution (DE), GSA and PSO algorithms. Moreover, another popular hybrid algorithm DE-GA is also used for comparison. Since earlier works have already studied the performance of these algorithms on mathematical benchmark functions, in this paper, two real-world-applicable independent case studies on biodiesel production are considered. Based on the extensive comparisons, significantly better solutions are observed in the PSO-GSA algorithm as compared to the traditional algorithms. The outcomes of this work will be beneficial to similar studies that rely on polynomial models. [ABSTRACT FROM AUTHOR]

There are many pre-trained deep learning-based face recognition models developed in the literature, such as FaceNet, ArcFace, VGG-Face, and DeepFace. However, performing transfer learning of these models for handling face sketch recognition is not applicable due to the challenge of limited sketch datasets (single sketch per subject). One promising solution to mitigate this issue is by using optimization algorithms, which will perform a fine-tuning and fitting of these models for the face sketch problem. Specifically, this research introduces an enhanced optimizer that will evolve these models by performing automatic weightage/fine-tuning of the generated feature vector guided by the recognition accuracy of the training data. The following are the key contributions to this work: (i) this paper introduces a novel Smart Switching Slime Mold Algorithm (S2SMA), which has been improved by embedding several search operations and control rules; (ii) the proposed S2SMA aims to fine-tune the pre-trained deep learning models in order to improve the accuracy of the face sketch recognition problem; and (iii) the proposed S2SMA makes simultaneous fine-tuning of multiple pre-trained deep learning models toward further improving the recognition accuracy of the face sketch problem. The performance of the S2SMA has been evaluated on two face sketch databases, which are XM2VTS and CUFSF, and on CEC's 2010 large-scale benchmark. In addition, the outcomes were compared to several variations of the SMA and related optimization techniques. The numerical results demonstrated that the improved optimizer obtained a higher level of fitness value as well as better face sketch recognition accuracy. The statistical data demonstrate that S2SMA significantly outperforms other optimization techniques with a rapid convergence curve. [ABSTRACT FROM AUTHOR]

Nowadays, people choose to travel in their leisure time more frequently, but fixed predetermined tour routes can barely meet people's personalized preferences. The needs of tourists are diverse, largely personal, and possibly have multiple constraints. The traditional single-objective route planning algorithm struggles to effectively deal with such problems. In this paper, a novel multi-objective and multi-constraint tour route recommendation method is proposed. Firstly, ArcMap was used to model the actual road network. Then, we created a new interest label matching method and a utility function scoring method based on crowd sensing, and constructed a personalized multi-constraint interest model. We present a variable neighborhood search algorithm and a hybrid particle swarm genetic optimization algorithm for recommending Top-K routes. Finally, we conducted extensive experiments on public datasets. Compared with the ATP route recommendation method based on an improved ant colony algorithm, our proposed method is superior in route score, interest abundance, number of POIs, and running time. [ABSTRACT FROM AUTHOR]

Dynamic weapon target assignment (DWTA) is an effective method to solve the multi-stage battlefield fire optimization problem, which can reflect the actual combat scenario better than static weapon target assignment (SWTA). In this paper, a meaningful and effective DWTA model is established, which contains two practical and conflicting objectives, namely, maximizing combat benefits and minimizing weapon costs. Moreover, the model contains limited resource constraints, feasibility constraints and fire transfer constraints. The existence of multi-objective and multi-constraint makes DWTA more complicated. To solve this problem, an improved multiobjective particle swarm optimization algorithm (IMOPSO) is proposed in this paper. Various learning strategies are adopted for the dominated and non-dominated solutions of the algorithm, so that the algorithm can learn and evolve in a targeted manner. In order to solve the problem that the algorithm is easy to fall into local optimum, this paper proposes a search strategy based on simulated binary crossover (SBX) and polynomial mutation (PM), which enables elitist information to be shared among external archive and enhances the exploratory capabilities of IMOPSO. In addition, a dynamic archive maintenance strategy is applied to improve the diversity of non-dominated solutions. Finally, this algorithm is compared with three state-of-the-art multiobjective optimization algorithms, including solving benchmark functions and DWTA model in this article. Experimental results show that IMOPSO has better convergence and distribution than the other three multiobjective optimization algorithms. IMOPSO has obvious advantages in solving multiobjective DWTA problems. [ABSTRACT FROM AUTHOR]

In the robotic engineering field, the main target, especially in industry, manufacturing, and surgical operations, is reaching the optimal performance of manipulators. The purpose of this paper is to quantify the contour tracking performance of collaborative universal manipulator robot (UR5) by setting the gain of position domain controller. In order to improve and enhance the track of manipulator in experimental applications we utilize differential evolution (DE) optimization, using MATLAB toolbox with an applied robot operating system (ROS). The adopted current approach does not only optimize the gain of position domain controller but also prevent collisions by detecting a "border crossing" without turning off the manipulator and allowing the automation agent to be on the scene, coexisting in harmonic mode and avoiding collisions. This requires the implementation of an algorithm that detects an obstacle to avoid anticipated collisions. For this purpose, the adopted algorithm uses the DE algorithm to modify the artificial potential field (APF). The results of this paper present that on one hand, meta-heuristic optimization algorithm features give the best performance indices for linear and non-linear contours, and on the other hand, DE algorithm features give good modification to APF to generate collision free contour path planning. [ABSTRACT FROM AUTHOR]

The O2 A-band night glow can be used to retrieve the temperature in the range of 80–120 km in the mesosphere and lower thermosphere (MLT). From the full spectrum of A-band night glow, the band used to retrieve temperature is selected based on the sensitivity of the emission line on temperature, taking into account the compromise relationship between the spectral band and resolution, inversion efficiency, and inversion accuracy. The non-linear iterative inversion method based on optimization theory is adopted for the retrieval of temperature. Meanwhile, considering the stability of inversion, Tikhonov regularization matrix is added as a constraint, and the optimal estimation inversion algorithm is optimized to suppress the influence of measurement noise on results. Through the recovering simulated noisy spectra from an interferometer, the temperature profile with vertical resolution better than 2 km and an average accuracy better than 2 K is obtained by the optimized inversion method in this paper. In addition, the influence of a priori constraints on the inversion accuracy is studied, and a priori accuracy limits the inversion accuracy. When a priori accuracy is controlled within ±5 K, the average temperature inversion accuracy can be optimized to 1.35 K, which is better than the accuracy of OSIRIS on Odin at 90–105 km. [ABSTRACT FROM AUTHOR]

Stochastic configuration network (SCN) is a mathematical model of incremental generation under a supervision mechanism, which has universal approximation property and advantages in data modeling. However, the efficiency of SCN is affected by some network parameters. An optimized searching algorithm for the input weights and biases is proposed in this paper. An optimization model with constraints is first established based on the convergence theory and inequality supervision mechanism of SCN; Then, a hybrid bat-particle swarm optimization algorithm (G-BAPSO) based on gradient information is proposed under the framework of PSO algorithm, which mainly uses gradient information and local adaptive adjustment mechanism characterized by pulse emission frequency to improve the searching ability. The algorithm optimizes the input weights and biases to improve the convergence rate of the network. Simulation results over some datasets demonstrate the feasibility and validity of the proposed algorithm. The training RMSE of G-BAPSO-SCN increased by 5.57 × 10 − 5 and 3.2 × 10 − 3 compared with that of SCN in the two regression experiments, and the recognition accuracy of G-BAPSO-SCN increased by 0.07% on average in the classification experiments. [ABSTRACT FROM AUTHOR]

This paper studies the problem of distributed predefined-time optimization for leaderless consensus of second-order multi-agent systems under a class of weighted digraphs. The proposed framework has two main steps. In the first step, the agents communicate to perform a consensus-based distributed predefined-time optimization and to generate a constant optimal output reference for each agent. In the second step, each agent tracks its corresponding optimal output reference, using a sliding-mode controller to reach the global optimum in a predefined time, even under matched disturbances. The proposed algorithm relies explicitly on user-defined constant parameters. Numerical simulations are performed to validate the efficacy of the algorithm. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms are widely used in complex problems that cannot be solved by traditional computing methods due to their powerful optimization capabilities. However, for high-complexity problems, the fitness function evaluation may take hours or even days to complete. The surrogate-assisted meta-heuristic algorithm effectively solves this kind of long solution time for the fitness function. Therefore, this paper proposes an efficient surrogate-assisted hybrid meta-heuristic algorithm by combining the surrogate-assisted model with gannet optimization algorithm (GOA) and the differential evolution (DE) algorithm, abbreviated as SAGD. We explicitly propose a new add-point strategy based on information from historical surrogate models, using information from historical surrogate models to allow the selection of better candidates for the evaluation of true fitness values and the local radial basis function (RBF) surrogate to model the landscape of the objective function. The control strategy selects two efficient meta-heuristic algorithms to predict the training model samples and perform updates. A generation-based optimal restart strategy is also incorporated in SAGD to select suitable samples to restart the meta-heuristic algorithm. We tested the SAGD algorithm using seven commonly used benchmark functions and the wireless sensor network (WSN) coverage problem. The results show that the SAGD algorithm performs well in solving expensive optimization problems. [ABSTRACT FROM AUTHOR]

In this paper, the behavior and performance of Pure Random Orthogonal Search (PROS), a parameter-free evolutionary algorithm (EA) that outperforms many existing EAs on the well-known benchmark functions with finite-time budget, are analyzed. The sufficient conditions to converge to the global optimum are also determined. In addition, we propose two modifications to PROS, namely Triangular-Distributed Random Orthogonal Search (TROS) and Quadratic-Distributed Random Orthogonal Search (QROS). With our local search mechanism, both modified algorithms improve the convergence rates and the errors of the obtained solutions significantly on the benchmark functions while preserving the advantages of PROS: parameterless, excellent computational efficiency, ease of applying to all kinds of applications, and high performance with finite-time search budget. The experimental results show that both TROS and QROS are competitive in comparison to several classic metaheuristic optimization algorithms. [ABSTRACT FROM AUTHOR]

Designing an efficient wireless sensor network (WSN) system is considered a challenging problem due to the limited energy supply per sensor node. In this paper, the performance of several bi-objective optimization algorithms in providing energy-efficient clustering solutions that can extend the lifetime of sensor nodes were investigated. Specifically, we considered the use of the Moth–Flame Optimization (MFO) algorithm and the Salp Swarm Algorithm (SSA), as well as the Whale Optimization Algorithm (WOA), in providing efficient cluster-head selection decisions. Compared to a reference scheme using the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol, the simulation results showed that integrating the MFO, SSA or WOA algorithms into WSN clustering protocols could significantly extend the WSN lifetime, which improved the nodes' residual energy, the number of alive nodes, the fitness function and the network throughput. The results also revealed that the MFO algorithm outperformed the other algorithms in terms of energy efficiency. [ABSTRACT FROM AUTHOR]

The optimal power flow (OPF) is an important tool for the secure and economic operation of the power system. It attracts many researchers to pay close attention. Many algorithms are used to solve the OPF problem. The decomposition-based multi-objective algorithm (MOEA/D) is one of them. However, the effectiveness of the algorithm decreases as the size of the power system increases. Therefore, an improved MOEA/D (IMOEA/D) is proposed in this paper to solve the OPF problem. The main goal of IMOEA/D is to speed up the convergence of the algorithm and increase species diversity. To achieve this goal, three improvement strategies are introduced. Firstly, the competition strategy between the barnacle optimization algorithm and differential evolution algorithm is adopted to overcome the reduced species diversity. Secondly, an adaptive mutation strategy is employed to enhance species diversity at the latter stage of iteration. Finally, the selective candidate with similarity selection is used to balance the exploration and exploitation capabilities of the proposed algorithm. Simulation experiments are performed on IEEE 30-bus and IEEE 57-bus test systems. The obtained results show that the above three measures can effectively improve the diversity of the population, and also demonstrate the competitiveness and effectiveness of the proposed algorithm for the OPF problem. [ABSTRACT FROM AUTHOR]

Improved encryption devices place higher demands on the randomness and security of encrypted images. Existing image encryption optimization methods based on single- or multi-objectives concentrate on selecting keys and parameters, resulting in relatively fixed parameters and keys that are susceptible to leakage and cracking. Despite the possibility of increasing security, the DNA coding encryption method does not fully take into account the large capacity of image data and the difference between pixels, resulting in a limited level of randomness. To overcome the problems above, this paper proposes a method for generating complex texture features in images using random variation of pixels. With an annealing algorithm that can find an optimal solution in a large search space, the image is optimally optimized in terms of information entropy, pixel correlation, and value of x2. Each iteration involves selecting one of 25632 combinations of DNA coding and operation. In comparison with current encryption algorithms based on optimization algorithms and DNA coding, this method is more secure and unbreakable. [ABSTRACT FROM AUTHOR]

Single image dehazing has been a challenge in the field of image restoration and computer vision. Many model-based and non-model-based dehazing methods have been reported. This study focuses on a model-based algorithm. A popular model-based method is dark channel prior (DCP) which has attracted a lot of attention because of its simplicity and effectiveness. In DCP-based methods, the model parameters should be appropriately estimated for better performance. Previously, we found that appropriate scaling factors of model parameters helped dehazing performance and proposed an improved DCP (IDCP) method that uses heuristic scaling factors for the model parameters (atmospheric light and initial transmittance). With the IDCP, this paper presents an approach to find optimal scaling factors using the whale optimization algorithm (WOA) and haze level information. The WOA uses ground truth images as a reference in a fitness function to search the optimal scaling factors in the IDCP. The IDCP with the WOA was termed IDCP/WOA. It was observed that the performance of IDCP/WOA was significantly affected by hazy ground truth images. Thus, according to the haze level information, a hazy image discriminator was developed to exclude hazy ground truth images from the dataset used in the IDCP/WOA. To avoid using ground truth images in the application stage, hazy image clustering was presented to group hazy images and their corresponding optimal scaling factors obtained by the IDCP/WOA. Then, the average scaling factors for each haze level were found. The resulting dehazing algorithm was called optimized IDCP (OIDCP). Three datasets commonly used in the image dehazing field, the RESIDE, O-HAZE, and KeDeMa datasets, were used to justify the proposed OIDCP. Then a comparison was made between the OIDCP and five recent haze removal methods. On the RESIDE dataset, the OIDCP achieved a PSNR of 26.23 dB, which was better than IDCP by 0.81 dB, DCP by 8.03 dB, RRO by 5.28, AOD by 5.6 dB, and GCAN by 1.27 dB. On the O-HAZE dataset, the OIDCP had a PSNR of 19.53 dB, which was better than IDCP by 0.06 dB, DCP by 4.39 dB, RRO by 0.97 dB, AOD by 1.41 dB, and GCAN by 0.34 dB. On the KeDeMa dataset, the OIDCP obtained the best overall performance and gave dehazed images with stable visual quality. This suggests that the results of this study may benefit model-based dehazing algorithms. [ABSTRACT FROM AUTHOR]

The beetle antenna search algorithm (BAS) converges rapidly and runs in a short time, but it is prone to yielding values corresponding to local extrema when dealing with high-dimensional problems, and its optimization result is unstable. The artificial fish swarm algorithm (AFS) can achieve good convergence in the early stage, but it suffers from slow convergence speed and low optimization accuracy in the later stage. Therefore, this paper combines the two algorithms according to their respective characteristics and proposes a mutation and a multi-step detection strategy to improve the BAS algorithm and raise its optimization accuracy. To verify the performance of the hybrid composed of the AFS and BAS algorithms based on the Mutation and Multi-step detection Strategy (MMSBAS), AFS-MMSBAS is compared with AFS, the Multi-direction Detection Beetle Antenna Search (MDBAS) Algorithm, and the hybrid algorithm composed of the two (AFS-MDBAS). The experimental results show that, with respect to high-dimensional problems: (1) the AFS-MMSBAS algorithm is not only more stable than the MDBAS algorithm, but it is also faster in terms of convergence and operation than the AFS algorithm, and (2) it has a higher optimization capacity than the two algorithms and their hybrid algorithm. [ABSTRACT FROM AUTHOR]

The optimal placement of distributed generation (DG) is a critical task for distribution companies in order to keep the distribution network running smoothly. The optimal placement of DG units is an optimization problem. In this paper, minimization of the voltage deviation from flat voltage is considered as an objective function. The self-adaptive Lévy flight-based Jaya algorithm is used as an optimization technique to determine the best location and size of distributed generation units. In the MATLAB environment, the proposed algorithm was implemented on IEEE 15 and PG and E 69 bus distribution systems. According to the simulation results, distribution networks can supply more quality power to customers by minimizing the voltage deviation from the flat voltage profile if the DG units are properly placed and sized. [ABSTRACT FROM AUTHOR]

Imaging through the wavy water–air interface is challenging since the random fluctuations of water will cause complex geometric distortion and motion blur in the images, seriously affecting the effective identification of the monitored object. Considering the problems of image recovery accuracy and computational efficiency, an efficient reconstruction scheme that combines lucky-patch search and image registration technologies was proposed in this paper. Firstly, a high-quality reference frame is rebuilt using a lucky-patch search strategy. Then an iterative registration algorithm is employed to remove severe geometric distortions by registering warped frames to the reference frame. During the registration process, we integrate JADE and LBFGS algorithms as an optimization strategy to expedite the control parameter optimization process. Finally, the registered frames are refined using PCA and the lucky-patch search algorithm to remove residual distortions and random noise. Experimental results demonstrate that the proposed method significantly outperforms the state-of-the-art methods in terms of sharpness and contrast. [ABSTRACT FROM AUTHOR]

In this paper, cognitive technology is introduced into the integrated satellite terrestrial system to realize the dynamic spectrum sharing of the system and improve the utilization rate of spectrum resources. To overcome the effects of low signal-to-noise ratio (SNR) and noise uncertainty in the channel, a dual-threshold cooperative sensing strategy based on energy detection is introduced. Spectrum sensing is considered as a binary hypothesis problem, but the uncertainty of noise interference in the integrated satellite terrestrial cognitive system will cause the perception to appear ambiguous. Moreover, the noise power varies with time and relative position within a certain range. In the fuzzy state, the perception technology adopts the equal-gain merging algorithm, and derives the voting optimization algorithm to improve the accuracy of decision-making. In addition, taking the minimum error probability as the optimization goal, the optimal adjustment of the adaptive double threshold is realized based on the equal-gain combining algorithm. The simulation results show that the spectrum detection accuracy under low SNR is improved, and the opportunity for terrestrial networks to share spectrum resources is increased. [ABSTRACT FROM AUTHOR]

Since the increases in electricity demand, environmental awareness, and power reliability requirements, solutions of single-objective optimal power flow (OPF) and multi-objective OPF (MOOPF) (two or three objectives) problems are inadequate for modern power system management and operation. Solutions to the many-objective OPF (more than three objectives) problems are necessary to meet modern power-system requirements, and an efficient optimization algorithm is needed to solve the problems. This paper presents a many-objective marine predators algorithm (MaMPA) for solving single-objective OPF (SOOPF), multi-objective OPF (MOOPF), and many-objective OPF (MaOPF) problems as this algorithm has been widely used to solve other different problems with many successes, except for MaOPF problems. The marine predators algorithm (MPA) itself cannot solve multi- or many-objective optimization problems, so the non-dominated sorting, crowding mechanism, and leader mechanism are applied to the MPA in this work. The considered objective functions include cost, emission, transmission loss, and voltage stability index (VSI), and the IEEE 30- and 118-bus systems are tested to evaluate the algorithm performance. The results of the SOOPF problem provided by MaMPA are found to be better than various algorithms in the literature where the provided cost of MaMPA is more than that of the compared algorithms for more than 1000 USD/h in the IEEE 118-bus system. The statistical results of MaMPA are investigated and express very high consistency with a very low standard deviation. The Pareto fronts and best-compromised solutions generated by MaMPA for MOOPF and MaOPF problems are compared with various algorithms based on the hypervolume indicator and show superiority over the compared algorithms, especially in the large system. The best-compromised solution of MaMPA for the MaOPF problem is found to be greater than the compared algorithms around 4.30 to 85.23% for the considered objectives in the IEEE 118-bus system. [ABSTRACT FROM AUTHOR]

The modern energy requirements and the orientation towards Renewable Energy Sources (RES) integration promote the transition of distribution grids from passive, unidirectional, fossil fuel-based into active, bidirectional, environmental-friendly architectures. For this purpose, advanced control algorithms and optimization processes are implemented, the performance of which relies on the Distribution System State Estimation (DSSE). DSSE algorithms provide the Distribution System Operator (DSO) with detailed information regarding the network's state in order to derive the optimal decisions. However, this task is quite complex as the distribution system has inherent unbalance issues, often faces lack of adequate measurements, etc. The purpose of this paper is to review the DSSE algorithms that a system can incorporate with emphasis on their particular requirements, the mathematical formulation of the problem, the analysis of the existing model-based and data-driven approaches and the recommended solutions regarding observability issues, bad data detection, and meter placement strategies. Furthermore, special attention is paid to DSSE applications, including the use cases where they can be deployed, the approaches that are usually followed, the integrated distributed power supply units, as well as their future trends and challenges, thus highlighting their business-related aspects. [ABSTRACT FROM AUTHOR]

In this paper, a stochastic-metaheuristic model is performed for multi-objective allocation of photovoltaic (PV) resources in 33-bus and 69-bus distribution systems to minimize power losses of the distribution system lines, improving the voltage profile and voltage stability of the distribution system buses, considering the uncertainty of PV units' power and network demand. The decision-making variables, including installation location and the size of PVs, are determined optimally via an improved human learning optimization algorithm (IHLOA). The conventional human learning optimization algorithm (IHLOA) is improved based on Gaussian mutation to enhance the exploration capability and avoid getting trapped in local optimal. The methodology is implemented in two cases as deterministic and stochastic without and with uncertainties, respectively. Monte Carol Simulation (MCS) based on probability distribution function (PDF) is used for uncertainties modeling. The deterministic results proved the superiority of the IHLOA compared with conventional HLOA, particle swarm optimization (PSO), to obtain better values of the different objectives and faster convergence speed and accuracy. The results are clear that enhancing the conventional HLOA has increased the algorithm's ability to explore and achieve the optimal global solution with higher convergence accuracy. Moreover, the stochastic results were clear that considering the uncertainties leads to correct and robust decision-making against existing uncertainties and accurate knowledge of the network operator against the exact values of various objectives compared to the deterministic case. [ABSTRACT FROM AUTHOR]

The variational quantum algorithm (VQA) is a hybrid classical–quantum algorithm. It can actually run in an intermediate-scale quantum device where the number of available qubits is too limited to perform quantum error correction, so it is one of the most promising quantum algorithms in the noisy intermediate-scale quantum era. In this paper, two ideas for solving the learning with errors problem (LWE) using VQA are proposed. First, after reducing the LWE problem into the bounded distance decoding problem, the quantum approximation optimization algorithm (QAOA) is introduced to improve classical methods. Second, after the LWE problem is reduced into the unique shortest vector problem, the variational quantum eigensolver (VQE) is used to solve it, and the number of qubits required is calculated in detail. Small-scale experiments are carried out for the two LWE variational quantum algorithms, and the experiments show that VQA improves the quality of the classical solutions. [ABSTRACT FROM AUTHOR]

This paper presents a system for medical image diagnosis that uses transfer learning (TL) and feature selection techniques. The main aim of TL on pre-trained models such as MobileNetV3 is to extract features from raw images. Here, a novel feature selection optimization algorithm called the Artificial Hummingbird Algorithm based on Aquila Optimization (AHA-AO) is proposed. The AHA-AO is used to select only the most relevant features and ensure the improvement of the overall model classification. Our methodology was evaluated using four datasets, namely, ISIC-2016, PH2, Chest-XRay, and Blood-Cell. We compared the proposed feature selection algorithm with five of the most popular feature selection optimization algorithms. We obtained an accuracy of 87.30% for the ISIC-2016 dataset, 97.50% for the PH2 dataset, 86.90% for the Chest-XRay dataset, and 88.60% for the Blood-cell dataset. The AHA-AO outperformed the other optimization techniques. Moreover, the developed AHA-AO was faster than the other feature selection models during the process of determining the relevant features. The proposed feature selection algorithm successfully improved the performance and the speed of the overall deep learning models. [ABSTRACT FROM AUTHOR]

Due to complex terrain and harsh environments, sensor nodes are often randomly scattered in the monitoring area, which may cause coverage holes or network disconnection. Current works move some sensor nodes to certain places to address this problem. However, these works cannot guarantee the coverage and connectivity simultaneously and have larger moving cost in energy. In this paper, we propose a coverage optimization strategy based on the flower pollination algorithm (FPA). First, to solve the shortcomings of the classical FPA in convergence and accuracy, an improved FPA is proposed. Then, the network deployment optimization problem is modeled as a multi-objective optimization problem that guarantees the coverage of target points and the connectivity of the network while minimizing the energy consumption of sensor nodes' moving. The sensor nodes are selected and moved to the proper position by utilizing the improved FPA to minimize the energy consumed by the sensors' motion and guarantee the coverage and connectivity. Test results show that the improved FPA has good convergence speed and accuracy compared with other evolutionary algorithms. Simulation results demonstrate that the proposed algorithm can guarantee network connectivity and satisfy the coverage requirement while minimizing the energy consumption of the sensor movement. Consequently, more energy of the sensor node can be used to collect and transmit sensed data. These results indicate that our algorithm can prolong network lifetime and improve monitoring quality in fields such as forest monitoring. [ABSTRACT FROM AUTHOR]

Mathematical optimization (MO) formulates a decision problem with a maximization or minimization objective and a set of constraints on the decision variables, and designs an algorithm to find the best solution. A large number of computer vision researchers work on this standard problem and, as a result, it is easy for the community to compare different algorithms, to work on and improve those that are most accurate, and to apply or adapt the algorithm that represents the most state-of-the-art solution to practical problems. To date, a large variety of problems have been solved by myriad MO algorithms; see the papers published in the MO application journal I INFORMS Journal on Applied Analytics i and algorithm journals I Mathematical Programming i and I Operations Research i . [Extracted from the article]

This paper is concerned with the application of computational intelligence techniques to the conceptual design and development of a large-scale floating settlement. The settlement in question is a design for the area of Urla, which is a rural touristic region located on the west coast of Turkey, near the metropolis of Izmir. The problem at hand includes both engineering and architectural aspects that need to be addressed in a comprehensive manner. We thus adapt the view as a multi-objective constrained real-parameter optimization problem. Specifically, we consider three objectives, which are conflicting. The first one aims at maximizing accessibility of urban functions such as housing and public spaces, as well as special functions, such as a marina for yachts and a yacht club. The second one aims at ensuring the wind protection of the general areas of the settlement, by adequately placing them in between neighboring land masses. The third one aims at maximizing visibility of the settlement from external observation points, so as to maximize the exposure of the settlement. To address this complex multi-objective optimization problem and identify lucrative alternative design solutions, a multi-objective harmony search algorithm (MOHS) is developed and applied in this paper. When compared to the Differential Evolution algorithm developed for the problem in the literature, we demonstrate that MOHS achieves competitive or slightly better performance in terms of hyper volume calculation, and gives promising results when the Pareto front approximation is examined. [ABSTRACT FROM AUTHOR]

Chimp Optimization Algorithm (ChOA), a novel meta-heuristic algorithm, has been proposed in recent years. It divides the population into four different levels for the purpose of hunting. However, there are still some defects that lead to the algorithm falling into the local optimum. To overcome these defects, an Enhanced Chimp Optimization Algorithm (EChOA) is developed in this paper. Highly Disruptive Polynomial Mutation (HDPM) is introduced to further explore the population space and increase the population diversity. Then, the Spearman's rank correlation coefficient between the chimps with the highest fitness and the lowest fitness is calculated. In order to avoid the local optimization, the chimps with low fitness values are introduced with Beetle Antenna Search Algorithm (BAS) to obtain visual ability. Through the introduction of the above three strategies, the ability of population exploration and exploitation is enhanced. On this basis, this paper proposes an EChOA-SVM model, which can optimize parameters while selecting the features. Thus, the maximum classification accuracy can be achieved with as few features as possible. To verify the effectiveness of the proposed method, the proposed method is compared with seven common methods, including the original algorithm. Seventeen benchmark datasets from the UCI machine learning library are used to evaluate the accuracy, number of features, and fitness of these methods. Experimental results show that the classification accuracy of the proposed method is better than the other methods on most data sets, and the number of features required by the proposed method is also less than the other algorithms. [ABSTRACT FROM AUTHOR]

Compressive sensing theory has attracted widespread attention in recent years and sparse signal reconstruction has been widely used in signal processing and communication. This paper addresses the problem of sparse signal recovery especially with non-Gaussian noise. The main contribution of this paper is the proposal of an algorithm where the negentropy and reweighted schemes represent the core of an approach to the solution of the problem. The signal reconstruction problem is formalized as a constrained minimization problem, where the objective function is the sum of a measurement of error statistical characteristic term, the negentropy, and a sparse regularization term, ℓp-norm, for 0 < p < 1. The ℓp-norm, however, leads to a non-convex optimization problem which is difficult to solve efficiently. Herein we treat the ℓp-norm as a serious of weighted ℓ1-norms so that the sub-problems become convex. We propose an optimized algorithm that combines forward-backward splitting. The algorithm is fast and succeeds in exactly recovering sparse signals with Gaussian and non-Gaussian noise. Several numerical experiments and comparisons demonstrate the superiority of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a decision model based on a fuzzy soft set and ideal solution approaches is proposed. This new decision-making method uses the divide-and-conquer algorithm, and it is different from the existing algorithm (the choice value based approach and the comparison score based approach). The ideal solution is generated according to each attribute (pros or cons of the attributes, with or without constraints) of the fuzzy soft sets. Finally, the weighted Hamming distance is used to compute all possible alternatives and get the final result. The core of the decision process is the design phase, the existing decision models based on soft sets mostly neglect the analysis of attributes and decision objectives. This algorithm emphasizes the correct expression of the purpose of the decisionmaker and the analysis of attributes, aswell as the explicit decision function. Additionally, this paper shows the fact that the rank reversal phenomenon occurs in the comparison score algorithm, and an example is provided to illustrate the rank reversal phenomenon. Experiments indicate that the decision model proposed in this paper is efficient and will be useful for practical problems. In addition, as a general model, it can be extended to a wider range of fields, such as classifications, optimization problems, etc. [ABSTRACT FROM AUTHOR]

The operation of the photovoltaic (PV) system under partial shading conditions (PSC) is complicated since the output characteristic of the PV system is profoundly affected by the heterogeneous irradiance of PSC. This paper proposes a dynamic reconfiguration framework to tackle PSC in the PV array. Continuous operation of the dynamic PV array reconfiguration under cloud-induced partial shading is considered by developing an emulator of the moving cloud. In addition, the Particle Swarm Optimization and Rao algorithms are improved to obtain the optimal PV array configuration under PSC. The operation of switching is enhanced by simultaneously considering the total switching times and the operation of highly active switches. The simulation results on the 9 × 9 PV array demonstrate the effectiveness of the proposed framework in terms of reducing the number of local maximum power points on the power-voltage characteristic, enhancing power output, and relieving stress on the switching operation of the PV array under different PSC. [ABSTRACT FROM AUTHOR]