Search results

With the continuous upgrading of the production mode of the manufacturing system, the characteristics of multi-variety, small batch and mixed fluidization are presented, and the production environment becomes more and more complex. To improve the efficiency of solving multi-objective flexible job shop scheduling problem (FJSP), an improved hybrid particle swarm optimization algorithm (IH-PSO) is proposed.

After reviewing literatures on FJSP, an IH-PSO algorithm for solving FJSP is developed. First, IH-PSO algorithm draws on the crossover and mutation operations of genetic algorithm (GA) algorithm and proposes a new method for updating particles, which makes the offspring particles inherit the superior characteristics of the parent particles. Second, based on the improved simulated annealing (SA) algorithm, the method of updating the individual best particles expands the search scope of the domain and solves the problem of being easily trapped in local optimum. Finally, analytic hierarchy process (AHP) is used in this paper to solve the optimal solution satisfying multi-objective optimization.

Through the benchmark experiment and the production example experiment, it is verified that the proposed algorithm has the advantages of high quality of solution and fast speed of convergence.

This method does not consider the unforeseen events that occur during the process of scheduling and cause the disruption of normal production scheduling activities, such as machine breakdown.

IH-PSO algorithm combines PSO algorithm with GA and SA algorithms. This algorithm retains the advantage of fast convergence speed of traditional PSO algorithm and has the characteristic of inheriting excellent genes. In addition, the improved SA algorithm is used to solve the problem of falling into local optimum.

This research provides an efficient scheduling method for solving the FJSP problem.

This research proposes an IH-PSO algorithm to solve the FJSP more efficiently and meet the needs of multi-objective optimization.

Given the effects of natural and social factors, data on both the supply and demand sides of electricity will produce obvious seasonal fluctuations. The purpose of this article is to propose a new dynamic seasonal grey model based on PSO-SVR to forecast the production and consumption of electric energy.

In the model design, firstly, the parameters of the SVR are initially optimized by the PSO algorithm for the estimation of the dynamic seasonal operator. Then, the seasonal fluctuations in the electricity demand data are eliminated using the dynamic seasonal operator. After that, the time series after eliminating of the seasonal fluctuations are used as the training set of the DSGM(1, 1) model, and the corresponding fitted, and predicted values are calculated. Finally, the seasonal reduction is performed to obtain the final prediction results.

This study found that the electricity supply and demand data have obvious seasonal and nonlinear characteristics. The dynamic seasonal grey model based on PSO-SVR performs significantly better than the comparative model for hourly and monthly data as well as for different time durations, indicating that the model is more accurate and robust in seasonal electricity forecasting.

Considering the seasonal and nonlinear fluctuation characteristics of electricity data. In this paper, a dynamic seasonal grey model based on PSO-SVR is established to predict the consumption and production of electric energy.

Parameter identification is a technique which aims at determining material or other process parameters based on a combination of experimental and numerical techniques. In recent years, heuristic approaches, such as genetic algorithms (GAs), have been proposed as possible alternatives to classical identification procedures. The present work shows that particle swarm optimization (PSO), as an example of such methods, is also appropriate to identification of inelastic parameters. The paper aims to discuss these issues.

PSO is a class of swarm intelligence algorithms which attempts to reproduce the social behaviour of a generic population. In parameter identification, each individual particle is associated to hyper-coordinates in the search space, corresponding to a set of material parameters, upon which velocity operators with random components are applied, leading the particles to cluster together at convergence.

PSO has proved to be a viable alternative to identification of inelastic parameters owing to its robustness (achieving the global minimum with high tolerance for variations of the population size and control parameters), and, contrasting to GAs, higher convergence rate and small number of control variables.

PSO has been mostly applied to electrical and industrial engineering. This paper extends the field of application of the method to identification of inelastic material parameters.

The purpose of this paper is to perform an optimal design of single phase permanent magnet brushless DC motor (SPBLDCM) using efficiency of the motor as objective function. In the design procedure performed on SPBLDCM, particle swarm optimisation (PSO) as an optimisation tool is used.

The created computer programme for optimal design of electrical machines is based on the PSO. According to the design characteristics of SPBLDCM, some of the motor parameters are chosen to be constant and others variable. A comparative analysis of both motor models based on the value of the objective function, as well as the values of the optimisation parameters, is performed.

