Quantum-behaved Particle Swarm Optimization Research Articles

An ensemble algorithm based on adaptive chaotic quantum-behaved particle swarm optimization with weibull distribution and hunger games search and its financial application in parameter identification

An ensemble algorithm based on adaptive chaotic quantum-behaved particle swarm optimization with weibull distribution and hunger games search and its financial application in parameter identification

Augmentation of Soft Partition with a Granular Prototype Based Fuzzy C-Means

Clustering is a fundamental cornerstone in unsupervised learning, playing a pivotal role in various data mining techniques. The precise and efficient classification of data stands as a central focus for numerous researchers and practitioners alike. In this study, we design an effective soft partition classification method which refines and extends the prototype of the well-known Fuzzy C-Means clustering algorithm. Specifically, the developed scheme employs membership function to extend the prototypes into a series of granular prototypes, thus achieving a deeper revelation of the structure of the data. This process softly divides the data into core and extended parts. The core part can be succinctly encapsulated through several information granules, whereas the extended part lacks discernible geometry and requires formal descriptors (such as membership formulas). Our objective is to develop information granules that shape the core structure within the dataset, delineate their characteristics, and explore the interaction among these granules that result in their deformation. The granular prototypes become the main component of the information granules and provide an optimization space for traditional prototypes. Subsequently, we apply quantum-behaved particle swarm optimization to identify the optimal partition matrix for the data. This optimized matrix significantly enhances the partition performance of the data. Experimental results provide substantial evidence of the effectiveness of the proposed approach.

Enhancing quality of services using genetic quantum behaved particle swarm optimization for location dependent services

Enhancing quality of services using genetic quantum behaved particle swarm optimization for location dependent services

Soft Sensor Modeling of Self-Organizing Interval Type-2 Fuzzy Neural Network Based on Adaptive Quantum-Behaved Particle Swarm Optimization Algorithm

Soft Sensor Modeling of Self-Organizing Interval Type-2 Fuzzy Neural Network Based on Adaptive Quantum-Behaved Particle Swarm Optimization Algorithm

Quantum‐Behaved Particle Swarm Optimization Based on Concentration Selection Probability Assignment Weights for Power System Economic Dispatch

The economic dispatch (ED) problem is very important in the economics of power systems, and a suitable dispatch algorithm can help power plants save huge amounts of money and use energy efficiently. To ensure the economics of the power system dispatch strategy, this paper proposes a quantum‐behaved particle swarm improvement algorithm for solving the ED problem. First, the algorithm addresses the problem that the classical quantum‐behaved particle swarm optimization (QPSO) tends to be premature and falls into local optimality. We propose a method to calculate the mean best position by assigning weights to different particles, by adopting the idea of concentration selection in the immune concentration regulation mechanism, and designing a Weight‐Concentration selection probability function, so that those particles located outside the local optimal solution region but with smaller fitness value and better evolutionary trend can be retained. Second, to make the algorithm focus on global search at the beginning of the iteration and more focused search at the end to enhance the neighborhood search capability at the later stage, a decreasing function of the slope K in the Weight‐Concentration selection probability function is designed so that the influence of the weighting term on the calculation of the mean best position decreases gradually. The algorithm is evaluated with four power systems, and the results show that the overall performance of the improved algorithm is better than other algorithms in solving the ED problem in terms of minimum solution, convergence, and stability. © 2024 Institute of Electrical Engineer of Japan and Wiley Periodicals LLC.

An adaptive binary quantum-behaved particle swarm optimization algorithm for the multidimensional knapsack problem

The multidimensional knapsack problem (MKP) is a classical combinatorial optimization problem with wide real-life applications. Binary quantum-behaved particle swarm optimization (BQPSO) algorithm is a popular heuristic algorithm used in binary optimization. While BQPSO exhibits strong global search capabilities, it is still prone to local optima due to particle aggregation. To address this issue, an adaptive BQPSO (ABQPSO) algorithm is proposed to solve the MKP efficiently. A hybrid encoding population initialization scheme is employed, leveraging specific knowledge of MKP to increase population diversity and improve search efficiency. Furthermore, ABQPSO uses a mapping strategy that converts continuous values into discrete values based on the average position of particles. An adaptive repair operator considering two pseudo-utility ratios is introduced to enable particles to explore different feasible regions, which dynamically adjusts current pseudo-utility ratios based on changes in the global best solution. A local search method is applied to guide particles towards convergence to the optimum. A local sparseness degree measurement and a diversity mechanism are utilized to avoid local optima. To evaluate the effectiveness of ABQPSO, it is compared against ten state-of-the-art algorithms using 168 MKP benchmark instances of varying scales. Experimental results reveal that ABQPSO outperforms the comparison algorithms, especially for large-scale problems, demonstrating better solution accuracy.

