Dynamic Particle Swarm Research Articles (Page 1)

An artificial intelligence integrated application model of supply chain financial risk assessment is constructed. Based on the financial data and supply chain data of listed companies in China’s new energy electric vehicle industry, the supply chain financial credit risk evaluation index system is constructed. The data samples are preprocessed by PCA as the input data of the support vector machine, which effectively solves the problem of high-dimensional data in supply chain finance. By improving the inertia weight of particle swarm optimization and introducing mutation operation, a dynamic mutation particle swarm optimization algorithm is proposed to avoid the problem of particles falling into a local minimum in the process of optimization. Finally, the improved optimization algorithm is used to optimize the parameters of SVM and input AdaBoost integration as a weak classifier to build an integrated model with good performance in many aspects. The model has been successfully applied to the credit risk assessment of China’s new energy vehicle supply chain finance. The comparison with other models shows that the constructed model has certain advantages in performance.

Shadow detection is an essential research topic in the remote-sensing domain, as the presence of shadow causes the loss of ground-object information in real areas. It is hard to define specific threshold values for the identification of shadow areas with the existing unsupervised approaches due to the complexity of remote-sensing scenes. In this study, an adaptive unsupervised-shadow-detection method based on multichannel features is proposed, which can adaptively distinguish shadow in different scenes. First, new multichannel features were designed in the hue, saturation, and intensity color space, and the shadow properties of high hue, high saturation, and low intensity were considered to solve the insufficient feature-extraction problem of shadows. Then, a dynamic local adaptive particle swarm optimization was proposed to calculate the segmentation thresholds for shadows in an adaptive manner. Finally, experiments performed on the Aerial Imagery dataset for Shadow Detection (AISD) demonstrated the superior performance of the proposed approach in comparison with traditional unsupervised shadow-detection and state-of-the-art deep-learning methods. The experimental results show that the proposed approach can detect the shadow areas in remote-sensing images more accurately and efficiently, with the F index being 82.70% on the testing images. Thus, the proposed approach has better application potential in scenarios without a large number of labeled samples.

Abstract Particle swarm optimization (PSO) is a high-quality, nature-inspired global optimization algorithm that can be applied to a variety of real-world optimization problems. PSO, on the other hand, has some flaws, such as slow convergence, premature convergence, and the ability to become stuck at local optimum solutions. This research aims to address the issue of population diversity in the PSO search process, which leads to premature convergence. As a result, in this study, a method is introduced to PSO in order to avoid early stagnation, which leads to premature convergence. A chaotic dynamic weight particle swarm optimization (CTPSOA) is proposed, in which a chaotic logistic map is delivered to increase the population range within the PSO search technique by editing the inertia weight of PSO to avoid premature convergence. This study also looks into the overall performance and viability of the proposed CTPSOA as a set of function selection rules for solving optimization issues. There are eight traditional benchmark functions that are used to assess the overall results and obtain the accuracy of the proposed (CTPSOA) algorithms when compared to a few other meta-heuristics optimization rules. The test results reveal that the CTPSOA outperforms other meta-heuristics algorithms in solving optimization problems by 85% and has established itself as a reliable and superior metaheuristics algorithm for feature selection.

In view of the difficulty of applying the refine modeling of combined heat and power (CHP) units to the optimization scenario of integrated energy system, a CHP unit model based on working point linearization modeling is proposed, and its variable load characteristics are analyzed. Firstly, the dynamic coupling relationship of CHP unit is analyzed, and the nonlinear dynamic model of the unit is constructed. Then, under the pure condensation and heating conditions, the linearized Laplace transform model of the working point is established, and the variable load capacity under the independent action of control variables is analyzed to test the availability of the Laplace model. On this basis, the dynamic adaptive particle swarm optimization algorithm is used for multivariable cooperative control to test the open-loop characteristics of the variable load capacity of the unit. At the same time, the control strategy of electrothermal cooperation and safety self-test is designed to adjust the control variables, and test the closed-loop characteristics of the unit’s regulation ability. Finally, a 300-MW steam extraction CHP unit is taken as an example to verify the applicability of the unit model and the effectiveness of the control strategy.

