A novel multi-objective quantum particle swarm algorithm for suspension optimization
Visualizar/abrir
Data
2020Autor
Tipo
Assunto
Abstract
In this paper, a novel multi-objective archive-based Quantum Particle Optimizer (MOQPSO) is proposed for solving suspension optimization problems. The algorithm has been adapted from the well-knownsingle objectiveQPSOby substantialmodifications in the core equations and implementation of new multi-objectivemechanisms. The novel algorithmMOQPSO and the long-establishedNSGA-II andCOGA-II (Compressed-ObjectiveGenetic Algorithm with Convergence Detection) are compared. Two situations are considered ...
In this paper, a novel multi-objective archive-based Quantum Particle Optimizer (MOQPSO) is proposed for solving suspension optimization problems. The algorithm has been adapted from the well-knownsingle objectiveQPSOby substantialmodifications in the core equations and implementation of new multi-objectivemechanisms. The novel algorithmMOQPSO and the long-establishedNSGA-II andCOGA-II (Compressed-ObjectiveGenetic Algorithm with Convergence Detection) are compared. Two situations are considered in this paper: a simple half-car suspension model and a bus suspension model. The numerical model of the bus allows complex dynamic interactions not considered in previous studies. The suitability of the solution is evaluated based on vibration-related ISO Standards, and the efficiency of the proposed algorithm is tested by dominance comparison. For a specifically chosen Pareto front solution found by MOQPSO in the second case, the passengers and driver accelerations attenuated about 50% and 33%, respectively, regarding non-optimal suspension parameters. All solutions found by NSGA-II are dominated by those found byMOQPSO,which presented a Pareto front noticeably wider for the same number of objective function calls. ...
Contido em
Matemática aplicada e computacional. Rio de Janeiro. Vol. 39, no. 2 (May 2020), Art. 105, 29 p.
Origem
Nacional
Coleções
-
Artigos de Periódicos (41542)Engenharias (2502)
Este item está licenciado na Creative Commons License