Performance Comparison of Particle Swarm Optimization and Genetic Algorithm Combined with A* Search for Solving Facility Layout Problem

In this paper, an improved approach integrating genetic algorithm and adaptive particle swarm optimization with feed forward neural networks for image compression is proposed. The hybrid genetic algorithm with a novel mutation strategy and particle swarm optimization is used to train the neural network to near global optimum weights and thresholds at first. Then the network is trained with gradient descending learning algorithm to obtain the optimal network parameters. Then, the trained network is applied to the image compression. Results show that at the same compression rate the application of optimized neural network in image compression will achieve better image quality compared with the application of traditional neural network.

This paper studies the two-stage assembly flow shop problem (TAFSP) considering aging effects of the machines and preventive maintenance activities. At the first stage, m-1 parallel machines process parts of each jobs, and at the second stage, related parts of the jobs are assembled by one assembly machine. As the machines work on the jobs, their tools get aged. Aging effects on the machines causes that they will not be able to complete the jobs in the same time could as they were new or when they are operating jobs immediately after their preventive maintenance activity. Processing times of the job are related to the positions, in which it is located after the last preventive maintenance. The job that is operated in a position immediately after the preventive maintenance activity on a machine has its standard processing time. However, the processing time of the jobs operated in the further positions increase based on the number of the positions. The machines return to the initial condition after each preventive maintenance activity. The objective is to schedule the jobs on the machines and determine when the preventive maintenance activities get done on them in order to minimize the total weighted tardiness and maintenance costs. An integer mathematical model is presented for the problem and its validation is shown by solving an example in small scale. Since two-stage assembly flow shop problem is NP-hard, in order to solve the problem in medium and large scale two meta-heuristic algorithms, hybrid genetic algorithm (HGA) and hybrid particle swarm optimization (HPSO) are proposed. These algorithms are the hybrid version of genetic algorithm and particle swarm optimization representatively with simulated annealing. The algorithms are tuned by using Taguchi method, and are used to solve many numerical examples. Finally, the statistical analysis illustrates that the performance of HPSO is better than HGA.

The design of Finite Impulse Response (FIR) digital filter involves multi-parameter optimization, while the traditional gradient-based methods are not effective enough for precise design. The aim of this paper is to present a method of designing 24th order high pass FIR filter using an evolutionary heuristic search technique called Weight Improved Particle Swarm Optimization (WIPSO). A new function of the weight parameters is constructed for obtaining a better optimal solution with faster computation. The performance of the proposed algorithm is compared with two other search optimization algorithms namely standard Genetic Algorithm (GA) and conventional Particle Swarm Optimization (PSO). The simulation results show that the proposed WIPSO algorithm is better than GA and PSO in terms of the magnitude response accuracy and the convergence speed for the design of 24th order high pass FIR filter.

Cloud computing provides the computational machines as a support of the clients utilizing cloud organize. In cloud computing, the user inputs are executed with required machines to convey the administrations. Numerous task scheduling methods are utilized to plan the client tasks to the machines. In this paper, another successful hybrid task scheduling is proposed to minimize the total execution time using Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) algorithms. In hybrid Genetic Algorithm - Particle Swarm Optimization (GA-PSO) algorithm, PSO helped GA to obtain better results compare to a standard genetic algorithm, Min-Min, and Max-Min algorithms results.

A study on the development of a microwave tomography imaging algorithm for detecting the malignant tumor in the breast is presented. Tomography modality is based on the electromagnetic reflections generated by the dielectric contrast between breast tissue types at microwave frequencies. In the tomography method, finite difference time domain method (FDTD) has been used as a technique for calculating electromagnetic scattered fields. In this paper, we propose a novel hybrid optimization technique for solving the inverse scattering problem which uses the binary Genetic algorithm (BGA) and binary particle swarm optimization (BPSO). The convergence rate of this proposed algorithm is around 4 times better than the regular BGA. The proposed FDTD/hybrid BGA-BPSO method has the ability to reconstruct the heterogeneous and dispersive breast tissues to provide a quantitative image of permittivity and conductivity profile of the breast. The proposed technique is capable to detect the size, location and permittivity and conductivity of the tumor even though it is surrounded by benign and fibroglandular tissues.

