Remanufacturing closed-loop supply chain network design based on genetic particle swarm optimization algorithm

As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of closed-loop supply chain was selected as fitness function, and a unique and tidy coding mode was adopted in the proposed algorithm. Then, some mutation and crossover operators were introduced to achieve discrete optimization of RCSCN structure. The simulation results show that the proposed algorithm can gain global optimal solution with good convergent performance and rapidity. The computing speed is only 22.16 s, which is shorter than those of the other optimization algorithms.

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）.

Dynamic neighborhood genetic learning particle swarm optimization for high-power-density electric propulsion motor

To maximize the power density of the electric propulsion motor in aerospace application,this paper proposes a novel Dynamic Neighborhood Genetic Learning Particle Swarm Optimization(DNGL-PSO)for the motor design,which can deal with the insufficient population diversity and non-global optimal solution issues.The DNGL-PSO framework is composed of the dynamic neighborhood module and the particle update module.To improve the population diversity,the dynamic neighborhood strategy is first proposed,which combines the local neighborhood exemplar generation mechanism and the shuffling mechanism.The local neighborhood exemplar generation mechanism enlarges the search range of the algorithm in the solution space,thus obtaining highquality exemplars.Meanwhile,when the global optimal solution cannot update its fitness value,the shuffling mechanism module is triggered to dynamically change the local neighborhood members.The roulette wheel selection operator is introduced into the shuffling mechanism to ensure that particles with larger fitness value are selected with a higher probability and remain in the local neighborhood.Then,the global learning based particle update approach is proposed,which can achieve a good balance between the expansion of the search range in the early stage and the acceleration of local convergence in the later stage.Finally,the optimization design of the electric propulsion motor is conducted to verify the effectiveness of the proposed DNGL-PSO.The simulation results show that the proposed DNGL-PSO has excellent adaptability,optimization efficiency and global optimization capability,while the optimized electric propulsion motor has a high power density of 5.207 kW/kg with the efficiency of 96.12%.

Resource Allocation Algorithm Based on PSO-GA for Multi-User OFDM System

In order to minimize the transmitted power in the multi-user orthogonal frequency division multiplexing（OFDM） system, a scheme combining the improved particle swarm optimization（POS） algorithm with genetic algorithm（GA） is proposed to optimize the sub-carriers and bits allocation. In the algorithm, a random velocity between the maximum and minimum particle velocity is used as the updating velocity instead of maximum or minimum velocity when the updated particle velocity is higher than the maximum particle velocity or lower than the minimum particle velocity. Then, the convergence population is used as the initial population of the genetic algorithm to optimize the subcarriers and bits allocation further. Simulation results show that the transmitted power of the proposed algorithm is about 2 d B to 10 d B lower than that of the genetic algorithm, particle swarm optimization algorithm, and Zhang＇s algorithm.

Location layout design of aircraft parts assembly based on MSVR

Location layout of aircraft assembly is an important factor affecting product quality.Most of the existing re-searches use the combination of finite element analysis and intelligent algorithm to optimize the location layout,which are limited by numerical simulation accuracy and the selection and improvement of intelligent algorithms.At present,the analysis and decision-making technology based on field data is gradually applied in aircraft manufacturing.Based on the perception data of intelligent assembly unit of aircraft parts,a regression model of multi-input and multioutput support vector machine with Gauss kernel function as radial basis function is established,and the hyperparameters of the model are optimized by hybrid particle swarm optimization genetic algorithm(PSO-GA).GA-MSVR,PSO-MSVR and PSOGA-MSVR model are constructed respectively,and their results show that PSOGA-MSVR model has the best performance.Finally,the design of the aircraft wing location layout is taken as an example to verify the effectiveness of the method.

Fault self-repair strategy based on evolvable hardware and reparation balance technology

In the face of harsh natural environment applications such as earth-orbiting and deep space satellites, underwater sea vehicles, strong electromagnetic interference and temperature stress,the circuits faults appear easily. Circuit faults will inevitably lead to serious losses of availability or impeded mission success without self-repair over the mission duration. Traditional fault-repair methods based on redundant fault-tolerant technique are straightforward to implement, yet their area, power and weight cost can be excessive. Moreover they utilize all plug-in or component level circuits to realize redundant backup, such that their applicability is limited. Hence, a novel selfrepair technology based on evolvable hardware（EHW） and reparation balance technology（RBT） is proposed. Its cost is low, and fault self-repair of various circuits and devices can be realized through dynamic configuration. Making full use of the fault signals, correcting circuit can be found through EHW technique to realize the balance and compensation of the fault output-signals. In this paper, the self-repair model was analyzed which based on EHW and RBT technique, the specific self-repair strategy was studied, the corresponding self-repair circuit fault system was designed, and the typical faults were simulated and analyzed which combined with the actual electronic devices. Simulation results demonstrated that the proposed fault self-repair strategy was feasible. Compared to traditional techniques, fault self-repair based on EHW consumes fewer hardware resources, and the scope of fault self-repair was expanded significantly.

A novel strategy for automatic test data generation using soft computing technique

Software testing is one of the most crucial and analytical aspect to assure that developed software meets pre- scribed quality standards. Software development process in- vests at least 50% of the total cost in software testing process. Optimum and efficacious test data design of software is an important and challenging activity due to the nonlinear struc- ture of software. Moreover, test case type and scope deter- mines the quality of test data. To address this issue, software testing tools should employ intelligence based soft comput- ing techniques like particle swarm optimization （PSO） and genetic algorithm （GA） to generate smart and efficient test data automatically. This paper presents a hybrid PSO and GA based heuristic for automatic generation of test suites. In this paper, we described the design and implementation of the proposed strategy and evaluated our model by performing ex- periments with ten container classes from the Java standard library. We analyzed our algorithm statistically with test ad- equacy criterion as branch coverage. The performance ade- quacy criterion is taken as percentage coverage per unit time and percentage of faults detected by the generated test data. We have compared our work with the heuristic based upon GA, PSO, existing hybrid strategies based on GA and PSO and memetic algorithm. The results showed that the test case generation is efficient in our work.