Low NOx combustion optimization based on partial dimension opposition-based learning particle swarm optimization

Fuel ◽  
2022 ◽  
Vol 310 ◽  
pp. 122352
Author(s):  
Qingwei Li ◽  
Qingfeng He ◽  
Zhi Liu
2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Yuntao Dai ◽  
Liqiang Liu ◽  
Shanshan Feng

A mathematical model must be established to study the motions of ships in order to control them effectively. An assessment of the model depends on the accuracy of hydrodynamic parameters. An algorithm for the parameter identification of the coupled pitch and heave motions in ships is, thus, put forward in this paper. The algorithm proposed is based on particle swarm optimization (PSO) and the opposition-based learning theory known as opposition-based particle swarm optimization (OPSO). A definition of the opposition-based learning algorithm is given first of all, with ideas on how to improve this algorithm and its process being presented next. Secondly, the design of the parameter identification algorithm is put forward, modeling the disturbing force and disturbing moment of the identification system and the output parameters of the identification system. Then, the problem involving the hydrodynamic parameters of motions is identified and the coupled pitch and heave motions of a ship described as an optimization problem with constraints. Finally, the numerical simulations of different sea conditions with unknown parameters are carried out using the PSO and OPSO algorithms. The simulation results show that the OPSO algorithm is relatively stable in terms of the hydrodynamic parameters identification of the coupled pitch and heave motions.


2011 ◽  
Vol 181 (20) ◽  
pp. 4699-4714 ◽  
Author(s):  
Hui Wang ◽  
Zhijian Wu ◽  
Shahryar Rahnamayan ◽  
Yong Liu ◽  
Mario Ventresca

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Hui Wang

This paper presents a modified barebones particle swarm optimization (OBPSO) to solve constrained nonlinear optimization problems. The proposed approach OBPSO combines barebones particle swarm optimization (BPSO) and opposition-based learning (OBL) to improve the quality of solutions. A novel boundary search strategy is used to approach the boundary between the feasible and infeasible search region. Moreover, an adaptive penalty method is employed to handle constraints. To verify the performance of OBPSO, a set of well-known constrained benchmark functions is used in the experiments. Simulation results show that our approach achieves a promising performance.


Sign in / Sign up

Export Citation Format

Share Document