From the comparative data analysis of both motor models, it can be concluded that the main objective of the optimisation is realised, and it is achieved by an improvement of the efficiency of the motor.

An optimisation technique based on PSO has been developed and applied to the design of SPBLDCM. According to the results it can be concluded that the PSO is a very suitable tool for design optimisation of SPBLDCM and electromagnetic devices in general. The quality of the PSO model has been proved through the data analysis of the prototype and optimised solution. At the end, the quality of the PSO solution has been again proved by comparative analysis of the two motor models using FEM as a performance analysis tool.

A Nash bargaining game data envelopment analysis (NBG-DEA) model is proposed to measure the efficiency of dynamic multi-period network structures. This paper aims to propose NBG-DEA model to measure the performance of decision-making units with complicated network structures.

As the proposed NBG-DEA model is a non-linear mathematical programming, finding its global optimum solution is hard. Therefore, meta-heuristic algorithms are used to solve non-linear optimization problems. Fortunately, the NBG-DEA model optimizes the well-formed problem, so that it can be solved by different non-linear methods including meta-heuristic algorithms. Hence, a meta-heuristic algorithm, called particle swarm optimization (PSO) is proposed to solve the NBG-DEA model in this paper. The case study is Industrial Management Institute (IMI), which is a leading organization in providing consulting management, publication and educational services in Iran. The sub-processes of IMI are considered as players where their pay-off is defined as the efficiency of sub-processes. The network structure of IMI is studied during multiple periods.

The proposed NBG-DEA model is applied to measure the efficiency scores in the IMI case study. The solution found by the PSO algorithm, which is implemented in MATLAB software, is compared with that generated by a classic non-linear method called gradient descent implemented in LINGO software.

The experiments proved that suitable and feasible solutions could be found by solving the NBG-DEA model and shows that PSO algorithm solves this model in reasonable central process unit time.

The purpose of this paper is to develop an effective and efficient approach to exploit meta‐heuristic in particle swarm optimization (PSO) for the job shop scheduling problem (JSP), a class of NP‐hard optimization problems. The approach is to be built on a PSO with multiple independent swarms. PSO was inspired by bird flocking and animal social behaviors. The particles operate collectively like a swarm that flies through the hyperdimensional space to search for possible optimal solutions. The behavior of the particles is influenced by their tendency to learn from their personal past experience and from the success of their peers to adjust their flying speed and direction. Research in fusing the multiple‐swarm concept into PSO is well‐established in solving single objective optimization problems and multimodal problems.

This study examines the optimization of the JSP via a search space division scheme and use of the meta‐heuristic method of PSO by assigning each machine in a JSP an independent swarm of particles. The use of multiple swarms in PSO is motivated by the idea of “divide and conquer” to reduce the computational complexity incurred through solving a NP‐hard combinatorial optimization problem. The resulted design, JSP/PSO algorithm, fully exploits the computing power presented by the multiple‐swarm PSO.

Simulation experiments show that the proposed JSP/PSO algorithm can effectively solve the JSP problems from small to median size. If certain mechanism of information sharing between swarms can be incorporated, it is believed that the new design could offer even more computing power to tackle the large‐sized problems.

The proposed JSP/PSO algorithm is effective in solving JSPs. The proposed algorithm shows considerable promise when searching the space of non‐delay schedules. It demands relatively lower number of function evaluations compared to other state‐of‐the‐art. The drawback to the JSP/PSO is that the GT scheduling adopted is too computationally expensive. Future works will address this concern.

Three-axis accelerometers play a vital role in monitoring the vibrations in aircraft machinery, especially in variable flight temperature environments. The sensitivity of a three-axis accelerometer under different temperature conditions needs to be calibrated before the flight test. Hence, the authors investigated the efficiency and sensitivity calibration of three-axis accelerometers under different conditions. This paper aims to propose the novel calibration algorithm for the three-axis accelerometers or the similar accelerometers.

