A Proposed Feature Selection Particle Swarm Optimization Adaptation for Intelligent Logistics--A Supply Chain Backlog Elimination Framework

The diversity of data sources resulted in seeking effective manipulation and dissemination.The challenge that arises from the increasing dimensionality has a negative effect on the computation performance,efficiency,and stability of computing.One of the most successful optimization algorithms is Particle Swarm Optimization(PSO)which has proved its effectiveness in exploring the highest influencing features in the search space based on its fast convergence and the ability to utilize a small set of parameters in the search task.This research proposes an effective enhancement of PSO that tackles the challenge of randomness search which directly enhances PSO performance.On the other hand,this research proposes a generic intelligent framework for early prediction of orders delay and eliminate orders backlogs which could be considered as an efficient potential solution for raising the supply chain performance.The proposed adapted algorithm has been applied to a supply chain dataset which minimized the features set from twenty-one features to ten significant features.To confirm the proposed algorithm results,the updated data has been examined by eight of the well-known classification algorithms which reached a minimum accuracy percentage equal to 94.3%for random forest and a maximum of 99.0 for Naïve Bayes.Moreover,the proposed algorithm adaptation has been compared with other proposed adaptations of PSO from the literature over different datasets.The proposed PSO adaptation reached a higher accuracy compared with the literature ranging from 97.8 to 99.36 which also proved the advancement of the current research.

Fitness Sharing Chaotic Particle Swarm Optimization (FSCPSO): A Metaheuristic Approach for Allocating Dynamic Virtual Machine (VM) in Fog Computing Architecture

In recent decades,fog computing has played a vital role in executing parallel computational tasks,specifically,scientific workflow tasks.In cloud data centers,fog computing takes more time to run workflow applications.Therefore,it is essential to develop effective models for Virtual Machine(VM)allocation and task scheduling in fog computing environments.Effective task scheduling,VM migration,and allocation,altogether optimize the use of computational resources across different fog nodes.This process ensures that the tasks are executed with minimal energy consumption,which reduces the chances of resource bottlenecks.In this manuscript,the proposed framework comprises two phases:(i)effective task scheduling using a fractional selectivity approach and(ii)VM allocation by proposing an algorithm by the name of Fitness Sharing Chaotic Particle Swarm Optimization(FSCPSO).The proposed FSCPSO algorithm integrates the concepts of chaos theory and fitness sharing that effectively balance both global exploration and local exploitation.This balance enables the use of a wide range of solutions that leads to minimal total cost and makespan,in comparison to other traditional optimization algorithms.The FSCPSO algorithm’s performance is analyzed using six evaluation measures namely,Load Balancing Level(LBL),Average Resource Utilization(ARU),total cost,makespan,energy consumption,and response time.In relation to the conventional optimization algorithms,the FSCPSO algorithm achieves a higher LBL of 39.12%,ARU of 58.15%,a minimal total cost of 1175,and a makespan of 85.87 ms,particularly when evaluated for 50 tasks.

Improved Particle Swarm Optimization for Parameter Identification of Permanent Magnet Synchronous Motor

In the process of identifying parameters for a permanent magnet synchronous motor,the particle swarm optimization method is prone to being stuck in local optima in the later stages of iteration,resulting in low parameter accuracy.This work proposes a fuzzy particle swarm optimization approach based on the transformation function and the filled function.This approach addresses the topic of particle swarmoptimization in parameter identification from two perspectives.Firstly,the algorithm uses a transformation function to change the form of the fitness function without changing the position of the extreme point of the fitness function,making the extreme point of the fitness function more prominent and improving the algorithm’s search ability while reducing the algorithm’s computational burden.Secondly,on the basis of themulti-loop fuzzy control systembased onmultiplemembership functions,it is merged with the filled function to improve the algorithm’s capacity to skip out of the local optimal solution.This approach can be used to identify the parameters of permanent magnet synchronous motors by sampling only the stator current,voltage,and speed data.The simulation results show that the method can effectively identify the electrical parameters of a permanent magnet synchronous motor,and it has superior global convergence performance and robustness.

Angular insensitive nonreciprocal ultrawide band absorption in plasma-embedded photonic crystals designed with improved particle swarm optimization algorithm

