Abstract

Particle swarm optimization is a popular meta-heuristic with highly explorative features; however, in its standard form it suffers from a poor convergence rate and weak search refinement on multi-dimensional problems. The present work improves the conventional particle swarm optimizer in three ways: adding a greedy selection for better intensification; embedding an extra movement borrowed from teacher–learner-based optimization; and utilizing a neighborhood strategy by averaging over a random half of the swarm. The performance of the proposed method is subsequently evaluated on three sets of problems. The first set includes uni-modal, multi-model, separable and non-separable test functions. The proposed method is compared with a standard particle swarm optimizer and its variants as well as other meta-heuristic algorithms. Engineering benchmark problems including the optimal design of a tubular column, a coiled spring, a pressure vessel and a cantilever beam constitute the second set. The third set includes constrained sizing design of a 120-bar dome truss and the optimal shape design of the Morrow Point double-arch concrete dam as a practical case study. Numerical results reveal considerable enhancement of the standard particle swarm via the proposed method to exhibit competitive performance with the other studied meta-heuristics. In the optimal design of Morrow Point Dam, the proposed method resulted in a material consumption 21 times smaller than the best of the initial population and 26% better than a recommended practical design.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call