Multi-task allocation with an optimized quantum particle swarm method

2020 ◽  
Vol 96 ◽  
pp. 106603
Author(s):  
Mincan Li ◽  
Chubo Liu ◽  
Kenli Li ◽  
Xiangke Liao ◽  
Keqin Li
Keyword(s):  
Task Allocation ◽  
Quantum Particle ◽  
Particle Swarm ◽  
Particle Swarm Method

Fault Diagnosis of Wind Turbine Gearbox Based on Improved QPSO Algorithm

2019 ◽  
Vol 12 (3) ◽  
pp. 277-283
Author(s):  
Jiatang Cheng ◽  
Yan Xiong
Keyword(s):  
Particle Swarm Optimization ◽  
Fault Diagnosis ◽  
Wind Turbine ◽  
Bp Neural Network ◽  
Quantum Particle ◽  
Particle Swarm ◽  
Wind Turbine Gearbox ◽  
Bp Network ◽  
Swarm Optimization ◽  
Quantum Particle Swarm Optimization

Background: The effective diagnosis of wind turbine gearbox fault is an important means to ensure the normal and stable operation and avoid unexpected accidents. Methods: To accurately identify the fault modes of the wind turbine gearbox, an intelligent diagnosis technology based on BP neural network trained by the Improved Quantum Particle Swarm Optimization Algorithm (IQPSOBP) is proposed. In IQPSO approach, the random adjustment scheme of contractionexpansion coefficient and the restarting strategy are employed, and the performance evaluation is executed on a set of benchmark test functions. Subsequently, the fault diagnosis model of the wind turbine gearbox is built by using IQPSO algorithm and BP neural network. Results: According to the evaluation results, IQPSO is superior to PSO and QPSO algorithms. Also, compared with BP network, BP network trained by Particle Swarm Optimization (PSOBP) and BP network trained by Quantum Particle Swarm Optimization (QPSOBP), IQPSOBP has the highest diagnostic accuracy. Conclusion: The presented method provides a new reference for the fault diagnosis of wind turbine gearbox.

Research on disruption management of urgent arrival in job shop with deteriorating effect

2021 ◽  
pp. 1-13
Author(s):  
Ning Tao ◽  
Duan Xiaodong ◽  
An Lu ◽  
Gou Tao
Keyword(s):  
Prospect Theory ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Quantum Particle ◽  
Particle Swarm ◽  
Cumulative Prospect Theory ◽  
Disruption Management ◽  
Particle Swarm Algorithm ◽  
Shop Scheduling ◽  
Management Method

A disruption management method based on cumulative prospect theory is proposed for the urgent with deteriorating effect arrival in flexible job shop scheduling problem (FJSP). First, the mathematical model of problem is established with minimizing the completion time of urgent order, minimizing the total process time of the system and minimizing the total cost as the target. Then, the cumulative prospect theory equation of the urgent arrival in job shop scheduling process is induced designed. Based on the selected model, an optimized multi-phase quantum particle swarm algorithm (MQPSO) is proposed for selecting processing route. Finally, using Solomon example simulation and company Z riveting shop example as the study object, the performance of the proposed method is analyzed. It is compared with the current common rescheduling methods, and the results verify that the method proposed in this paper not only meets the goal of the optimized objects, but improves the practical requirements for the stability of production and processing system during urgent arrival. Lastly, the optimized multiphase quantum particle swarm algorithm is used to solve disruption management of urgent arrival problem. Through instance analysis and comparison, the effectiveness and efficiency of urgent arrival disruption management method with deteriorating effect are verified.

scholarly journals Particle swarm optimization algorithm for the optimization of rescue task allocation with uncertain time constraints

2021 ◽  
Author(s):  
Na Geng ◽  
Zhiting Chen ◽  
Quang A. Nguyen ◽  
Dunwei Gong
Keyword(s):  
Particle Swarm Optimization ◽  
Task Allocation ◽  
Optimal Algorithm ◽  
Particle Swarm ◽  
Evolutionary Process ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Fitness Evaluation ◽  
Modified Particle Swarm Optimization ◽  
Uncertain Time