Using an improved particle swarm optimization algorithm(IPSO)to drive a transfer matrix method,a nonreciprocal absorber with an ultrawide absorption bandwidth and angular insensitivity is realized in plasma-embedded photonic crystals arranged in a structure composed of periodic and quasi-periodic sequences on a normalized scale.The effective dielectric function,which determines the absorption of the plasma,is subject to the basic parameters of the plasma,causing the absorption of the proposed absorber to be easily modulated by these parameters.Compared with other quasi-periodic sequences,the Octonacci sequence is superior both in relative bandwidth and absolute bandwidth.Under further optimization using IPSO with 14 parameters set to be optimized,the absorption characteristics of the proposed structure with different numbers of layers of the smallest structure unit N are shown and discussed.IPSO is also used to address angular insensitive nonreciprocal ultrawide bandwidth absorption,and the optimized result shows excellent unidirectional absorbability and angular insensitivity of the proposed structure.The impacts of the sequence number of quasi-periodic sequence M and collision frequency of plasma1ν1 to absorption in the angle domain and frequency domain are investigated.Additionally,the impedance match theory and the interference field theory are introduced to express the findings of the algorithm.

Neural network hyperparameter optimization based on improved particle swarm optimization

Hyperparameter optimization is considered as one of the most challenges in deep learning and dominates the precision of model in a certain.Recent proposals tried to solve this issue through the particle swarm optimization(PSO),but its native defect may result in the local optima trapped and convergence difficulty.In this paper,the genetic operations are introduced to the PSO,which makes the best hyperparameter combination scheme for specific network architecture be located easier.Spe-cifically,to prevent the troubles caused by the different data types and value scopes,a mixed coding method is used to ensure the effectiveness of particles.Moreover,the crossover and mutation opera-tions are added to the process of particles updating,to increase the diversity of particles and avoid local optima in searching.Verified with three benchmark datasets,MNIST,Fashion-MNIST,and CIFAR10,it is demonstrated that the proposed scheme can achieve accuracies of 99.58%,93.39%,and 78.96%,respectively,improving the accuracy by about 0.1%,0.5%,and 2%,respectively,compared with that of the PSO.

Blending Scheduling under Uncertainty Based on Particle Swarm Optimization Algorithm

Blending is an important unit operation in process industry. Blending scheduling is nonlinear optimiza- tion problem with constraints. It is difficult to obtain optimum solution by other general optimization methods. Particle swarm optimization (PSO) algorithm is developed for nonlinear optimization problems with both contin- uous and discrete variables. In order to obtain a global optimum solution quickly, PSO algorithm is applied to solve the problem of blending scheduling under uncertainty. The calculation results based on an example of gasoline blending agree satisfactory with the ideal values, which illustrates that the PSO algorithm is valid and effective in solving the blending scheduling problem.

An Improved Particle Swarm Optimization Algorithm with Harmony Strategy for the Location of Critical Slip Surface of Slopes

The determination of optimal values for three parameters required in the original particle swarm optimization algorithm is very difficult. It is proposed that two new parameters simulating the harmony search strategy can be adopted instead of the three parameters which are required in the original particle swarm optimization algorithm to update the positions of all the particles. The improved particle swarm optimization is used in the location of the critical slip surface of soil slope, and it is found that the improved particle swarm optimization algorithm is insensitive to the two parameters while the original particle swarm optimization algorithm can be sensitive to its three parameters.

Seepage safety monitoring model for an earth rock dam under influence of high-impact typhoons based on particle swarm optimization algorithm

Extreme hydrological events induced by typhoons in reservoir areas have presented severe challenges to the safe operation of hydraulic structures. Based on analysis of the seepage characteristics of an earth rock dam, a novel seepage safety monitoring model was constructed in this study. The nonlinear influence processes of the antecedent reservoir water level and rainfall were assumed to follow normal distributions. The particle swarm optimization （PSO） algorithm was used to optimize the model parameters so as to raise the fitting accuracy. In addition, a mutation factor was introduced to simulate the sudden increase in the piezometric level induced by short-duration heavy rainfall and the possible historical extreme reservoir water level during a typhoon. In order to verify the efficacy of this model, the earth rock dam of the Siminghu Reservoir was used as an example. The piezometric level at the SW1-2 measuring point during Typhoon Fitow in 2013 was fitted with the present model, and a corresponding theoretical expression was established. Comparison of fitting results of the piezometric level obtained from the present statistical model and traditional statistical model with monitored values during the typhoon shows that the present model has a higher fitting accuracy and can simulate the uprush feature of the seepage pressure during the typhoon perfectly.

Power optimization of gas pipelines via an improved particle swarm optimization algorithm

In past decades dynamic programming, genetic algorithms, ant colony optimization algorithms and some gradient algorithms have been applied to power optimization of gas pipelines. In this paper a power optimization model for gas pipelines is developed and an improved particle swarm optimization algorithm is applied. Based on the testing of the parameters involved in the algorithm which need to be defined artificially, the values of these parameters have been recommended which can make the algorithm reach efficiently the approximate optimum solution with required accuracy. Some examples have shown that the relative error of the particle swarm optimization over ant colony optimization and dynamic programming is less than 1% and the computation time is much less than that of ant colony optimization and dynamic programming.