Multi-performance Optimization of the Rotary Turning Operation for Environmental and Quality Indicators

In this investigation, two environmental metrics (the comprehensive energy used (TU) and turning noise (TN)) and a quality metric (surface roughness (SR)) of the rotary turning process for the Ti6Al4V were optimized and reduced using the optimal factors (the inclined angle-i, depth of cut-d, feed-f, and turning speed-V). The TU model was proposed comprising the embodied energy of the insert and lubricant. The method based on the removal effects of criteria (MEREC), an improved quantum-behaved particle swarm optimization algorithm (IQPSO), and TOPSIS were applied to select weight values and the best optimal solution. The machining cost (MC) was proposed in terms of process parameters. The outcomes presented that the optimal values of the i, d, f, and V were 35 deg., 0.30 mm, 0.40 mm/rev., and 190 m/min, respectively, while the TU, SR, TN, and MC were saved by 6.7 %, 22.3 %, 23.5 %, and 8.5 %, respectively. The turning responses were primarily affected by the feed rate and turning speed, respectively. The developed turning process could be employed for machining hard-to-cut alloys. The developed approach could be applied to deal with optimization problems for other machining operations.

A Word-Level Adversarial Attack Method Based on Sememes and an Improved Quantum-Behaved Particle Swarm Optimization.

The goal of textual adversarial attack methods is to replace some words in an input text in order to make the victim model misbehave. This article proposes an effective word-level adversarial attack method based on sememes and an improved quantum-behaved particle swarm optimization (QPSO) algorithm. The sememe-based substitute method, which uses the words sharing the same sememes as the substitutes of the original words, is first employed to form the reduced search space. Then, an improved QPSO algorithm, called historical information-guided QPSO with random drift local attractor (HIQPSO-RD), is proposed to search the reduced search space for adversarial examples. The HIQPSO-RD introduces historical information into the current mean best position of the QPSO, for the purpose of improving the convergence speed of the algorithm, by enhancing its exploration ability and preventing the premature convergence of the swarm. The proposed algorithm uses the random drift local attractor technique to make a good balance between its exploration and exploitation, so that the algorithm can find a better adversarial attack example with low grammaticality and perplexity (PPL). In addition, it employs a two-stage diversity control strategy to enhance the search performance of the algorithm. Experiments on three natural language processing (NLP) datasets, with three commonly used nature language processing models as victim models, show that our method achieves higher attack success rates but lower modification rates than the state-of-the-art adversarial attack methods. Moreover, the results of human evaluations show that adversarial examples generated by our method can better maintain the semantic similarity and grammatical correctness of the original input.

Time-energy-jerk optimal trajectory planning for high-speed parallel manipulator based on quantum-behaved particle swarm optimization algorithm and quintic B-spline

This paper presents a technique for multi-node trajectory planning for high-speed parallel manipulators that optimizes the execution time, energy consumption and jerk (the time derivative of the acceleration of the manipulator joints) to improve working efficiency, decrease energy consumption, dampen vibration and ensure mechanism protection. Initially, an improved quintic B-spline interpolation model is proposed, incorporating additional jerk boundary constraints to dampen residual vibrations at the start and end of the trajectory. Subsequently, the time-energy-jerk optimization model is formulated, with the maximum angular velocity, acceleration, and jerk serving as constraints. The normalized parameter of the B-spline curve is considered to divide the whole model into two submodels. In the first submodel, the satisfaction function is proposed to convert energy and jerk indices into one comprehensive objective for optimization with the quantum-behaved particle swarm optimization (QPSO) algorithm. Time parameters are to be decided as decision variables, regardless of kinematic constraints and execution time. In the second submodel, the optimal time parameters obtained in the first submodel are used as input arguments, and the optimal execution time is determined with respect to the kinematic constraints. The simulation results on a planar parallel manipulator show that the proposed method achieves an efficient trajectory, which is energy-saving and possesses reduced vibration. Application of the comprehensive trajectory generated by the proposed method, rather than the classical method, enhances the maximum productivity of the fast pick-and-place operation to 155 picks per minute from 97 picks/min. This improvement is accomplished by using less energy and reducing vibration.

A hybrid quantum-behaved particle swarm optimization solution to non-convex economic load dispatch with multiple fuel types and valve-point effects

