Search Results (160)

This paper proposes a high-performing, hybrid method for Maximum Power Point Tracking (MPPT) in photovoltaic (PV) systems. The approach is based on an intelligent Nonlinear Discrete Proportional–Integral–Derivative (N-DPID) controller with the Perturb and Observe (P&O) method. The feedback gains derived are optimized by a metaheuristic algorithm called Particle Swarm Optimization (PSO). The proposed methods appear to present adequate solutions to overcome the drawbacks of existing methods despite various weather conditions considered in the analysis, providing a robust solution for dynamic environmental conditions. The results showed better performance and accuracy compared to those encountered in the literature. We also recall that this technique provides a systematic design procedure in the search for the MPPT in photovoltaic (PV) systems that has not yet been documented in the literature to the best of our knowledge. Full article

Various metaheuristic algorithms inspired by nature have been designed to deal with a variety of practical optimization problems. As an excellent metaheuristic algorithm, the improved particle swarm optimization algorithm based on grouping (IPSO) has strong global search capabilities. However, it lacks a strong local search ability and the ability to solve constrained discrete optimization problems. This paper focuses on improving these two aspects of the IPSO algorithm. Based on IPSO, we propose an improved particle swarm optimization algorithm based on variable neighborhood search (VN-IPSO) and design a 0-1 integer programming solution with constraints. In the experiment, the performance of the VN-IPSO algorithm is fully tested and analyzed using 23 classic benchmark functions (continuous optimization), 6 knapsack problems (discrete optimization), and 10 CEC2017 composite functions (complex functions). The results show that the VN-IPSO algorithm wins 18 first places in the classic benchmark function test set, including 6 first places in the solutions for seven unimodal test functions, indicating a good local search ability. In solving the six knapsack problems, it wins four first places, demonstrating the effectiveness of the 0-1 integer programming constraint solution and the excellent solution ability of VN-IPSO in discrete optimization problems. In the test of 10 composite functions, VN-IPSO wins first place four times and ranks the first in the comprehensive ranking, demonstrating its excellent solving ability for complex functions. Full article

Due to the influence of the complex underwater environment, the sound speed constantly changes, resulting in the acoustic signal propagation trajectory being curved, which greatly affects the positioning accuracy of the underwater long baseline (LBL) system. In this paper, an improved LBL positioning method based on a B-spline surface for fitting the effective sound speed table (ESST) is proposed. Firstly, according to the underwater sound speed profile, the discrete ESST of each measurement station is constructed before the positioning test, and then, the node position of the B-spline surface is optimized by particle swarm optimization (PSO) to accurately fit the discrete ESST. Based on this, the improved LBL positioning method is constructed. In the underwater positioning test, the effective sound speed can be quickly found by measuring the time of arrival (TOA) of the acoustic signal and the target depth, and moreover, the target position parameters can be quickly and accurately estimated. The numerical simulation results show that the improved positioning method proposed in this paper can effectively improve the LBL positioning accuracy and provide the theoretical basis and the technical support for the underwater navigation and positioning. Full article

This study proposes an improved mixed-variable quantum particle swarm optimization (QPSO) algorithm capable of optimizing both continuous and discrete variables. The algorithm is applied to the wind resistance optimization of a cable-stiffened, single-layer spherical reticulated shell (SLSRS), optimizing discrete variables like member dimensions and cable dimensions alongside continuous variables such as cable prestress. Through a computational case study on an SLSRS, the optimization results of the proposed QPSO method are compared with other optimization techniques, validating its accuracy and reliability. Furthermore, this study establishes a mathematical model for the wind resistance optimization of cable-stiffened SLSRSs and outlines the wind resistance optimization process based on the mixed-variable QPSO algorithm. The optimization of these structures reveals the strong stability and global search capabilities of the proposed algorithm. Additionally, the comparison of section optimization and shape optimization highlights the significant impact of the shell shape on steel usage and costs, underscoring the importance of shape optimization in the design process. Full article

