Proposed Particle Swarm Optimization Algorithm Research Articles

Particle swarm optimization algorithm for analyzing SNP–SNP interaction of renin-angiotensin system genes against hypertension

Most non-significant individual single nucleotide polymorphisms (SNPs) were undiscovered in hypertension association studies. Their possible SNP-SNP interactions were usually ignored and leaded to missing heritability. In present study, we proposed a particle swarm optimization (PSO) algorithm to analyze the SNP-SNP interaction associated with hypertension. Genotype dataset of eight SNPs of renin-angiotensin system genes for 130 non-hypertension and 313 hypertension subjects were included. Without SNP-SNP interaction, most individual SNPs were non-significant difference between the hypertension and non-hypertension groups. For SNP-SNP interaction, PSO can select the SNP combinations involving different SNP numbers, namely the best SNP barcodes, to show the maximum frequency difference between non-hypertension and hypertension groups. After computation, the best PSO-generated SNP barcodes were dominant in non-hypertension in terms of the occurrences of frequency differences between non-hypertension and hypertension groups. The OR values of the best SNP barcodes involving 2-8 SNPs were 0.705-0.334, suggesting that these SNP barcodes were protective against hypertension. In conclusion, this study demonstrated that non-significant SNPs may generate the joint effect in association study. Our proposed PSO algorithm is effective to identify the best protective SNP barcodes against hypertension.

Analysis of Standard Particle Swarm Optimization Algorithm Based on Markov Chain

According to the proposed particle swarm optimization (PSO) difference model in the paper, the state sequence of a single particle and swarm state sequence are defined first, and their Markov property are analyzed, after that, it is demonstrated that the set of optimal states are closed set. Moreover, the one-step transition probability of a particle is calculated. Considering the total probability formula and the Markov properties, the transition probability of the optimal set is deduced. According to the derived conclusion, the inertia weight ω and accelerate factor c of PSO are discussed. Finally, the premature convergence and divergent problem are explained, furthermore, it is proved that the standard PSO algorithm reaches the global optimum with certain probability.

Optimization of Nosiheptide Fed-Batch Fermentation Process Based on Hybrid Model

Nosiheptide, a sulfur-containing peptide antibiotic obtained through fermentation, is a perfect feed additive, but its yield in industry is not high. Process optimization is a good way to increase nosiheptide yield, maintaining the optimum operating conditions of the fermentation process, while optimization of the process requires a sufficiently accurate and robust process model. In this paper, the mechanism model for nosiheptide fed-batch fermentation is first established. Then, in order to improve performance of the mechanism model, a hybrid model is built using least-squares support vector machines to compensate the errors between the mechanism model and the process. The hybrid model not only overcomes pure black-box model’s shortcoming that it often has poor generalization ability but improves the mechanism model’s accuracy. A yield optimization model of nosiheptide fed-batch fermentation process is then established based on the hybrid model. An improved particle swarm optimization algorithm is used to solve the optimization model, greatly improving the end nosiheptide production, which also proves the validity of the proposed particle swarm optimization algorithm.

An improved particle swarm optimization for the resource-constrained project scheduling problem

In this paper, an improved particle swarm optimization (PSO) algorithm is proposed for the resource-constrained project scheduling problem (RCPSP) which is widely applied in advanced manufacturing, production planning, and project management. The algorithm treats the solutions of RCPSP as particle swarms and employs a double justification skill and a move operator for the particles, in association with rank-priority-based representation, greedy random search, and serial scheduling scheme, to execute the intelligent updating process of the swarms to search for better solutions. The integration combines and overhauls the characteristics of both PSO and RCPSP, resulting in enhanced performance. The computational experiments are subsequently conducted to set the adequate parameters and compare the proposed algorithm with other approaches. The results suggest that the proposed PSO algorithm augments the performance by 9.26, 16.17, and 10.45 % for the J30, J60, and J120 instances against the best lower bound-based PSO currently available, respectively. Moreover, the proposed algorithms demonstrate obvious advantage over other proposals in exploring solutions for large-scale RCPSP problems such as the J60 and J120 instances.

A novel swarm optimiser for flexible flow shop scheduling

In this work, a particle swarm optimisation (PSO) algorithm with chaotic mutation operator is proposed to solve flexible flow shop scheduling problems. Mutation, a commonly used operator in genetic algorithm, has been introduced so that common problem of trapping of solutions at local minima in PSO can be avoided. Chaotic sequence using logistic mapping is used instead of random numbers to improve the diversity in solution space. The performance of schedules is evaluated in terms of total completion time or makespan (Cmax). The results are presented in terms of percentage deviation (PD) of the solution from the lower bound (LB). The results are compared with different versions of genetic algorithm (GA) used for the purpose from open literature. The results indicate that the proposed PSO algorithm is quite effective in reducing makespan because average percentage deviation is observed as 6.390 whereas GA produces an average percentage deviation of 9.657. Finally, influence of various PSO parameters on solution quality has been investigated.