In recent years, with the wide application and popularization of artificial intelligence algorithm in the field of multisensor information processing, it has been a research hotspot to solve the problem of sensor alliance formation in the battlefield environment by using multisensor cross-cueing technology. Based on the establishment of the multisensor hybrid dynamic alliance model and objective function, a multisensor cross-cueing algorithm based on dynamic discrete particle swarm optimization (DDPSO) with sensitive particles is proposed and a mechanism of “predict re-predict” is proposed in the process of sensor handover. Simulations have verified the good convergence effect and small detection error of multisensor cross-cueing technology in solving alliance formation problems. Meanwhile, compared with “measurement and then update” and “predict and update” mechanisms, the proposed mechanism is more suitable to the changing combat environment. At the same time, to some extent, it also shows that the artificial intelligence algorithm is more suitable for multisensor information processing.

Multiple objective function with beamforming techniques by algorithms have been studied for the Simultaneous Wireless Information and Power Transfer (SWIPT) technology at millimeter wave. Using the feed length to adjust the phase for different objects of SWIPT with Bit Error Rate (BER) and Harvesting Power (HP) are investigated in the broadband communication. Symmetrical antenna array is useful for omni bearing beamforming adjustment with multiple receivers. Self-Adaptive Dynamic Differential Evolution (SADDE) and Asynchronous Particle Swarm Optimization (APSO) are used to optimize the feed length of the antenna array. Two different object functions are proposed in the paper. The first one is the weighting factor multiplying the constraint BER and HP plus HP. The second one is the constraint BER multiplying HP. Simulations show that the first object function is capable of optimizing the total harvesting power under the BER constraint and APSO can quickly converges quicker than SADDE. However, the weighting for the final object function requires a pretest in advance, whereas the second object function does not need to set the weighting case by case and the searching is more efficient than the first one. From the numerical results, the proposed criterion can achieve the SWIPT requirement. Thus, we can use the novel proposed criterion (the second criterion) to optimize the SWIPT problem without testing the weighting case by case.

Particle swarm optimizer is one of the searched based stochastic technique that has a weakness of being trapped into local optima. Thus, to tradeoff between the local and global searches and to avoid premature convergence in PSO, a new dynamic quantum-based particle swarm optimization (DQPSO) method is proposed in this work. In the proposed method a beta probability distribution technique is used to mutate the particle with the global best position of the swarm. The proposed method can ensure the particles to escape from local optima and will achieve the global optimum solution more easily. Also, to enhance the global searching capability of the proposed method, a dynamic updated formula is proposed that will keep a good balance between the local and global searches. To evaluate the merit and efficiency of the proposed DQPSO method, it has been tested on some well-known mathematical test functions and a standard benchmark problem known as Loney’s solenoid design.

Particle swarm optimization (PSO) is a common metaheuristic algorithm. However, when dealing with practical engineering structure optimization problems, it is prone to premature convergence during the search process and falls into a local optimum. To strengthen its performance, combining several ideas of the differential evolution algorithm (DE), a dynamic probability mutation particle swarm optimization with chaotic inertia weight (CWDEPSO) is proposed. The main improvements are achieved by improving the parameters and algorithm mechanism in this paper. The former proposes a novel inverse tangent chaotic inertia weight and sine learning factors. Besides, the scaling factor and crossover probability are improved by random distributions, respectively. The latter introduces a monitoring mechanism. By monitoring the convergence of PSO, a developed mutation operator with a more reliable local search capability is adopted and increases population diversity to help PSO escape from the local optimum effectively. To evaluate the effectiveness of the CWDEPSO algorithm, 24 benchmark functions and two groups of engineering optimization experiments are used for numerical and engineering optimization, respectively. The results indicate CWDEPSO offers better convergence accuracy and speed compared with some well-known metaheuristic algorithms.