In recent years, electroencephalography (EEG) has been investigated for identifying brain disorders. This technique involves placing multiple electrodes (channels) on the scalp to measure the brain’s activities. This study focuses on accurately detecting mild cognitive impairment (MCI) from the recorded EEG signals. To achieve this, this study first introduced discrete wavelet transform (DWT)-based approaches to generate reliable biomarkers for MCI. These approaches decompose each channel’s signal using DWT into a set of distinct frequency band signals, then extract features using a non-linear measure such as band power, energy, or entropy. Various machine learning approaches then classify the generated features. We investigated these methods on EEGs recorded using 19 channels from 29 MCI patients and 32 healthy subjects. In the second step, the study explored the possibility of decreasing the number of EEG channels while preserving, or even enhancing, classification accuracy. We employed multi-objective optimization techniques, such as the non-dominated sorting genetic algorithm (NSGA) and particle swarm optimization (PSO), to achieve this. The results show that the generated DWT-based features resulted in high full-channel classification accuracy scores. Furthermore, selecting fewer channels carefully leads to better accuracy scores. For instance, with a DWT-based approach, the full-channel accuracy achieved was 99.84%. With only four channels selected by NSGA-II, NSGA-III, or PSO, the accuracy increased to 99.97%. Furthermore, NSGA-II selects five channels, achieving an accuracy of 100%. The results show that the suggested DWT-based approaches are promising to detect MCI, and picking the most useful EEG channels makes the accuracy even higher. The use of a small number of electrodes paves the way for EEG-based diagnosis in clinical practice. Full article

This paper presents a new approach to the nonlinear model predictive control (NMPC) of an underactuated overhead crane system developed using a data-driven prediction model obtained utilizing the regularized genetic programming-based symbolic regression method. Grammar-guided genetic programming combined with regularized least squares was applied to identify a nonlinear autoregressive model with an exogenous input (NARX) prediction model of the crane dynamics from input–output data. The resulting prediction model was implemented in the NMPC scheme, using a particle swarm optimization (PSO) algorithm as a solver to find an optimal sequence of the control actions satisfying multi-objective performance requirements and input constraints. The feasibility and performance of the controller were experimentally verified using a laboratory crane actuated by AC motors and compared with a discrete-time feedback controller developed using the pole placement technique. A series of experiments proved the effectiveness of the controller in terms of robustness against operating condition variation and external disturbances. Full article

The reactive power optimization of an active distribution network can effectively deal with the problem of voltage overflows at some nodes caused by the integration of a high proportion of distributed sources into the distribution network. Aiming to address the limitations in previous studies of dynamic reactive power optimization using the cluster partitioning method, a three-stage dynamic reactive power optimization decoupling strategy for active distribution networks considering carbon emissions is proposed in this paper. First, a carbon emission index is proposed based on the carbon emission intensity, and a dynamic reactive power optimization mathematical model of an active distribution network is established with the minimum active power network loss, voltage deviation, and carbon emissions as the satisfaction objective functions. Second, in order to satisfy the requirement for the all-day motion times of discrete devices, a three-stage dynamic reactive power optimization decoupling strategy based on the partitioning around a medoids clustering algorithm is proposed. Finally, taking the improved IEEE33 and PG&E69-node distribution network systems as examples, the proposed linear decreasing mutation particle swarm optimization algorithm was used to solve the mathematical model. The results show that all the indicators of the proposed strategy and algorithm throughout the day are lower than those of other methods, which verifies the effectiveness of the proposed strategy and algorithm. Full article