Economic dispatch problems (EDPs) can be reduced to non-convex constrained optimization problems, and most of the population-based algorithms are prone to have problems of premature and falling into local optimum when solving EDPs. Therefore, this paper proposes a hybrid quantum-behaved particle swarm optimization (HQPSO) algorithm to alleviate the above problems. In the HQPSO, the Solis and Wets local search method is used to enhance the local search ability of the QPSO so that the algorithm can find solutions that is close to optimal when the constraints are met, and two evolution operators are proposed and incorporated for the purpose of making a better balance between local search and global search abilities at the later search stage. The performance comparison is made among the HQPSO and the other ten population-based random search methods under two different experimental configurations and four different power systems in terms of solution quality, robustness, and convergence property. The experimental results show that the HQPSO improves the convergence properties of the QPSO and finally obtains the best total generation cost without violating any constraints. In addition, the HQPSO outperforms all the other algorithms on 7 cases of all 8 experimental cases in terms of global best position and mean position, which verifies the effectiveness of the algorithm.

A cascaded model predictive control based trajectory tracking controller for an autonomous and remotely operated vehicle with LOS guidance

ABSTRACT Autonomous and Remotely Operated Vehicle (ARV) are widely used for underwater detection and typically require ARVs to track predefined trajectories. Manual operation is not very accurate and stable, and intelligent control methods are popularly devised. This paper firstly introduces the line of sight (LOS) method for desired heading guidance. Later, a cascaded model predictive control (MPC) is proposed. In the cascaded MPC, a quantum-behaved particle swarm optimisation algorithm based on a non-linear decreasing contraction-expansion coefficient (QPSO-CE-nonlinear) is applied to optimise the controller’s output. Several validation and comparative simulations are carried out. The results show that the controller has advantages in accuracy, convergence, and stability. The LOS is applicable to holonomic ARV and accelerates convergence. The QPSO-CE-nonlinear algorithm can improve the rate of convergence when solving optimisation problems. In addition, compared with MPC-SMC (sliding mode control), the cascaded MPC is more robust.

Optoacoustic classification of diabetes mellitus with the synthetic impacts via optimized neural networks

A highly accurate classification of diabetes mellitus (DM) with the synthetic impacts of several variables is first studied via optoacoustic technology in this work. For this purpose, an optoacoustic measurement apparatus of blood glucose is built, and the optoacoustic signals and peak–peak values for 625 cases of in vitro rabbit blood are obtained. The results show that although the single impact of five variables are obtained, the precise classification of DM is limited because of the synthetic impacts. Based on clinical standards, different levels of blood glucose corresponding to hypoglycaemia, normal, slight diabetes, moderate diabetes and severe diabetes are employed. Then, a wavelet neural network (WNN) is utilized to establish a classification model of DM severity. The classification accuracy is 94.4 % for the testing blood samples. To enhance the classification accuracy, particle swarm optimization (PSO) and quantum-behaved particle swarm optimization (QPSO) are successively utilized to optimize WNN, and accuracy is enhanced to 98.4 % and 100 %, respectively. It is demonstrated from comparison between several algorithms that optoacoustic technology united with the QPSO-optimized WNN algorithm can achieve precise classification of DM with synthetic impacts.

Fault location of untransposed double-circuit transmission lines based on an improved Karrenbauer matrix and the QPSO algorithm

Some double-circuit transmission lines are untransposed, which results in complex coupling relations between the parameters of the transmission lines. If the traditional modal transformation matrix is directly used to decouple the parameters, it can lead to large errors in the decoupled modal parameter, errors which will be amplified in the fault location equation. Consequently, it makes the fault location results of the untransposed double-circuit transmission lines less accurate. Therefore, a new modal transformation method is needed to decouple the parameter matrix of untransposed double-circuit transmission lines and realize the fault location according to the decoupled modal parameter. By improving the basis of the Karrenbauer matrix, a modal transformation matrix suitable for decoupling parameters of untransposed double-circuit transmission lines is obtained. To address the difficulties in solving the fault location equation of untransposed double-circuit transmission lines, a new fault location method based on an improved Karrenbauer matrix and the quantum-behaved particle swarm optimization (QPSO) algorithm is proposed. Firstly, the line parameter matrix is decomposed into identical and inverse sequence components using the identical-inverse sequence component transformation. The Karrenbauer matrix is then transformed to obtain the improved Karrenbauer matrix for untransposed double-circuit transmission lines and applied to identical and inverse sequence components to solve the decoupled modal parameter. Secondly, based on the principle that voltage magnitudes at both ends are equal, the fault location equation is expressed using sequence components at each end, and the QPSO algorithm is introduced to solve the equation. Finally, the feasibility and accuracy of the proposed method are verified by PSCAD simulation. The simulation results fully demonstrate that the innovative improvement on the basis of the traditional modal transformation matrix in this paper can realize the modal transformation of the complex coupling parameters of the untransposed double-circuit transmission lines. It causes almost no errors in the decoupling process. The QPSO algorithm can also solve the fault location equation more accurately. The new fault location method can realize the accurate fault location of untransposed double-circuit transmission lines.