The authors propose a hybrid genetic algorithm–particle swarm optimisation–back-propagation neural network (GA–PSO–BPNN) algorithm. This method has high global search ability, fast convergence speed and strong non-linear fitting capability; it follows the rules of natural selection and survival of the fittest. The authors describe the experimental setup for the calibration of the three-axis accelerometer using a three-comprehensive electrodynamic vibration test box, which provides different temperatures. Furthermore, to evaluate the performance of the hybrid GA–PSO–BPNN algorithm for sensitivity calibration, the authors performed a detailed comparative experimental analysis of the BPNN, GA–BPNN, PSO–BPNN and GA–PSO–BPNN algorithms under different temperatures (−55, 0 , 25 and 70 °C).

It has been showed that the prediction error of three-axis accelerometer under the hybrid GA–PSO–BPNN algorithm is the least (approximately ±0.1), which proved that the proposed GA–PSO–BPNN algorithm performed well on the sensitivity calibration of the three-axis accelerometer under different temperatures conditions.

The designed GA–PSO–BPNN algorithm with high global search ability, fast convergence speed and strong non-linear fitting capability has been proposed to decrease the sensitivity calibration error of three-axis accelerometer, and the hybrid algorithm could reach the global optimal solution rapidly and accurately.

The Particle Swarm Optimization (PSO) method makes few or no assumptions about the optimization problem at hand and is applicable without much information about the problem. Although this fact constitutes one of the most important advantages of the PSO method, it can also be considered as a waste of available knowledge about the specific problem, which could have drastically improved the search performance. This paper aims to introduce an improvement to the PSO method such that the exploitation of any available knowledge about the specific optimization problem can be combined with the powerful blind‐search ability of the original method.

The improvement is achieved by the so‐called Knowledge Supported PSO (KS‐PSO), which consists of a combination of two modes: a mode that operates according to the original PSO approach and a knowledge‐based mode which the user has to design for the specific problem.

The application of the proposed KS‐PSO method is presented for two rather different optimization problems chosen from the domain of control and computer engineering: the model‐free tuning of a Fractional‐Order PID controller and the training of a single‐layer perceptron. The simulation results demonstrate the performance improvement in KS‐PSO as compared to the original PSO.

This paper presents a novel version of the well‐known PSO method, which achieves performance improvement by combining the original blind‐search capability with the exploitation of available knowledge about the specific problem.

The purpose of this paper is to improve the efficiency of particle optimization method by using direct and indirect surrogate modeling in inverse design problems.

The new algorithm emphasizes the use of a direct and an indirect design prediction based on local surrogate models in particle swarm optimization (PSO) algorithm. Local response surface approximations are constructed by using radial basis neural networks. The principal role of surrogate models is to answer the question of which individuals should be placed into the next swarm. Therefore, the main purpose of surrogate models is to predict new design points instead of estimating the objective function values. To demonstrate its merits, the new approach and six comparative algorithms were applied to two different test cases including surface fitting of a geographical terrain and an inverse design of a wing, the averaged best-individual fitness values of the algorithms were recorded for a fair comparison.

The new algorithm provides more than 60 per cent reduction in the required generations as compared with comparative algorithms.

The comparative study was carried out only for two different test cases. It is possible to extend test cases for different problems.

The proposed algorithm can be applied to different inverse design problems.

The study presents extra ordinary application of double surrogate modeling usage in PSO for inverse design problems.

The purpose of this paper is to present a new constrained optimization algorithm based on a particle swarm optimization (PSO) algorithm approach.

This paper introduces a hybrid approach based on a modified ring neighborhood with two new perturbation operators designed to keep diversity. A constraint handling technique based on feasibility and sum of constraints violation is adopted. Also, a special technique to handle equality constraints is proposed.

The paper shows that it is possible to improve PSO and keeping the advantages of its social interaction through a simple idea: perturbing the PSO memory.

The proposed algorithm shows a competitive performance against the state‐of‐the‐art constrained optimization algorithms.

The proposed algorithm can be used to solve single objective problems with linear or non‐linear functions, and subject to both equality and inequality constraints which can be linear and non‐linear. In this paper, it is applied to various engineering design problems, and for the solution of state‐of‐the‐art benchmark problems.

A new neighborhood structure for PSO algorithm is presented. Two perturbation operators to improve PSO algorithm are proposed. A special technique to handle equality constraints is proposed.