Addressing the formidable challenges posed by multiple jammers jamming multiple radars, which arise from spatial discretization, many degrees of freedom, numerous model input parameters, and the complexity of constraints, along with a multi-peaked objective function, this paper proposes a cooperative jamming resource allocation method, based on evolutionary reinforcement learning, that uses joint multi-domain information. Firstly, an adversarial scenario model is established, characterizing the interaction between multiple jammers and radars based on a multi-beam jammer model and a radar detection model. Subsequently, considering real-world scenarios, this paper analyzes the constraints and objective function involved in cooperative jamming resource allocation by multiple jammers. Finally, accounting for the impact of spatial, frequency, and energy domain information on jamming resource allocation, matrices representing spatial condition constraints, jamming beam allocation, and jamming power allocation are formulated to characterize the cooperative jamming resource allocation problem. Based on this foundation, the joint allocation of the jamming beam and jamming power is optimized under the constraints of jamming resources. Through simulation experiments, it was determined that, compared to the dung beetle optimizer (DBO) algorithm and the particle swarm optimization (PSO) algorithm, the proposed evolutionary reinforcement learning algorithm based on DBO and Q-Learning (DBO-QL) offers 3.03% and 6.25% improvements in terms of jamming benefit and 26.33% and 50.26% improvements in terms of optimization success rate, respectively. In terms of algorithm response time, the proposed hybrid DBO-QL algorithm has a response time of 0.11 s, which is 97.35% and 96.57% lower than the response times of the DBO and PSO algorithms, respectively. The results show that the method proposed in this paper has good convergence, stability, and timeliness. Full article

The present work aims to optimize the magnetomotive force and the end-winding leakage inductance from a discrete distribution of conductors in electrical machines through multi-objective particle swarm heuristics. From the development of an application capable of generating the conductor distribution for different machine configurations (single or poly-phase, single or double layer, integral or fractional slots, full or shortened pitch, with the presence of empty slots, etc.) the curves of magnetomotive force and the end-winding leakage inductance associated with the winding are computed. Taking as an optimal winding the one that presents, simultaneously, less harmonic distortion of the magnetomotive force and less leakage inductance, optimization by multi-objective particle swarm was used to obtain the optimal electrical machine configuration and the results are presented. Full article

Currently, the multi-machine collaboration of agricultural machinery is one of the international frontiers and a topic of research interest in the field of agricultural equipment. However, the multi-machine cooperative operation of agricultural machinery is mostly limited to the research on task goal planning and cooperative path optimization of a single operation. To address the mentioned shortcomings, this study addresses the problem of multi-machine cooperative operation of fertilizer applicators in fields with different fertility and fertilizer cooperative distribution of fertilizer trucks. The research uses the task allocation method of a multi-machine cooperative operation of applying fertilizer-transporting fertilizer. First, the problems of fertilizer applicator operation and fertilizer truck fertilizer distribution are defined, and the operating time and the distribution distance are used as optimization objectives to construct functions to establish task allocation mathematical models. Second, a Chaos–Cauchy Fireworks Algorithm (CCFWA), which includes a discretized decoding method, a population initialization with a chaotic map, and a Cauchy mutation operation, is developed. Finally, the proposed algorithm is verified by tests in an actual scenario of fertilizer being applied in the test area of Jimo District, Qingdao City, Shandong Province. The results show that compared to the Fireworks Algorithm, Genetic Algorithm, and Particle Swarm Optimization, the proposed CCFWA can address the problem of falling into a local optimum while guaranteeing the convergence speed. Also, the variance of the CCFWA is reduced by more than 48% compared with the other three algorithms. The proposed method can realize multi-machine cooperative operation and precise distribution of seeds and fertilizers for multiple seeding-fertilizer applicators and fertilizer trucks. Full article

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. Full article

In the dynamic optimization problem of the distribution network, a dynamic reconstruction method based on a stochastic probability model and optimized beetle antennae search is proposed. By implementing dynamic reconstruction of distributed energy distribution networks, the dynamic regulation and optimization capabilities of the distribution network can be improved. In this study, a random probability model is used to describe the uncertainty in the power grid. The beetle antennae search is used for dynamic multi-objective optimization. The performance of the beetle antennae search is improved by combining it with the simulated annealing algorithm. According to the results, the optimization success rate of the model was 98.7%. Compared with the discrete binary particle swarm optimization algorithm and bacterial foraging optimization algorithm, it was 9.3% and 26.1% faster, respectively. For practical applications, this model could effectively reduce power grid transmission losses, with a reduction range of 16.7–18.6%. Meanwhile, the charging and discharging loads were effectively reduced, with a reduction range of 16.2–19.7%. Therefore, this method has significant optimization effects on actual power grid operation. This research achievement contributes to the further development of dynamic reconstruction technology for distribution networks, improving the operational efficiency and stability of the power grid. This has important practical significance for achieving green and intelligent operation of the power system. Full article