ABSTRACTThis article introduces a method of mistuned parameter identification which consists of static frequency testing of blades, dichotomy and finite element analysis. A lumped parameter model of an engine bladed-disc system is then set up. A bladed arrangement optimization method, namely the genetic particle swarm optimization algorithm, is presented. It consists of a discrete particle swarm optimization and a genetic algorithm. From this, the local and global search ability is introduced. CUDA-based co-evolution particle swarm optimization, using a graphics processing unit, is presented and its performance is analysed. The results show that using optimization results can reduce the amplitude and localization of the forced vibration response of a bladed-disc system, while optimization based on the CUDA framework can improve the computing speed. This method could provide support for engineering applications in terms of effectiveness and efficiency.

Evolutionary Algorithms are good optimizing agents that use the evolutionary concepts to evolve systems. The complex fitness landscapes are a problem that restricts the performance of these algorithms. Besides specifying the correct parameter is always very important. In this chapter we study the means by which we can execute a number of evolutionary algorithms in a variety of models to give an overall optimal performance to the entire network. We first discuss the Island Model Algorithm where the individuals are evolved in multiple islands with regular interaction. We then study a related algorithm called the Hierarchical Fair Competition algorithm. Here we would separate the various individuals into classes as per their fitness values. Each of these would have a separate evolution. We would then discuss the Nested Evolutionary Strategies where we fix the parameters of an Evolutionary Strategy by some technique. Towards the end we discuss the Hybrid Genetic Algorithm Particle Swarm Optimization. This algorithm generates individuals by twin usage of Genetic Algorithm and Particle Swarm Optimization.

The complexity of embedded system design increase as the technology keeps evolving from day to day. Hardware software partitioning has been a promising approach to solve this design problem of complexity in the embedded systems, by providing a solution that automatically decides the partitioning. A lot of research has been done to automate the partitioning which focusing on exact and heuristic algorithm. Then due to the slow performance of the exact algorithms, the study focus shift to heuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). In this research the performance of both PSO algorithm and GA are analyzed in the application of the partitioning. In order to get the best among these two algorithms, hybrid combination across the two algorithms is designed. The best cost and their average time to achieve it are compared among PSO, GA and hybrid design. As a result, the graph obtained from the hybrid GA-GA-PSO required a smaller number of iterations to reach best cost. Compared to previous work, GA-GA-PSO obtained a smooth as the successive PSO graph. In conclusion, a new idea of hybrid across PSO and GA has been introduced and it results into a better solution for Hardware Software Partitioning.

In this paper, we propose five data fusion schemes for the Internet of Things (IoT) scenario,which are Relief and Perceptron (Re-P), Relief and Genetic Algorithm Particle Swarm Optimization (Re-GAPSO), Genetic Algorithm and Artificial Neural Network (GA-ANN), Rough and Perceptron (Ro-P)and Rough and GAPSO (Ro-GAPSO). All the schemes consist of four stages, including preprocessingthe data set based on curve fitting, reducing the data dimension and identifying the most effective featuresets according to data correlation, training classification algorithms, and finally predicting new databased on classification algorithms. The results derived from five compound schemes are investigated andcompared with each other with three metrics, namely, Quality of Train (QoT) Accuracy (Ac) and StorageCapacity (SC). While the Re-P scheme is only capable of separating classes that are linearly separable,Re-GAPSO one is a dynamic method, appropriate for constantly changing problems of the real life. Onthe other hand, GA-ANN is a Wrapper method and despite Relief can adapt itself to the machine learningalgorithm. Meanwhile, Ro-P scheme is useful for analyzing vague and imprecise information and, unlikeGA-ANN, has less calculative costs. Among these five schemes, Ro-GAPSO is a more precise one, whichhas less calculative cost and does not become stuck in local minima. Experimental results show that Re-Poutperforms other proposed and existing methods in terms of computational time complexity.

The objective of the research work is to examine energy-efficient routing in wireless sensor networks for moving nodes by contrasting new evolutionary algorithms with the Particle Swarm Optimization (PSO) Algorithm. Comparative analysis of energy efficient routing is performed by a novel genetic algorithm where there are several samples (N = 10) and a PSO algorithm where there are several samples (N = 10) techniques with pre-test power of 80% using NS2. When routing wireless sensor networks with moving nodes, Various metrics, including delay, energy use, and packet delivery ratio, are used to compare PSO and genetic algorithms. The evolutionary algorithm outperforms the PSO algorithm in these ways in terms of packet delivery ratio, energy usage, and delay. (p < 0.05) indicates a statistically significant difference. The research's findings comprised the three metrics of delay, energy consumption and packet delivery ratio. The method shows that the novel Genetic algorithm outperforms the PSO algorithm for wireless sensor network energy-efficient routing for moving nodes by identifying a set of routes that can satisfy the delay restrictions.KeywordsNovel genetic algorithmParticle Swarm Optimization (PSO)Wireless sensor networkDelayEnergy consumptionPacket delivery ratio

