A multi-objective particle swarm optimization algorithm based on dynamic boundary search for constrained optimization
Due to increased search complexity in multi-objective optimization, premature convergence becomes a problem. Complex engineering problems poses high number of variables with many constraints. Hence, more difficult benchmark problems must be utilized to validate new algorithms performance. A well-kno...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Published: |
Elsevier
2018
|
Subjects: | |
Online Access: | http://eprints.um.edu.my/21228/ https://doi.org/10.1016/j.asoc.2018.06.022 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.um.eprints.21228 |
---|---|
record_format |
eprints |
spelling |
my.um.eprints.212282019-05-14T08:28:17Z http://eprints.um.edu.my/21228/ A multi-objective particle swarm optimization algorithm based on dynamic boundary search for constrained optimization Mohd Zain, Mohamad Zihin Kanesan, Jeevan Chuah, Joon Huang Dhanapal, Saroja Kendall, Graham TK Electrical engineering. Electronics Nuclear engineering Due to increased search complexity in multi-objective optimization, premature convergence becomes a problem. Complex engineering problems poses high number of variables with many constraints. Hence, more difficult benchmark problems must be utilized to validate new algorithms performance. A well-known optimizer, Multi-Objective Particle Swarm Optimizer (MOPSO), has a few weakness that needs to be addressed, specifically its convergence in high dimensional problems and its constraints handling capability. For these reasons, we propose a modified MOPSO (M-MOPSO) to improve upon these aspects. M-MOPSO is compared with four other algorithms namely, MOPSO, Multi-Objective Grey Wolf Optimizer (MOGWO), Multi-Objective Evolutionary Algorithm based on Decompositions (MOEA/D) and Multi-Objective Differential Evolution (MODE). M-MOPSO emerged as the best algorithm in eight out of the ten constrained benchmark problems. It also shows promising results in bioprocess application problems and tumor treatment problems. In overall, M-MOPSO was able to solve multi-objective problems with good convergence and is suitable to be used in real world problem. Elsevier 2018 Article PeerReviewed Mohd Zain, Mohamad Zihin and Kanesan, Jeevan and Chuah, Joon Huang and Dhanapal, Saroja and Kendall, Graham (2018) A multi-objective particle swarm optimization algorithm based on dynamic boundary search for constrained optimization. Applied Soft Computing, 70. pp. 680-700. ISSN 1568-4946 https://doi.org/10.1016/j.asoc.2018.06.022 doi:10.1016/j.asoc.2018.06.022 |
institution |
Universiti Malaya |
building |
UM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Malaya |
content_source |
UM Research Repository |
url_provider |
http://eprints.um.edu.my/ |
topic |
TK Electrical engineering. Electronics Nuclear engineering |
spellingShingle |
TK Electrical engineering. Electronics Nuclear engineering Mohd Zain, Mohamad Zihin Kanesan, Jeevan Chuah, Joon Huang Dhanapal, Saroja Kendall, Graham A multi-objective particle swarm optimization algorithm based on dynamic boundary search for constrained optimization |
description |
Due to increased search complexity in multi-objective optimization, premature convergence becomes a problem. Complex engineering problems poses high number of variables with many constraints. Hence, more difficult benchmark problems must be utilized to validate new algorithms performance. A well-known optimizer, Multi-Objective Particle Swarm Optimizer (MOPSO), has a few weakness that needs to be addressed, specifically its convergence in high dimensional problems and its constraints handling capability. For these reasons, we propose a modified MOPSO (M-MOPSO) to improve upon these aspects. M-MOPSO is compared with four other algorithms namely, MOPSO, Multi-Objective Grey Wolf Optimizer (MOGWO), Multi-Objective Evolutionary Algorithm based on Decompositions (MOEA/D) and Multi-Objective Differential Evolution (MODE). M-MOPSO emerged as the best algorithm in eight out of the ten constrained benchmark problems. It also shows promising results in bioprocess application problems and tumor treatment problems. In overall, M-MOPSO was able to solve multi-objective problems with good convergence and is suitable to be used in real world problem. |
format |
Article |
author |
Mohd Zain, Mohamad Zihin Kanesan, Jeevan Chuah, Joon Huang Dhanapal, Saroja Kendall, Graham |
author_facet |
Mohd Zain, Mohamad Zihin Kanesan, Jeevan Chuah, Joon Huang Dhanapal, Saroja Kendall, Graham |
author_sort |
Mohd Zain, Mohamad Zihin |
title |
A multi-objective particle swarm optimization algorithm based on dynamic boundary search for constrained optimization |
title_short |
A multi-objective particle swarm optimization algorithm based on dynamic boundary search for constrained optimization |
title_full |
A multi-objective particle swarm optimization algorithm based on dynamic boundary search for constrained optimization |
title_fullStr |
A multi-objective particle swarm optimization algorithm based on dynamic boundary search for constrained optimization |
title_full_unstemmed |
A multi-objective particle swarm optimization algorithm based on dynamic boundary search for constrained optimization |
title_sort |
multi-objective particle swarm optimization algorithm based on dynamic boundary search for constrained optimization |
publisher |
Elsevier |
publishDate |
2018 |
url |
http://eprints.um.edu.my/21228/ https://doi.org/10.1016/j.asoc.2018.06.022 |
_version_ |
1643691503608922112 |
score |
13.160551 |