Vibrating Particles System Algorithm performance in solving Constrained Optimization Problem
DOI:
https://doi.org/10.25007/ajnu.v11n3a1499Keywords:
Metaheuristic Algorithm, vibrating particles system (VPS), tension/compression spring design problem, Constrained OptimizationAbstract
Metaheuristic algorithms are a collection of sophisticated techniques that mimic natural phenomena and the rational behavior of socially intelligent living organisms like insects and animals. These techniques are employed in the fields of computer science and engineering to address various optimization problems. In this paper, the vibrating particles system(VPS) which is a recently developed metaheuristic algorithm. Generally, an under-damped single degree of freedom (SDOF) free vibration oscillates and slowly comes into a resting or equilibrium position, and this is the inspiration idea of VPS. The tension/compression spring design problem, which is a well-known constrained based optimization problem in engineering fields have been used to evaluate VPS algorithm. The experimental result section shows the result of solving the mentioned problem by VPS with various value for variables.
Downloads
References
A. Kaveh and M. I. Ghazaan, "Vibrating particles system algorithm for truss optimization with multiple natural frequency constraints," Acta Mech, 2016.
L. Bellagamba and T. Y. Yang, "Minimum-mass truss structures with constraints on fundamental natural frequency," AIAA Journal, vol. 19, no. 11, 1980.
Y. Celik and H. Kutucu, Solving the Tension/Compression Spring Design Problem by an Improved Firefly Algorithm, 2018.
D. J. Wilde and C. S. Beightler., Foundations of optimization, Prentice-Hall, Englewood Cliffs, NJ, 1967.
S. M. Almufti, "Historical survey on metaheuristics algorithms," International Journal of Scientific World, vol. 7, no. 1, pp. 1-12, 2017.
A. I. B. o. H. B. S. F. N. Optimization, Karaboğa, Derviş, 2005.
R. R. Ihsan, S. M. Almufti, B. M. Ormani, R. R. Asaad and R. B. Marqas, "A Survey on Cat Swarm Optimization Algorithm," Asian Journal of Research in Computer Science, vol. 10, no. 2, pp. 22-32, 2021.
R. V. Rao, Teaching Learning Based Optimization Algorithm, Springer, 2016.
S. M. Almufti, U-Turning Ant Colony Algorithm powered by Great Deluge Algorithm for the solution of TSP Problem, 2015.
Z. Tabrizian, G. G. Amiri and M. H. A. Beigy, "Charged System Search Algorithm Utilized for Structural Damage Detection," Shock and Vibration, 2014.
F. S. Lobato and V. S. Jr., "Fish swarm optimization algorithm applied to engineering system design," Latin American Journal of Solids and Structures, vol. 11, no. 1, 2014.
H. M. GENC, I. EKS˙IN and O. K. EROL, "Big bang-big crunch optimization algorithm with local directional moves," Turkish Journal of Electrical Engineering & Computer Sciences, vol. 21, p. 1359 – 1375, 2013.
S. M. Almufti, "lion optimization algorithm: Overview, modifications and applications," International Research Journal of Science, Technology, Education, and Management, 2022.
L. Abualigah, "Feature Selection and Enhanced Krill Herd Algorithm for Text Document Clustering," Studies in Computational Intelligence, 2019.
S. Deb, S. Fong and Z. Tian, "Elephant Search Algorithm for optimization problems," in Tenth International Conference on Digital Information Management (ICDIM), 2015.
R. B. Marqas, S. M. Almufti, H. B. Ahmed and R. R. Asaad, "Grey wolf optimizer: Overview, modifications and applications," International Research Journal of Science, Technology, Education, and Management, vol. 1, no. 1, pp. 44-56, 2021.
V. M. A. Kaveh, Colliding Bodies Optimization, springer, 2015.
S. A. Uymaz and G. Tezel, "Cuckoo Search (CS) Optimization Algorithm for Solving Constrained Optimization Problems," in International Conference on Computer Science, Engineering and Technology, 2014.
A. Kaveh and N. Farhoudi, "A new optimization method: Dolphin echolocation," Advances in Engineering Software, vol. 59, p. 53–70, 2013.
A. Y. Zebari, H. K. Omer and S. M. Almufti, "A comparative study of particle swarm optimization and genetic algorithm," Journal of Advanced Computer Science & Technology, vol. 8, no. 2, pp. 40-45, 2019.
A. Kaveh and T. Bakhshpoor, Metaheuristics: Outlines, MATLAB Codes and Examples, Springer, 2019.
S. M. Almufti, "Historical survey on metaheuristics algorithms," International Journal of Scientific World, vol. 7, no. 1, pp. 1-12, 2019.
K. Parsopoulos and M. N. Vrahatis, "Unified Particle Swarm Optimization for Solving Constrained Engineering Optimization Problems," in Lecture Notes in Computer Science, 2005.
A. Kaveh and M. I. Ghazaan, "A new meta-heuristic algorithm: Vibrating particles system," Scientia Iranica, vol. 24, no. 2, pp. 551-566, 2017.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Academic Journal of Nawroz University

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Authors retain copyright
The use of a Creative Commons License enables authors/editors to retain copyright to their work. Publications can be reused and redistributed as long as the original author is correctly attributed.
- Copyright
- The researcher(s), whether a single or joint research paper, must sell and transfer to the publisher (the Academic Journal of Nawroz University) through all the duration of the publication which starts from the date of entering this Agreement into force, the exclusive rights of the research paper/article. These rights include the translation, reuse of papers/articles, transmit or distribute, or use the material or parts(s) contained therein to be published in scientific, academic, technical, professional journals or any other periodicals including any other works derived from them, all over the world, in English and Arabic, whether in print or in electronic edition of such journals and periodicals in all types of media or formats now or that may exist in the future. Rights also include giving license (or granting permission) to a third party to use the materials and any other works derived from them and publish them in such journals and periodicals all over the world. Transfer right under this Agreement includes the right to modify such materials to be used with computer systems and software, or to reproduce or publish it in e-formats and also to incorporate them into retrieval systems.
- Reproduction, reference, transmission, distribution or any other use of the content, or any parts of the subjects included in that content in any manner permitted by this Agreement, must be accompanied by mentioning the source which is (the Academic Journal of Nawroz University) and the publisher in addition to the title of the article, the name of the author (or co-authors), journal’s name, volume or issue, publisher's copyright, and publication year.
- The Academic Journal of Nawroz University reserves all rights to publish research papers/articles issued under a “Creative Commons License (CC BY-NC-ND 4.0) which permits unrestricted use, distribution, and reproduction of the paper/article by any means, provided that the original work is correctly cited.
- Reservation of Rights
The researcher(s) preserves all intellectual property rights (except for the one transferred to the publisher under this Agreement).
- Researcher’s guarantee
The researcher(s) hereby guarantees that the content of the paper/article is original. It has been submitted only to the Academic Journal of Nawroz University and has not been previously published by any other party.
In the event that the paper/article is written jointly with other researchers, the researcher guarantees that he/she has informed the other co-authors about the terms of this agreement, as well as obtaining their signature or written permission to sign on their behalf.
The author further guarantees:
- The research paper/article does not contain any defamatory statements or illegal comments.
- The research paper/article does not violate other's rights (including but not limited to copyright, patent, and trademark rights).
This research paper/article does not contain any facts or instructions that could cause damages or harm to others, and publishing it does not lead to disclosure of any confidential information.