Shaping the Wavefront of Incident Light with a Strong Robustness Particle Swarm Optimization Algorithm

We demonstrate a modified particle swarm optimization(PSO) algorithm to effectively shape the incident light with strong robustness and short optimization time. The performance of the modified PSO algorithm and genetic algorithm(GA) is numerically simulated. Then, using a high speed digital micromirror device, we carry out light focusing experiments with the modified PSO algorithm and GA. The experimental results show that the modified PSO algorithm has greater robustness and faster convergence speed than GA. This modified PSO algorithm has great application prospects in optical focusing and imaging inside in vivo biological tissue, which possesses a complicated background.

Path Planning of Continuum Robot Based on a New Improved Particle Swarm Optimization Algorithm

Continuum robot is a new type of biomimetic robot,which realizes the motion by bending some parts of its body.So its path planning becomes more difficult even compared with hyper-redundant robots.In this paper a circular arc spline interpolating method is proposed for the robot shape description,and a new two-stage position-selectable-updating particle swarm optimization(TPPSO)algorithm is put forward to solve this path planning problem.The algorithm decomposes the standard PSO velocity’s single-step updating formula into twostage multi-point updating,specifically adopting three points as candidates and selecting the best one as the updated position in the first half stage,and similarly taking seven points as candidates and selecting the best one as the final position in the last half stage.This scheme refines and widens each particle’s searching trajectory,increases the updating speed of the individual best,and improves the converging speed and precision.Aiming at the optimization objective to minimize the sum of all the motion displacements of every segmental points and all the axial stretching or contracting displacements of every segment,the TPPSO algorithm is used to solve the path planning problem.The detailed solution procedure is presented.Numerical examples of five path planning cases show that the proposed algorithm is simple,robust,and efficient.

An extended particle swarm optimization algorithm based on coarse-grained and fine-grained criteria and its application

In order to study the problem that particle swarm optimization (PSO) algorithm can easily trap into local mechanism when analyzing the high dimensional complex optimization problems, the optimization calculation using the information in the iterative process of more particles was analyzed and the optimal system of particle swarm algorithm was improved. The extended particle swarm optimization algorithm (EPSO) was proposed. The coarse-grained and fine-grained criteria that can control the selection were given to ensure the convergence of the algorithm. The two criteria considered the parameter selection mechanism under the situation of random probability. By adopting MATLAB7.1, the extended particle swarm optimization algorithm was demonstrated in the resource leveling of power project scheduling. EPSO was compared with genetic algorithm (GA) and common PSO, the result indicates that the variance of the objective function of resource leveling is decreased by 7.9%, 18.2%, respectively, certifying the effectiveness and stronger global convergence ability of the EPSO.

DOA and Power Estimation Using Genetic Algorithm and Fuzzy Discrete Particle Swarm Optimization

Aiming to reduce the computational costs and converge to global optimum, a novel method is proposed to solve the optimization of a cost function in the estimation of direction of arrival （DOA）. In this method, a genetic algorithm （GA） and fuzzy discrete particle swarm optimization （FDPSO） are applied to optimize the direction of arrival and power parameters of the mode simultaneously. Firstly, the GA algorithm is applied to make the solution fall into the global searching. Secondly, the FDPSO method is utilized to narrow down the search field. In FDPSO, a chaotic factor and a crossover method are added to speed up the convergence. This approach has been demonstrated through some computational simulations. It is shown that the proposed algorithm can estimate both the DOA and the powers accurately. It is more efficient than some present methods, such as the Newton-like algorithm, Akaike information critical （AIC）, particle swarm optimization （PSO）, and genetic algorithm with particle swarm optimization （GA-PSO）.

Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm

An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.

Improved wavelet neural network combined with particle swarm optimization algorithm and its application

An improved wavelet neural network algorithm which combines with particle swarm optimization was proposed to avoid encountering the curse of dimensionality and overcome the shortage in the responding speed and learning ability brought about by the traditional models. Based on the operational data provided by a regional power grid in the south of China, the method was used in the actual short term load forecasting. The results show that the average time cost of the proposed method in the experiment process is reduced by 12.2 s, and the precision of the proposed method is increased by 3.43% compared to the traditional wavelet network. Consequently, the improved wavelet neural network forecasting model is better than the traditional wavelet neural network forecasting model in both forecasting effect and network function.

Research on a Distribution Center Location Model Based on a Particle Swarm Optimization Algorithm