The power amplifier (PA) is naturally nonlinear in its operation. To get good energy efficiency, the PA is needed to function at its saturation level and results in the generation of the nonlinear outputs. To counter the nonlinearization in PA, a pre-distorter is appropriately designed and introduced in front of the PA. In this paper, an innovative pre-distorter is introduced by employing adaptive genetic algorithm (AGA) and their results are compared with that of genetic algorithm (GA) and particle swarm optimization (PSO) algorithm. The Wiener model is considered to model the PA, and the pre-distorter is built up by means of Hammerstein model. The new approach simulated using MATLAB and the outputs achieved are analyzed. The pre-distortion using AGA has produced better results in terms of MSE compared to that produced using PSO and GA optimization algorithms.

Metaheuristic techniques are enormously being used nowadays for their applications in field like Power system and are being applied to many optimization problems of power system due to difficult approach of classical methods. Transmission expansion planning (TEP) is a challenging task to deal in power system. A new approach, hybrid genetic algorithm particle swarm optimization (HGAPSO) for solving TEP problem, is introduced to eliminate the drawback of GA and PSO. Problems of immature convergence in particle swarm optimization (PSO) and low convergence speed in genetic algorithm (GA) mitigate to the hybridization of both techniques. Proposed HGAPSO Algorithm is tested for three standard electric test systems for TEP problem in MATLAB tool. Experimental results found by HGAPSO are compared with GA and PSO Algorithm to test its performance for TEP problem.

In recent years, genetic algorithm (GA), particle swarm optimization (PSO) and hybrid genetic algorithm particle swarm optimization (HGAPSO) have attracted considerable attention among various modern heuristic optimization techniques. In this study the HGAPSO, PSO and GA optimization techniques are used for to search the optimal placement and sizing of static VAR compensator (SVC) in power system. The objective function is defined for reducing power loss, voltage deviation and investment costs of SVC. The effectiveness of the proposed hybrid based approach is applied and demonstrated on IEEE 30 Bus network. The results show that the proposed hybrid HGAPSO compared with PSO and GA optimization for performs and giving better solution.

An efficient method is proposed for the design of finite impulse response (FIR) filter with arbitrary pass band edge, stop band edge frequencies and transition width. The proposed FIR band stop filter is designed using craziness based particle swarm optimization (CRPSO) approach. Given the filter specifications to be realized, the CRPSO algorithm generates a set of optimal filter coefficients and tries to meet the ideal frequency response characteristics. In this paper, for the given problem, the realizations of the optimal FIR band pass filters of different orders have been performed. The simulation results have been compared with those obtained by the well accepted evolutionary algorithms, such as Parks and McClellan algorithm (PMA), genetic algorithm (GA) and classical particle swarm optimization (PSO). Several numerical design examples justify that the proposed optimal filter design approach using CRPSO outperforms PMA and PSO, not only in the accuracy of the designed filter but also in the convergence speed and solution quality.

Multicast routing is an effective way to communicate among multiple hosts in a network. For multimedia applications, the routing algorithms should consider many Quality of Service (QoS) parameters such as delay, cost and so on to find a new route. However, to find routes with two or more QoS parameters is an NP-hard problem. This paper describes a new evolutionary scheme for optimization of multicast QoS routing based on the hybrid of Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), called HGAPSO. In HGAPSO, individuals in a new generation are created, not only by crossover and mutation operation as in GA, but also by PSO. The upper-half of the best-performing individuals in a population are regarded as elites. Instead of being reproduced directly to the next generation, these elites are first enhanced. The group constituted by the elites is regarded as a swarm, and each elite corresponds to a particle within it. In this regard, the elites are enhanced by PSO, an operation which mimics the maturing phenomenon in nature. This scheme can simultaneously optimize the cost of the tree, the maximum end-to-end delay, the average delay and the maximum link utilization. In this way, a set of optimal solutions, known as Pareto set, is calculated in only one run, without a priori restrictions. It has revealed an efficient method of the reconstruction of multicast tree topology and the experimental results demonstrated better performance than the conventional GA optimization method.