A particle swarm optimization algorithm for optimal car-call allocation in elevator group control systems

High-rise buildings require the installation of complex elevator group control systems (EGCSs). In vertical transportation, when a passenger makes a hall call by pressing a landing call button installed at the floor and located near the cars of the elevator group, the EGCS must allocate one of the cars of the group to the hall call. We develop a particle swarm optimization (PSO) algorithm to deal with this car-call allocation problem. The PSO algorithm is compared to other soft computing techniques such as genetic algorithm and tabu search approaches that have been proved as efficient algorithms for this problem. The proposed PSO algorithm was tested in high-rise buildings from 10 to 24 floors, and several car configurations from 2 to 6 cars. Results from trials show that the proposed PSO algorithm results in better average journey times and computational times compared to genetic and tabu search approaches.

Evolutionary Pinning Control and Its Application in UAV Coordination

Maximizing the controllability of complex networks by selecting appropriate nodes and designing suitable control gains is an effective way to control distributed complex networks. In this paper, some novel particle swarm optimization (PSO) approaches are developed to enhance the controllability of distributed networks. The proposed PSO algorithm is combined with a global search scheme and a modified simulated binary crossover (MSBX). In addition, the node importance-based method is introduced to study the controllability of distributed complex networks. A set of experiments show that the PSO with the global search and the MSBX (PSO-GSBX) can outperform some well-known evolutionary algorithms and pinning schemes. Following the PSO-GSBX approach, some interesting findings about pinned nodes, coupling strengths and the eigenvalues for enhancing the controllability of distributed networks are revealed. The obtained results and methods are applied in unmanned aerial vehicle (UAV) coordination to show their effectiveness. These findings will help to understand controllability of complex networks and can be applied in control science and industrial system.

BNE-based concurrent transmission considering channel quality and its PSO searching strategy in Ad Hoc networks

The paper proposes a decentralized concurrent transmission strategy in shared channels based on an incomplete information game in Ad Hoc networks. Based on the nodal channel quality, the game can work out a channel gain threshold, which decides the candidates for taking part in the concurrent transmission. The utility formula is made for maximizing the overall throughput based on channel quality variation. For an achievable Bayesian Nash equilibrium (BNE) solution, this paper further prices the selfish players in utility functions for attempting to improve the channel gain one-sidedly. Accordingly, this game allows each node to distributedly decide whether to transmit concurrently with others depending on the Nash equilibrium (NE). Besides, to make the proposed game practical, this paper next presents an efficient particle swarm optimization (PSO) model to fasten the otherwise very slow convergence procedure due to the large computational complexity. Numerical results show the proposed approach is feasible to increase concurrent transmission opportunities for active nodes and the convergence can be swiftly obtained with a few of iteration times by the proposed PSO algorithm.

Adaptive PSO for online identification of time‐varying systems

AbstractNovel adaptive PSO (particle swarm optimization) algorithms called OPSO (online PSO) and ϵPSO are proposed. These algorithms are designed to prevent increasing of calculation cost in order to embed into online systems, and they have high adaptive performances to environmental changes. The efficiency of the proposed PSO algorithms are demonstrated by numerical simulation and the online identification of an actual dynamic system. © 2012 Wiley Periodicals, Inc. Electron Comm Jpn, 95(7): 10–18, 2012; Published online in Wiley Online Library (wileyonlinelibrary.com). DOI 10.1002/ecj.11391

Particle swarm optimization for scheduling batch processing machines in a permutation flowshop

Batch processing machines are capable of processing several jobs in a batch simultaneously. These machines are used in many real-life applications. This paper presents solution approaches to schedule batch processing machines arranged in a permutation flowshop in order to minimize its makespan (or completion time of the last batch). The processing time of each job on all the machines and their sizes are given. Each machine can process a batch of jobs as long as its capacity is not violated. The batch processing time is equal to the longest processing job in the batch. Since the problem under study is NP-hard, commercial mixed-integer solvers may require prohibitively long run time to solve even modest sized problems. Consequently, a particle swarm optimization (PSO) algorithm is proposed. Three heuristics to update the particle’s positions are also proposed. The effectiveness of the proposed PSO algorithm is compared with a commercial solver (which was used to solve a mathematical model) and several heuristics from the literature. The experimental study conducted indicates that the proposed PSO algorithm outperforms both the commercial solver and the heuristics in terms of solution quality. The commercial solver requires longer run times compared to PSO.

An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem

