Reduction of Computational Load for MOPSO
MetadataShow full item record
The run time for many optimisation algorithms, particularly those that explicitly consider multiple objectives, can be impractically large when applied to real world problems. This paper reports an investigation into the behaviour of Multi-Objective Particle Swarm Optimisation (MOPSO), which seeks to reduce the number of objective function evaluations needed, with-out degrading solution quality. By restricting archive size and strategically reducing the trial solution population size, it has been found the number of function evaluations can be reduced by 66.7% without significant reduction in solution quality. In fact, careful manipulation of algorithm operating parameters can even significantly improve solution quality.
International Conference On Computational Science, ICCS 2015 — Computational Science at the Gates of Nature
© 2015 The Authors. Published by Elsevier B.V. This is an Open Access article distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) License (https://creativecommons.org/licenses/by-nc-nd/4.0/) which permits unrestricted, non-commercial use, distribution and reproduction in any medium, providing that the work is properly cited. You may not alter, transform, or build upon this work.