Distributed Constraint Optimization Problems (DCOPs) are an efficient framework widely used in multi-agent collaborative modeling. The traditional DCOP framework assumes that variables are discrete and constraint utilities are represented in tabular forms. However, the variables are continuous and constraint utilities are in functional forms in many practical applications. To overcome this limitation, researchers have proposed Continuous DCOPs (C-DCOPs), which can model DCOPs with continuous variables. However, most of the existing C-DCOP algorithms rely on gradient information for optimization, which means that they are unable to solve the situation where the utility function is a non-differentiable function. Although the Particle Swarm-Based C-DCOP (PCD) and Particle Swarm with Local Decision-Based C-DCOP (PCD-LD) algorithms can solve the situation with non-differentiable utility functions, they need to implement Breadth First Search (BFS) pseudo-trees for message passing. Unfortunately, employing the BFS pseudo-tree results in expensive computational overheads and agent privacy leakage, as messages are aggregated to the root node of the BFS pseudo-tree. Therefore, this paper aims to propose a fully distributed C-DCOP algorithm to solve the utility function form problem and avoid the disadvantages caused by the BFS pseudo-tree. Inspired by the population-based algorithms, we propose a fully decentralized local search algorithm, named Population-based Local Search Algorithm (PLSA), for solving C-DCOPs with three-fold advantages: (i) PLSA adopts a heuristic method to guide the local search to achieve a fast search for high-quality solutions; (ii) in contrast to the conventional C-DCOP algorithm, PLSA can solve utility functions of any form; and (iii) compared to PCD and PCD-LD, PLSA avoids complex message passing to achieve efficient computation and agent privacy protection. In addition, we implement an extended version of PLSA, named Population-based Global Search Algorithm (PGSA), and empirically show that our algorithms outperform the state-of-the-art C-DCOP algorithms on three types of benchmark problems. Full article

The increasing demand for storing various types of goods has led to a raise in the need for storage capacity in warehousing systems. Autonomous vehicle storage and retrieval systems (AVS/RSs) offer high flexibility by allowing different configurations to meet different storage requirements. The system mainly completes operations through elevators and multiple rail-guided vehicles (RGVs). This paper focuses on the scheduling optimization of compound operations in the AVS/RS to improve system performance. Compound operations involve the coordinated execution of both single-command and double-command operations. A mathematical model with compound operations was proposed and effectively decomposed into a horizontal component for RGVs and a vertical counterpart for the elevator, which can represent the operations of one elevator cooperating with multiple RGVs. The goal of this model was to minimize the makespan for compound operations and to determine the optimal operation sequence and path for RGVs. An improved discrete particle swarm optimization (DPSO) algorithm called AGDPSO was proposed to solve the model. The algorithm combines DPSO and a genetic algorithm in an adaptive manner to prevent the algorithm from falling into local optima and relying solely on the initial solution. Through rigorous optimization, optimal parameters for the algorithm were identified. When assessing the performance of our improved algorithm against various counterparts, considering different task durations and racking configurations, our results showed that AGDPSO outperformed the alternatives, proving its effectiveness in enhancing system efficiency for the model. The findings of this study not only contribute to the optimization of AVS/RS but also offer valuable insights for designing more efficient warehouses. By streamlining scheduling, improving operations, and leveraging advanced optimization techniques, we can create a more robust and effective storage and retrieval system. Full article

In image processing applications, image fusion techniques gain popularity because they combine the most appropriate features of different source images in order to generate a single image that contains more information and is more beneficial. In this paper, initially, we have analysed the conventional spatial and transform domain image fusion techniques. These techniques face numerous challenges, such as low contrast, noise, and redundancy. To overcome these challenges, adaptive image fusion methods using nature-inspired optimization algorithms (YSGA) are deployed. These algorithms search for the optimal solution for the image fusion technique based on the objective function. Therefore, the main focus of this paper is to study and analyse the optimization algorithms based on various factors. Full article