Hybrid flow shops (HFS) are common manufacturing environments in many industries, such as the glass, steel, paper and textile industries. In this paper, we present a particle swarm optimization (PSO) algorithm for the HFS scheduling problem with minimum makespan objective. The main contribution of this paper is to develop a new approach hybridizing PSO with bottleneck heuristic to fully exploit the bottleneck stage, and with simulated annealing to help escape from local optima. The proposed PSO algorithm is tested on the benchmark problems provided by Carlier and Néron. Experimental results show that the proposed algorithm outperforms all the compared algorithms in solving the HFS problem.

Using particle swarm optimization to solve effectively the school timetabling problem

A new hybrid adaptive algorithm based on particle swarm optimization (PSO) is designed, developed and applied to the high school timetabling problem. The proposed PSO algorithm is used to create feasible and efficient timetables for high schools in Greece. Experiments with real-world data coming from different high schools have been conducted to show the efficiency of the proposed PSO algorithm. As well as that, the algorithm has been compared with four other effective techniques found in the literature to demonstrate its efficiency and superior performance. In order to have a fair comparison with these algorithms, we decided to use the exact same input instances used by these algorithms. The proposed PSO algorithm outperforms, in most cases, other existing attempts to solve the same problem as shown by experimental results.

Evolutionary algorithm to traveling salesman problems

This paper proposed an improved version of the Particle Swarm Optimization (PSO) approach to solve Traveling Salesman Problems (TSP). This evolutionary algorithm includes two phases. The first phase includes Fuzzy C-Means clustering, a rule-based route permutation, a random swap strategy and a cluster merge procedure. This approach firstly generates an initial non-crossing route, such that the TSP can be solved more efficiently by the proposed PSO algorithm. The use of sub-cluster also reduces the complexity and achieves better performance for problems with a large number of cities. The proposed Genetic-based PSO procedure is then applied to solve the TSP with better efficiency in the second phase. The proposed Genetic-based PSO procedure is applied to TSPs with better efficiency. Fixed runtime performance was used to demonstrate the efficiency of the proposed algorithm for the cases with a large number of cities.

Coordinated aggregated-based particle swarm optimisation algorithm for congestion management in restructured power market by placement and sizing of unified power flow controller

This study presents a particle swarm optimisation (PSO)-based algorithm to perform congestion management by proper placement and sizing of one unified power flow controller (UPFC) device in a market-based power systems. The algorithm uses quadratic smooth curves for generators’ costs. A typical load duration curve (LDC) is used to improve the accuracy of the model by incorporating the impacts of load variation on the optimisation problem. The proposed approach makes use of the PSO algorithm to allocate the near-optimal GenCos as well as the optimal location and size of UPFC whereas the Newton–Raphson solution minimises the mismatch of the power flow equations. Simulation results (without/with the line flow constraints, before and after the compensation) are used to analyse the impact of UPFC on the congestion levels of the reliability test system (RTS) 24-bus test system. Simulation results by the proposed PSO algorithm are also compared with solutions obtained by the conventional sequential quadratic programming (SQP) approach.

Solving effectively the school timetabling problem using particle swarm optimization

A new adaptive algorithm based on particle swarm optimization (PSO) is designed, developed and applied to the high school timetabling problem. The proposed PSO algorithm is used in order to create feasible and very efficient timetables for high schools in Greece. Experiments with real-world data coming from many different high schools have been conducted in order to show the efficiency of the proposed PSO algorithm. As well as that, the algorithm has been compared with four other effective techniques found in the literature in order to demonstrate its efficiency and superior performance. The proposed PSO algorithm outperforms, in most cases, other existing attempts to solve the same problem as shown by experimental results.

A swarm optimization approach for flexible flow shop scheduling with multiprocessor tasks

In simple flow shop problems, each machine operation center includes just one machine. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow shop problem (FFSP). Flexible flow shops are thus generalization of simple flow shops. Flexible flow shop scheduling problems have a special structure combining some elements of both the flow shop and the parallel machine scheduling problems. FFSP can be stated as finding a schedule for a general task graph to execute on a multiprocessor system so that the schedule length can be minimized. FFSP is known to be NP-hard. In this study, we present a particle swarm optimization (PSO) algorithm to solve FFSP. PSO is an effective algorithm which gives quality solutions in a reasonable computational time and consists of less numbers parameters as compared to the other evolutionary metaheuristics. Mutation, a commonly used operator in genetic algorithm, has been introduced in PSO so that trapping of solutions at local minima or premature convergence can be avoided. Logistic mapping is used to generate chaotic numbers in this paper. Use of chaotic numbers makes the algorithm converge fast towards near-optimal solution and hence reduce computational efforts further. The performance of schedules is evaluated in terms of total completion time or makespan (Cmax). The results are presented in terms of percentage deviation (PD) of the solution from the lower bound. The results are compared with different versions of genetic algorithm (GA) used for the purpose from open literature. The results indicate that the proposed PSO algorithm is quite effective in reducing makespan because average PD is observed as 2.961, whereas GA results in average percentage deviation of 3.559. Finally, influence of various PSO parameters on solution quality has been investigated.

