Loading…

A Multi-Swarm Structure for Particle Swarm Optimization: Solving the Welded Beam Design Problem

Several studies exist in the literature that utilized metaheuristics and nature-inspired algorithms to solve engineering problems. Particle Swarm Optimization (PSO) is a well-known nature-inspired algorithm that has been used for different optimization problems due to its simplicity and ability to f...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2021-02, Vol.1804 (1), p.12012
Main Authors: Kamil, Ahmed T., Saleh, Hadeel M., Abd-Alla, Israa Hussain
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Several studies exist in the literature that utilized metaheuristics and nature-inspired algorithms to solve engineering problems. Particle Swarm Optimization (PSO) is a well-known nature-inspired algorithm that has been used for different optimization problems due to its simplicity and ability to find near-optimal solutions. However, PSO suffers from a problem of balancing between the global search and local search abilities when applied to engineering problems. Recently, a new variant of PSO based on a novel multi-swarm architecture called Multi-swarm Particle Swarm Optimization (MPSO) was proposed. The proposed MPSO was evaluated on solving normal and large-scale problems. This study evaluated the possibility of using MPSO to simulate Welded Beam Design (WDB) problem which is a mechanical engineering problem. Several simulations were performed using the proposed approach and from the results, MPSO model was observed to simulate WBD problem with better optimal solution compared to the standalone PSO. The outcome of this study further confirmed the robustness of the MPSO over the other known metaheuristics. Generally, MPSO achieved an excellent optimization performance with a fast convergence learning process.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1804/1/012012