Logistics is supposed to be the important source of profits for the enterprises besides reducing material consumption and improving labor productivity. Transportation costs, distribution center construction costs, ordering costs, safe inventory costs and inventory holding costs are the important parts of the total logistics costs. In this paper, based on the research results of LMRP（ location model of risk pooling） location with fixed construction cost, the LMRPVCC （ location model of risk pooling based on variable construction cost） will be introduced. Applying particle swarm optimization to several computational instances, the authors find the suboptimum solution of the model.

Optimal Energy Consumption Optimization in a Smart House by Considering Electric Vehicles and Demand Response via a Hybrid Gravitational Search and Particle Swarm Optimization Algorithm

Buildings are the main energy consumers across the world,especially in urban communities.Building smartization,or the smartification of housing,therefore,is a major step towards energy grid smartization too.By controlling the energy consumption of lighting,heating,and cooling systems,energy consumption can be optimized.All or some part of the energy consumed in future smart buildings must be supplied by renewable energy sources(RES),which mitigates environmental impacts and reduces peak demand for electrical energy.In this paper,a new optimization algorithm is applied to solve the optimal energy consumption problem by considering the electric vehicles and demand response in smart homes.In this way,large power stations that work with fossil fuels will no longer be developed.The current study modeled and evaluated the performance of a smart house in the presence of electric vehicles(EVs)with bidirectional power exchangeability with the power grid,an energy storage system(ESS),and solar panels.Additionally,the solar RES and ESS for predicting solar-generated power prediction uncertainty have been considered in this work.Different case studies,including the sales of electrical energy resulting from PV panels’generated power to the power grid,time-variable loads such as washing machines,and different demand response(DR)strategies based on energy price variations were taken into account to assess the economic and technical effects of EVs,BESS,and solar panels.The proposed model was simulated in MATLAB.A hybrid particle swarm optimization(PSO)and gravitational search(GS)algorithm were utilized for optimization.Scenario generation and reduction were performed via LHS and backward methods,respectively.Obtained results demonstrate that the proposed model minimizes the energy supply cost by considering the stochastic time of use(STOU)loads,EV,ESS,and PV system.Based on the results,the proposed model markedly reduced the electricity costs of the smart house.

Simulating Particle Swarm Optimization Algorithm to Estimate Likelihood Function of ARMA（1, 1） Model

This paper present a simulation study of an evolutionary algorithms, Particle Swarm Optimization PSO algorithm to optimize likelihood function of ARMA（1, 1） model, where maximizing likelihood function is equivalent to maximizing its logarithm, so the objective function ＇obj.fun＇ is maximizing log-likelihood function. Monte Carlo method adapted for implementing and designing the experiments of this simulation. This study including a comparison among three versions of PSO algorithm “Constriction coefficient CCPSO, Inertia weight IWPSO, and Fully Informed FIPSO”, the experiments designed by setting different values of model parameters al, bs sample size n, moreover the parameters of PSO algorithms. MSE used as test statistic to measure the efficiency PSO to estimate model. The results show the ability of PSO to estimate ARMA＇ s parameters, and the minimum values of MSE getting for COPSO.

Gridless Net Routing of Integrate Circuit with Particle Swarm Optimization Algorithm

Particle swarm optimization algorithm is presented for the layout of ＂Integrate Circuit （IC）＂ design. Particle swarm optimization based on swarm intelligence is a new evolutionary computational tool and is successfully applied in function optimization, neural network design, classification, pattern recognition, signal processing and robot technology and so on. A modified algorithm is presented and applied to the layout of IC design. For a given layout plane, first of all, this algorithm generates the corresponding grid group by barriers and nets＇ ports with the thought ofgridless net routing, establishes initialization fuzzy matrix, then utilizes the global optimization character to find out the best layout route only if it exits. The results of model simulation indicate that PSO algorithm is feasible and efficient in IC layout design.

Modified particle swarm optimization-based antenna tilt angle adjusting scheme for LTE coverage optimization

In order to solve the challenging coverage problem that the long term evolution（ LTE） networks are facing, a coverage optimization scheme by adjusting the antenna tilt angle（ ATA） of evolved Node B（ e NB） is proposed based on the modified particle swarm optimization（ MPSO） algorithm.The number of mobile stations（ MSs） served by e NBs, which is obtained based on the reference signal received power（RSRP） measured from the MS, is used as the metric for coverage optimization, and the coverage problem is optimized by maximizing the number of served MSs. In the MPSO algorithm, a swarm of particles known as the set of ATAs is available; the fitness function is defined as the total number of the served MSs; and the evolution velocity corresponds to the ATAs adjustment scale for each iteration cycle. Simulation results showthat compared with the fixed ATA, the number of served MSs by e NBs is significantly increased by 7. 2%, the quality of the received signal is considerably improved by 20 d Bm, and, particularly, the system throughput is also effectively increased by 55 Mbit / s.