AbstractThis paper focuses on the problem of robot rescue task allocation, in which multiple robots and a global optimal algorithm are employed to plan the rescue task allocation. Accordingly, a modified particle swarm optimization (PSO) algorithm, referred to as task allocation PSO (TAPSO), is proposed. Candidate assignment solutions are represented as particles and evolved using an evolutionary process. The proposed TAPSO method is characterized by a flexible assignment decoding scheme to avoid the generation of unfeasible assignments. The maximum number of successful tasks (survivors) is considered as the fitness evaluation criterion under a scenario where the survivors’ survival time is uncertain. To improve the solution, a global best solution update strategy, which updates the global best solution depends on different phases so as to balance the exploration and exploitation, is proposed. TAPSO is tested on different scenarios and compared with other counterpart algorithms to verify its efficiency.

scholarly journals A Multimodal Smart Quantum Particle Swarm Optimization for Electromagnetic Design Optimization Problems

Energies ◽  
2021 ◽  
Vol 14 (15) ◽  
pp. 4613
Author(s):  
Shah Fahad ◽  
Shiyou Yang ◽  
Rehan Ali Khan ◽  
Shafiullah Khan ◽  
Shoaib Ahmed Khan
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Quantum Particle ◽  
Particle Swarm ◽  
Continuous Variables ◽  
Design Problems ◽  
Swarm Optimization ◽  
Electromagnetic Design ◽  
Quantum Particle Swarm Optimization ◽  
Engineering Design Problems

Electromagnetic design problems are generally formulated as nonlinear programming problems with multimodal objective functions and continuous variables. These can be solved by either a deterministic or a stochastic optimization algorithm. Recently, many intelligent optimization algorithms, such as particle swarm optimization (PSO), genetic algorithm (GA) and artificial bee colony (ABC), have been proposed and applied to electromagnetic design problems with promising results. However, there is no universal algorithm which can be used to solve engineering design problems. In this paper, a stochastic smart quantum particle swarm optimization (SQPSO) algorithm is introduced. In the proposed SQPSO, to tackle the premature convergence problem in order to improve the global search ability, a smart particle and a memory archive are adopted instead of mutation operations. Moreover, to enhance the exploration searching ability, a new set of random numbers and control parameters are introduced. Experimental results validate that the adopted control policy in this work can achieve a good balance between exploration and exploitation. Finally, the SQPSO has been tested on well-known optimization benchmark functions and implemented on the electromagnetic TEAM workshop problem 22. The simulation result shows an outstanding capability of the proposed algorithm in speeding convergence compared to other algorithms.

scholarly journals Enhanced Differential Crossover and Quantum Particle Swarm Optimization for IoT Applications

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Sheetal N. Ghorpade ◽  
Marco Zennaro ◽  
Bharat S. Chaudhari ◽  
Rashid A. Saeed ◽  
Hesham Alhumyani ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Quantum Particle ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Quantum Particle Swarm Optimization ◽  
Iot Applications

scholarly journals Minimization of Logistics Cost and Carbon Emissions Based on Quantum Particle Swarm Optimization

2018 ◽  
Vol 10 (10) ◽  
pp. 3791 ◽  
Author(s):  
Daqing Wu ◽  
Jiazhen Huo ◽  
Gefu Zhang ◽  
Weihua Zhang
Keyword(s):  
Particle Swarm Optimization ◽  
Supply Chain ◽  
Carbon Emissions ◽  
Time Window ◽  
Quantum Particle ◽  
Particle Swarm ◽  
Transport Cost ◽  
Distribution Centers ◽  
Swarm Optimization ◽  
Quantum Particle Swarm Optimization

This paper aims to simultaneously minimize logistics costs and carbon emissions. For this purpose, a mathematical model for a three-echelon supply chain network is created considering the relevant constraints such as capacity, production cost, transport cost, carbon emissions, and time window, which will be solved by the proposed quantum-particle swarm optimization algorithm. The three-echelon supply chain, consisting of suppliers, distribution centers, and retailers, is established based on the number and location of suppliers, the transport method from suppliers to distribution centers, and the quantity of products to be transported from suppliers to distribution centers and from these centers to retailers. Then, a quantum-particle swarm optimization is described as its performance is validated with different benchmark functions. The scenario analysis validates the model and evaluates its performance to balance the economic benefit and environmental effect.

Sign in / Sign up

Export Citation Format

Share Document