An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems

The 0-1 knapsack problem is a typical NP-hard combinatorial optimization problem that is difficult to solve efficiently based on traditional optimization approaches. Binary quantum-behaved particle swarm optimization (BQPSO) algorithm is a simple yet efficient discrete optimization approach since it guarantees global search. However, BQPSO suffers from local optimum and slow convergence problems due to aggregation among particles, limiting its performance. To address this problem, an improved BQPSO (IBQPSO) algorithm is proposed to effectively solve the 0-1 knapsack problem. First, to address the discretization issues in existing QPSO algorithms, a mapping strategy based on the average position of all particles is introduced. Then, the transfer function is used to discretize the local attractors into binary vectors for crossover operations, which can guide individuals in the discrete space to the optimum. In addition, a new repair method is employed to address infeasible solutions, and a diversity maintenance mechanism is developed in IBQPSO to alleviate the local optima problem. The proposed algorithm is compared with ten state-of-the-art heuristic algorithms on a set of 0-1 knapsack problems with different scales. Experimental results show that IBQPSO has obvious superiority over the other ten algorithms in terms of convergence speed and search performance.

One-step production and two-step assembly scheduling in identical factories

In this article, a production–assembly scheduling problem is presented in three steps. In the first step, the production operation is performed by dedicated parallel machines; in the second step, the assembly operation is performed by the same parallel machines, and in the third step, the post-assembly operation is performed by one machine, and these three steps exist in parallel factories. This problem is NP hard and cannot be solved in a reasonable time by mathematical models. Therefore, a mixed integer linear programming algorithm is presented for small-sized problems, and a new metaheuristic algorithm is presented for large-sized problems, by combining quantum-behaved particle swarm optimization (QPSO), shortest processing time (SPT) and dominance rules, which is called the hybrid QPSOSPT dominance rules (HQSD) algorithm. Accurate parameter adjustment was achieved by analysis of variance. The HQSD algorithm was shown to obtain better results than the other algorithms.

New cardiovascular disease prediction approach using support vector machine and quantum-behaved particle swarm optimization

Cardiovascular disease (CVD) is one of the leading causes of death worldwide. Early detection of CVD reduces the risk of a heart attack and increases the chance of recovery. The use of angiography to detect CVD is expensive and has negative side effects. In addition, existing CVD diagnostic methods usually achieve low detection rates and reach the best decision after many iterations with low convergence speeds. Therefore, a novel heart disease detection model based on the quantum-behaved particle swarm optimization (QPSO) algorithm and support vector machine (SVM) classification model, namely, QPSO-SVM, was proposed to analyze and predict heart disease risk. First, the data preprocessing was performed by transforming nominal data into numerical data and applying effective scaling techniques. Next, the SVM fitness equation is expressed as an optimization problem and solved using the QPSO to determine the optimal features. Finally, a self-adaptive threshold method for tuning the QPSO-SVM parameters is proposed, which permits it to drop into local minima, and balances between exploration and exploitation in the solution search space. The proposed model is applied to the Cleveland heart disease dataset and compared with state-of-the-art models. The experimental results show that the proposed QPSO-SVM model achieved the best heart-disease-prediction accuracies of 96.31% on the Cleveland heart data set. Furthermore, QPSO-SVM outperforms other state-of-the-art prediction models considered in this research in terms of sensitivity (96.13%), specificity (93.56%), precision (94.23%), and F1 score (0.95%).

Application of a Modified Quantum-behaved Particle Swarm Optimization Algorithm for MPPT

Aiming at the characteristics of multiple power peaks of the photovoltaic array under non-homogeneous irradiance conditions, a modified quantum-behaved particle swarm optimization algorithm (MQPSOA) for maximum power point (MPP) tracking is provided. The MQPSOA directly controls the duty ratio and dynamically adjusts parameters during its operation. The final results of the photovoltaic system experiment illustrate that the MQPSOA exhibits good performance in the global search of the MPP. It has a fast search rate and small power fluctuation in comparison with particle swarm optimization.