Multiproduct multiple-buyer single-vendor supply chain problem with stochastic demand, variable lead-time, and multi-chance constraint

In this paper, a multi-product multi-chance constraint joint single-vendor multi-buyers inventory problem is considered in which the demand follows a uniform distribution, the lead-time is assumed to vary linearly with respect to the lot size, and the shortage in combination of backorder and lost-sale is assumed. Furthermore, the orders are placed in multiple of packets, there is a limited space available for the vendor, there are chance constraints on the vendor service rate to supply the products, and there is a limited budget for each buyer to purchase the products. While the elements of the buyers’ cost function are holding, shortage, order and transportation costs, the set up and holding costs are assumed for the vendor. The goal is to determine the re-order point and the order quantity of each product for each buyer such that the chain total cost is minimized. We show the model of this problem to be a mixed integer nonlinear programming type and in order to solve it a particle swarm optimization (PSO) approach is used. To justify the results of the proposed PSO algorithm, a genetic algorithm (GA) is applied as well to solve the problem. Then, the quality of the results and the CPU times of reaching the solution are compared through three numerical examples that are given to demonstrate the applicability of the proposed methodology in real world inventory control problems. The comparison results show the PSO approach has better performances than the GA method.

A particle swarm algorithm for inspection optimization in serial multi-stage processes

Implementing efficient inspection policies is much important for the organizations to reduce quality related costs. In this paper, a particle swarm optimization (PSO) algorithm is proposed to determine the optimal inspection policy in serial multi-stage processes. The policy consists of three decision parameters to be optimized; i.e. the stages in which inspection occurs, tolerance of inspection, and size of sample to inspect. Total inspection cost is adopted as the performance measure of the algorithm. A numerical example is investigated in two phases, i.e. fixed sample size and sample size as a decision parameter, to ensure the practicality and validity of the proposed PSO algorithm. It is shown that PSO gives better results in comparison with two other algorithms proposed by earlier works.

Scheduling a single machine with multiple job processing ability to minimize makespan

This paper investigates a new problem, called single machine scheduling with multiple job processing ability, which is derived from the production of the continuous walking beaming reheating furnace in iron and steel industry. In this problem, there is no batch and the jobs enter and leave the machine one by one and continuously, which is different from general single machine batch scheduling problem where the jobs in a batch share the same start and departure time. Therefore, the start time and the departure time of a job depend on not only the job sequence but also the machine capacity. This problem is also different from the single semi-continuous batching machine scheduling recently studied in the literature, where the jobs are processed in batch mode and a new batch cannot be started for processing until the processing of the previous batch is completed though jobs in the same batch enter and leave the machine one by one. The objective of this problem is to minimize the makespan. We formulate this problem as a mixed integer linear programming model and propose a particle swarm optimization (PSO) algorithm for this problem. Computational results on randomly generated instances show that the proposed PSO algorithm is effective.

Reliability-based design optimization with discrete design variables and non-smooth performance functions: AB-PSO algorithm

The purpose of reliability-based design optimization (RBDO) is to find a balanced design that is not only economical but also reliable in the presence of uncertainty. Practical applications of RBDO involve discrete design variables, which are selected from commercially available lists, and non-smooth (non-differentiable) performance functions. In these cases, the problem becomes an NP-complete combinatorial optimization problem, which is intractable for discrete optimization methods. Moreover, the non-smooth performance functions would hinder the use of gradient-based optimizers as gradient information is of questionable accuracy. A framework is presented in this paper whereby subset simulation is integrated with a new particle swarm optimization (PSO) algorithm to solve the discrete and non-smooth RBDO problem. Subset simulation overcomes the inefficiency of direct Monte Carlo simulation (MCS) in estimating small failure probabilities, while being robust against the presence of non-smooth performance functions. The proposed PSO algorithm extends standard PSO to include two new features: auto-tuning and boundary-approaching. The former feature allows the proposed algorithm to automatically fine tune its control parameters without tedious trial-and-error procedures. The latter feature substantially increases the computational efficiency by encouraging movement toward the boundary of the safe region. The proposed auto-tuning boundary-approaching PSO algorithm (AB-PSO) is used to find the optimal design of a ten-bar truss, whose component sizes are selected from commercial standards, while reliability constraints are imposed by the current design code. In multiple trials, the AB-PSO algorithm is able to deliver competitive solutions with consistency. The superiority of the AB-PSO algorithm over standard PSO and GA (genetic algorithm) is statistically supported by non-parametric Mann–Whitney U tests with the p-value less than 0.01.