Based on the analysis of bacterial parasitic behavior and biological immune mechanism, this paper puts forward the basic idea and implementation method of an embedding adaptive dynamic probabilistic parasitic immune mechanism into a particle swarm optimization algorithm and constructs particle swarm optimization based on an adaptive dynamic probabilistic parasitic immune mechanism algorithm. The specific idea is to use the elite learning mechanism for the parasitic group with a strong parasitic ability to improve the ability of the algorithm to jump out of the local extreme value, and the host will generate acquired immunity against the parasitic behavior of the parasitic group to enhance the diversity of the host population’s particles. Parasitic behavior occurs when the number of times reaches a predetermined algebra. In this paper, an example simulation is carried out for the prescheduling and dynamic scheduling of immune inspection. The effectiveness of prescheduling for immune inspection is verified, and the rules constructed by the adaptive dynamic probability particle swarm algorithm and seven commonly used scheduling rules are tested on two common dynamic events of emergency task insertion and subdistributed immune inspection equipment failure. In contrast, the experimental data was analyzed. From the analysis of experimental results, under the indicator of minimum completion time, the overall performance of the adaptive dynamic probability particle swarm optimization algorithm in 20 emergency task insertion instances and 20 subdistributed immune inspection equipment failure instances is better than that of seven scheduling rules. Therefore, in the two dynamic events of emergency task insertion and subdistributed immune inspection equipment failure, the adaptive dynamic probabilistic particle swarm algorithm proposed in this paper can construct effective scheduling rules for the rescheduling of the system when dynamic events occur and the constructed scheduling. The performance of the rules is better than that of the commonly used scheduling rules. Among the commonly used scheduling rules, the performance of the FIFO scheduling rules is also better. In general, the immune inspection scheduling multiagent system in this paper can complete the prescheduling of immune inspection and process dynamic events of the inspection process and realize the prereactive scheduling of the immune inspection process.

ABSTRACT This paper is to reconstruct the periodic inhomogeneous dielectric distribution of the scatterer buried in the rough surface. In order to explore the dielectric coefficient distribution of the unknown dielectric object under the rough surface, we emit electromagnetic wave to the object and measure the scattered electromagnetic wave above the rough surface. Base on Green's identity and the induced current concepts, the nonlinear integral equation can be derived and solved by the method of moments. Next, the inverse scattering problem is converted into an optimization problem. We use Self-Adaptive Dynamic Differential Evolution (SADDE) and Asynchronous Particle Swarm Optimization (APSO) to find the extreme value of the problem. With the regularization technique, the reconstruction is good. When the noise is less than 1%, the dielectric constant can also be achieved successfully. Numerical results show that SADDE can reduce the error for the permittivities of the object better than the APSO.

Benchmarking the energy performance of buildings has received increasing attention as striving for energy efficiency through more effective energy management has become a major concern of governments. Various methods for classifying building energy performance have been developed, and the clustering technique is considered one of the best approaches. This paper proposes a method utilizing dynamic clustering to analyze the electricity consumption patterns of buildings to decide the optimal cluster number and allocate the buildings to corresponding clusters for energy benchmarking. For the evaluation of number of clusters, this article has employed the inter–intra clustering method with particle swarm optimization algorithm. The electricity consumption data were collected through an energy survey performed in 30 junior high schools in Taipei, Taiwan. In a traditional method, the 30 schools would be grouped into one same cluster and the energy benchmarking report an average value of 541.4 kWh/year per student. The proposed method that took different electricity consumption patterns of the schools into consideration produced more detailed results as follows: the optimal cluster number was 3 with an inter–intra index value of 0.708, and the energy benchmarking index of these three clusters read, respectively, 362, 512, and 851 kWh/year per student. Practical application: The study proposed an innovative dynamic clustering technique to decide the optimal cluster number and allocate the assessed buildings. The results showed that compared to a traditional approach that tended to group assessed buildings into one cluster, the proposed method was able to classify the buildings into three clusters for further benchmarking. This method can be used by governments and large corporations. For example, in Hong Kong, primary schools are grouped into one cluster for energy benchmarking. Using the proposed method can further classify primary schools into more clusters; benchmarking index can then be developed for each cluster.

Dynamic multiaircraft cooperative suppression interference array (MACSIA) optimization problem is a typical dynamic multiobjective optimization problem. In this paper, the sum of the distance between each jamming aircraft and the enemy air defense radar network center and the minimum width of the safety area for route planning are taken as the objective functions. The dynamic changes in the battlefield environment are reduced to two cases. One is that the location of the enemy air defense radar is mobile, but the number remains the same. The other is that the number of the enemy air defense radars is variable, but the original location remains unchanged. Thus, two dynamic multiobjective optimization models of dynamic MACSIA are constructed. The dynamic multiobjective particle swarm optimization algorithm is used to solve the two models, respectively. The optimal dynamic MACSIA schemes which satisfy the limitation of the given suppression interference effect and ensure the safety of the jamming aircraft themselves are obtained by simulation experiments. And then verify the correctness of the constructed dynamic multiobjective optimization model, as well as the feasibility and effectiveness of the dynamic multiobjective particle swarm optimization algorithm in solving dynamic MACSIA problem.