Quasi opposite-based learning and double evolutionary QPSO with its application in optimization problems

Although quantum-behaved particle swarm optimization (QPSO) algorithm has the advantages of few parameters and simple implementation, it suffers from these problems of low precision while calculating high-dimensional complex problems and being caught in local optimum during the later stage of iteration. To tackle these shortages effectively, a modified QPSO (QDQPSO) algorithm is presented. In order to improve the search efficiency and convergence speed of the algorithm, the idea of quasi opposite-based learning is used in the initialization stage. For enhancing the overall performance of the algorithm, the double evolutionary mechanism is applied to update the individual location during the iterative process. Furthermore, perturbation at global optimum position and bound constraint handling are considered to help the algorithm to escape from local optimum and maintain the diversity of population. According to the results obtained by QDQPSO and other nine optimization algorithms on 28 benchmark functions under different dimensions, it is found that QDQPSO performs better on the accuracy and stability of the optimal solution. Subsequently, Wilcoxon rank-sum test and Friedman test demonstrate significant advantages of the improved algorithm. Finally, QDQPSO algorithm displays superior performance in solving five practical optimization problems compared to several optimization methods.

Dynamic cyclic kitting part-feeding scheduling for mixed-model assembly line by a hybrid quantum-behaved particle swarm optimization

PurposeThe purpose of this paper is to cut down energy consumption and eliminate production waste on mixed-model assembly lines. Therefore, a supermarket integrated dynamic cyclic kitting system with the application of electric vehicles (EVs) is introduced. The system resorts to just-in-time (JIT) and segmented sub-line assignment strategies, with the objectives of minimizing line-side inventory and energy consumption.Design/methodology/approachHybrid opposition-based learning and variable neighborhood search (HOVMQPSO), a multi-objective meta-heuristics algorithm based on quantum particle swarm optimization is proposed, which hybridizes opposition-based learning methodology as well as a variable neighborhood search mechanism. Such algorithm extends the search space and is capable of obtaining more high-quality solutions.FindingsComputational experiments demonstrated the outstanding performance of HOVQMPSO in solving the proposed part-feeding problem over the two benchmark algorithms non-dominated sorting genetic algorithm-II and quantum-behaved multi-objective particle swarm optimization. Additionally, using modified real-life assembly data, case studies are carried out, which imply HOVQMPSO of having good stability and great competitiveness in scheduling problems.Research limitations/implicationsThe feeding problem is based on static settings in a stable manufacturing system with determined material requirements, without considering the occurrence of uncertain incidents. Current study contributes to assembly line feeding with EV assignment and could be modified to allow cooperation between EVs.Originality/valueThe dynamic cyclic kitting problem with sub-line assignment applying EVs and supermarkets is solved by an innovative HOVMQPSO, providing both novel part-feeding strategy and effective intelligent algorithm for industrial engineering.

Timetable rescheduling of metro network during the last train period

Non-last train passengers in the last train period experience issues with transferability and accessibility in addition to the final service of each line. Therefore, a specified schedule needs to be determined by operators with full consideration of passengers' travel demand for all the trains during this period. Aiming at minimizing the average transfer waiting time, failure transfer rate, and the negative effect of random passenger flow without incurring excessive costs to the operator, a model optimizing the train connection in the last train period is formulated under constraints of operation parameters and transfer passenger flow conditions. To depict the uncertain features of transfer demand, a random passenger flow generation method with stochastic simulation is incorporated into an improved quantum particle swarm algorithm (QPSA). Taking Shenzhen Metro network in 2019 as an example, the rationality of the optimized model, the feasibility of the quantum-behaved particle swarm optimization (QPSO) model, and its superiority over the conventional particle swarm optimization (PSO) model in solving this problem are successfully verified. The results show an 18.54% decrease in the average waiting time for transfer passengers with the optimized last train connections, along with an increase of 8.31% and 6.54% in the number of successful transfer passengers and directions, respectively, after optimization. The proposed QPSO model can reach convergence faster and without falling into local optima. The results also show that the average waiting time of transfer passengers can be significantly decreased after fine-tuning train operation parameters. A reasonable combination of objective weight factors (λ=10, μ=100) can reflect the game characteristics between passenger’s and operator’s preferences, while extending the service closure time within 20 min can further improve the overall service quality of last train period across the network.