There is a growing concern that business enterprises focus primarily on their economic activities and ignore the impact of these activities on the environment and the society. This paper investigates a novel sustainable inventory-allocation planning model with carbon emissions and defective item disposal over multiple periods under a fuzzy random environment. In this paper, a carbon credit price and a carbon cap are proposed to demonstrate the effect of carbon emissions’ costs on the inventory-allocation network costs. The percentage of poor quality products from manufacturers that need to be rejected is assumed to be fuzzy random. Because of the complexity of the model, dynamic programming-based particle swarm optimization with multiple social learning structures, a DP-based GLNPSO, and a fuzzy random simulation are proposed to solve the model. A case is then given to demonstrate the efficiency and effectiveness of the proposed model and the DP-based GLNPSO algorithm. The results found that total costs across the inventory-allocation network varied with changes in the carbon cap and that carbon emissions’ reductions could be utilized to gain greater profits.

Identification of SNP-SNP interaction for chronic dialysis patients

In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.

The purpose of this paper is to study the conceptual design and optimization of a compound coaxial helicopter. At the conceptual design phase, the compound coaxial helicopter design work was based on the conventional helicopter and fix-wing aircraft design method. The intersection of these aspects makes the design work more complex, thus, a program for the sizing and performance optimization was developed for the aircraft. The program included the total weight design, aerodynamic analysis, flight dynamics analysis, performance calculation and particle swarm optimization analysis. Under the restricted condition of the flight performance requirements, optimize the design parameters which make the weight efficiency factor decrease. Therefore, the study of optimum design process was warranted.

In this paper, the dynamic niching particle swarm optimization (DNPSO) is proposed to solve linear blind source separation problem. The key point is to use the DNPSO rather than particle swarm optimization (PSO) and fast-ICA as the optimization algorithm in Independent Component Analysis (ICA). By using DNPSO, which has global superiority, the performance of ICA will be improved in accuracy and convergence rate. The idea of sub-population in DNPSO leads to the greater efficiency compared with other methods when solving high dimensional cost functions in ICA. The performance of ICA based on DNPSO is investigated by numerical experiments.

In recent years, many nature inspired algorithms have been proposed which are widely applicable for different optimisation problems. Real-world optimisation problems have become more complex and dynamic in nature and a single optimisation algorithm is not good enough to solve such type of problems individually. Thus hybridisation of two or more algorithms may be a fruitful effort in handling the limitations of individual algorithm. In this paper a hybrid optimisation algorithm has been established which includes the features of environmental adaption method for dynamic (EAMD) environment and particle swarm optimisation (PSO). This algorithm is specially designed to optimise both unimodal and multimodal problems and the performance is checked over a group of 24 benchmark functions provided by black box optimisation benchmarking (BBOB-2013). The result shows the superiority of this hybrid algorithm over other well established state-of-the-art algorithms.

Construction project managers require many different kinds of ready-mixed concrete. In this paper, a materials purchasing optimisation model is established for ready-mixed concrete in construction projects. The proposed model can determine the optimal balance between different objectives and takes account of the complex dynamics and uncertainties in the decision-making process. Further, materials recycling and carbon emissions can also be considered as part of the materials supply planning. We also show the feasible constraints that the managers may have a finite preference for some resource limitation. Then, a dynamic programming-based particle swarm optimisation is developed to determine the optimal solutions to the material purchasing problem. The operational performance of the proposed quantitative method is tested using data from a Chinese hydropower construction project in which it is shown that human uncertainty can be a significant factor in the purchasing problem that materials purchasing quantities are significantly influenced by recycling and that including recycling in the purchasing problem can not only save money but also reduce pollution.

Series hybrid electric vehicles improvements in fuel consumption and emissions directly depend on the operating point of the auxiliary power unit (APU). A new APU operating point optimization approach based on dynamic combined cost map (DCM) and particle swarm optimization (PSO) is presented in this paper. The influence of coolant temperature, catalyst temperature, and air/fuel (A/F) ratio on fuel consumption characteristics and HC, CO, NOx emission characteristics are quantitatively analyzed first. Then, the DCM is derived by combining the individual cost maps with predefined weighting factors, so as to balance the potentially conflicting goals of fuel consumption and emissions reduction in the choice of operating point. The PSO is utilized to search the optimum APU operating point in the DCM. Finally, bench experiments under three typical driving cycles show that, compared with the results of the traditional static steady-state fuel consumption map-based APU operating point optimization approach, the proposed DCM and PSO-based approach shows significant improvements in emission performance, at the expense of a slight drop in fuel efficiency.